{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/reinforcement-learning-1/papers/16","list_of":"/task/reinforcement-learning-1","task":"Reinforcement Learning (RL)","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":16,"pages_in_order":152,"rows_per_page":100,"rows":[1501,1600],"of":15113,"counts":{"archive_papers_tagged":15113,"with_a_code_link":4749,"where_syntology_ran_a_sample":1416,"not_listed_spam_title":0,"listed":15113,"listed_where_code_ran":1416,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1186,"every_run_a_failure_of_syntologys_instrument":230,"listed_with_a_run_with_no_instrument_failure":1186,"listed_every_run_a_failure_of_syntologys_instrument":230,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/reinforcement-learning-1","prev":"/task/reinforcement-learning-1/papers/15","next":"/task/reinforcement-learning-1/papers/17","papers":[{"url":"/paper/memory-enhanced-neural-solvers-for-efficient","slug":"memory-enhanced-neural-solvers-for-efficient","title":"Memory-Enhanced Neural Solvers for Efficient Adaptation in Combinatorial Optimization","date":"2024-06-24","arxiv_id":"2406.16424","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/memory-enhanced-neural-solvers-for-efficient#ran","syntology_url":"https://syntology.ai/paper/2406.16424","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.16424"}},"official":{"repos":["instadeepai/memento"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/reinforcement-learning-via-auxiliary-task","slug":"reinforcement-learning-via-auxiliary-task","title":"Reinforcement Learning via Auxiliary Task Distillation","date":"2024-06-24","arxiv_id":"2406.17168","repositories_listed":1,"syntology":null},{"url":"/paper/uncertainty-aware-reward-free-exploration","slug":"uncertainty-aware-reward-free-exploration","title":"Uncertainty-Aware Reward-Free Exploration with General Function Approximation","date":"2024-06-24","arxiv_id":"2406.16255","repositories_listed":1,"syntology":{"n":15,"n_ran":12,"n_constructed":5,"n_ran_checked":11,"n_instrument":1,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":10,"n_pointer_only":1,"phrase":"12 ran (of which 5 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 0 violated, 10 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/uncertainty-aware-reward-free-exploration#ran","syntology_url":"https://syntology.ai/paper/2406.16255","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.16255"}},"official":{"repos":["uclaml/gfa-rfe"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":5,"n_ran_no_instrument_failure":11,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/enhancing-commentary-strategies-for-imperfect","slug":"enhancing-commentary-strategies-for-imperfect","title":"Enhancing Commentary Strategies for Imperfect Information Card Games: A Study of Large Language Models in Guandan Commentary","date":"2024-06-23","arxiv_id":"2406.17807","repositories_listed":1,"syntology":null},{"url":"/paper/decentralized-transformers-with-centralized","slug":"decentralized-transformers-with-centralized","title":"Decentralized Transformers with Centralized Aggregation are Sample-Efficient Multi-Agent World Models","date":"2024-06-22","arxiv_id":"2406.15836","repositories_listed":1,"syntology":null},{"url":"/paper/direct-multi-turn-preference-optimization-for","slug":"direct-multi-turn-preference-optimization-for","title":"Direct Multi-Turn Preference Optimization for Language Agents","date":"2024-06-21","arxiv_id":"2406.14868","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/direct-multi-turn-preference-optimization-for#ran","syntology_url":"https://syntology.ai/paper/2406.14868","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.14868"}},"official":{"repos":["swt-user/dmpo"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sit-symmetry-invariant-transformers-for","slug":"sit-symmetry-invariant-transformers-for","title":"SiT: Symmetry-Invariant Transformers for Generalisation in Reinforcement Learning","date":"2024-06-21","arxiv_id":"2406.15025","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-optimism-exploration-with-partially","slug":"beyond-optimism-exploration-with-partially","title":"Beyond Optimism: Exploration With Partially Observable Rewards","date":"2024-06-20","arxiv_id":"2406.13909","repositories_listed":1,"syntology":{"n":10,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":10,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/beyond-optimism-exploration-with-partially#ran","syntology_url":"https://syntology.ai/paper/2406.13909","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.13909"}},"official":{"repos":["AmiiThinks/mon_mdp_neurips24"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/macrohft-memory-augmented-context-aware","slug":"macrohft-memory-augmented-context-aware","title":"MacroHFT: Memory Augmented Context-aware Reinforcement Learning On High Frequency Trading","date":"2024-06-20","arxiv_id":"2406.14537","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":9,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/macrohft-memory-augmented-context-aware#ran","syntology_url":"https://syntology.ai/paper/2406.14537","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.14537"}},"official":{"repos":["ZONG0004/MacroHFT"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/rl-on-incorrect-synthetic-data-scales-the","slug":"rl-on-incorrect-synthetic-data-scales-the","title":"RL on Incorrect Synthetic Data Scales the Efficiency of LLM Math Reasoning by Eight-Fold","date":"2024-06-20","arxiv_id":"2406.14532","repositories_listed":1,"syntology":null},{"url":"/paper/soft-qmix-integrating-maximum-entropy-for","slug":"soft-qmix-integrating-maximum-entropy-for","title":"Soft-QMIX: Integrating Maximum Entropy For Monotonic Value Function Factorization","date":"2024-06-20","arxiv_id":"2406.13930","repositories_listed":1,"syntology":null},{"url":"/paper/imagining-in-distribution-states-how","slug":"imagining-in-distribution-states-how","title":"Imagining In-distribution States: How Predictable Robot Behavior Can Enable User Control Over Learned Policies","date":"2024-06-19","arxiv_id":"2406.13711","repositories_listed":1,"syntology":null},{"url":"/paper/a-systematization-of-the-wagner-framework","slug":"a-systematization-of-the-wagner-framework","title":"A Systematization of the Wagner Framework: Graph Theory Conjectures and Reinforcement Learning","date":"2024-06-18","arxiv_id":"2406.12667","repositories_listed":1,"syntology":null},{"url":"/paper/discovering-minimal-reinforcement-learning","slug":"discovering-minimal-reinforcement-learning","title":"Discovering Minimal Reinforcement Learning Environments","date":"2024-06-18","arxiv_id":"2406.12589","repositories_listed":1,"syntology":null},{"url":"/paper/more-efficient-randomized-exploration-for","slug":"more-efficient-randomized-exploration-for","title":"More Efficient Randomized Exploration for Reinforcement Learning via Approximate Sampling","date":"2024-06-18","arxiv_id":"2406.12241","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/more-efficient-randomized-exploration-for#ran","syntology_url":"https://syntology.ai/paper/2406.12241","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.12241"}},"official":{"repos":["panxulab/lsvi-ase"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/unizero-generalized-and-efficient-planning","slug":"unizero-generalized-and-efficient-planning","title":"UniZero: Generalized and Efficient Planning with Scalable Latent World Models","date":"2024-06-15","arxiv_id":"2406.10667","repositories_listed":1,"syntology":null},{"url":"/paper/is-value-learning-really-the-main-bottleneck","slug":"is-value-learning-really-the-main-bottleneck","title":"Is Value Learning Really the Main Bottleneck in Offline RL?","date":"2024-06-13","arxiv_id":"2406.09329","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":6,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 6 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/is-value-learning-really-the-main-bottleneck#ran","syntology_url":"https://syntology.ai/paper/2406.09329","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.09329"}},"official":null}},{"url":"/paper/reinforcement-learning-to-disentangle","slug":"reinforcement-learning-to-disentangle","title":"Reinforcement Learning to Disentangle Multiqubit Quantum States from Partial Observations","date":"2024-06-12","arxiv_id":"2406.07884","repositories_listed":1,"syntology":null},{"url":"/paper/residual-learning-and-context-encoding-for","slug":"residual-learning-and-context-encoding-for","title":"Residual Learning and Context Encoding for Adaptive Offline-to-Online Reinforcement Learning","date":"2024-06-12","arxiv_id":"2406.08238","repositories_listed":1,"syntology":null},{"url":"/paper/when-do-skills-help-reinforcement-learning-a","slug":"when-do-skills-help-reinforcement-learning-a","title":"When Do Skills Help Reinforcement Learning? A Theoretical Analysis of Temporal Abstractions","date":"2024-06-12","arxiv_id":"2406.07897","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/when-do-skills-help-reinforcement-learning-a#ran","syntology_url":"https://syntology.ai/paper/2406.07897","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.07897"}},"official":{"repos":["uranium11010/rl-skill-theory"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/unifying-interpretability-and-explainability","slug":"unifying-interpretability-and-explainability","title":"Unifying Interpretability and Explainability for Alzheimer's Disease Progression Prediction","date":"2024-06-11","arxiv_id":"2406.07777","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/unifying-interpretability-and-explainability#ran","syntology_url":"https://syntology.ai/paper/2406.07777","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.07777"}},"official":{"repos":["rfali/xrlad"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/decoupling-regularization-from-the-action","slug":"decoupling-regularization-from-the-action","title":"Decoupling regularization from the action space","date":"2024-06-10","arxiv_id":"2406.05953","repositories_listed":1,"syntology":null},{"url":"/paper/deep-multi-objective-reinforcement-learning","slug":"deep-multi-objective-reinforcement-learning","title":"Deep Multi-Objective Reinforcement Learning for Utility-Based Infrastructural Maintenance Optimization","date":"2024-06-10","arxiv_id":"2406.06184","repositories_listed":1,"syntology":null},{"url":"/paper/expil-explanatory-predicate-invention-for","slug":"expil-explanatory-predicate-invention-for","title":"EXPIL: Explanatory Predicate Invention for Learning in Games","date":"2024-06-10","arxiv_id":"2406.06107","repositories_listed":1,"syntology":null},{"url":"/paper/investigating-pre-training-objectives-for","slug":"investigating-pre-training-objectives-for","title":"Investigating Pre-Training Objectives for Generalization in Vision-Based Reinforcement Learning","date":"2024-06-10","arxiv_id":"2406.06037","repositories_listed":1,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":8,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/investigating-pre-training-objectives-for#ran","syntology_url":"https://syntology.ai/paper/2406.06037","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.06037"}},"official":{"repos":["dojeon-ai/atari-pb"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/is-value-functions-estimation-with","slug":"is-value-functions-estimation-with","title":"Is Value Functions Estimation with Classification Plug-and-play for Offline Reinforcement Learning?","date":"2024-06-10","arxiv_id":"2406.06309","repositories_listed":1,"syntology":null},{"url":"/paper/icu-sepsis-a-benchmark-mdp-built-from-real","slug":"icu-sepsis-a-benchmark-mdp-built-from-real","title":"ICU-Sepsis: A Benchmark MDP Built from Real Medical Data","date":"2024-06-09","arxiv_id":"2406.05646","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/icu-sepsis-a-benchmark-mdp-built-from-real#ran","syntology_url":"https://syntology.ai/paper/2406.05646","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.05646"}},"official":{"repos":["icu-sepsis/icu-sepsis"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/starling-self-supervised-training-of-text","slug":"starling-self-supervised-training-of-text","title":"STARLING: Self-supervised Training of Text-based Reinforcement Learning Agent with Large Language Models","date":"2024-06-09","arxiv_id":"2406.05872","repositories_listed":1,"syntology":null},{"url":"/paper/decision-mamba-a-multi-grained-state-space","slug":"decision-mamba-a-multi-grained-state-space","title":"Decision Mamba: A Multi-Grained State Space Model with Self-Evolution Regularization for Offline RL","date":"2024-06-08","arxiv_id":"2406.05427","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":4,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/decision-mamba-a-multi-grained-state-space#ran","syntology_url":"https://syntology.ai/paper/2406.05427","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.05427"}},"official":{"repos":["aopolin-lv/DecisionMamba"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["community","official"]}}},{"url":"/paper/deterministic-uncertainty-propagation-for","slug":"deterministic-uncertainty-propagation-for","title":"Deterministic Uncertainty Propagation for Improved Model-Based Offline Reinforcement Learning","date":"2024-06-06","arxiv_id":"2406.04088","repositories_listed":1,"syntology":null},{"url":"/paper/hackatari-atari-learning-environments-for","slug":"hackatari-atari-learning-environments-for","title":"HackAtari: Atari Learning Environments for Robust and Continual Reinforcement Learning","date":"2024-06-06","arxiv_id":"2406.03997","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hackatari-atari-learning-environments-for#ran","syntology_url":"https://syntology.ai/paper/2406.03997","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03997"}},"official":{"repos":["k4ntz/HackAtari"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/strategically-conservative-q-learning","slug":"strategically-conservative-q-learning","title":"Strategically Conservative Q-Learning","date":"2024-06-06","arxiv_id":"2406.04534","repositories_listed":1,"syntology":null},{"url":"/paper/towards-dynamic-trend-filtering-through-trend","slug":"towards-dynamic-trend-filtering-through-trend","title":"Towards Dynamic Trend Filtering through Trend Point Detection with Reinforcement Learning","date":"2024-06-06","arxiv_id":"2406.03665","repositories_listed":1,"syntology":null},{"url":"/paper/commonpower-supercharging-machine-learning","slug":"commonpower-supercharging-machine-learning","title":"CommonPower: A Framework for Safe Data-Driven Smart Grid Control","date":"2024-06-05","arxiv_id":"2406.03231","repositories_listed":1,"syntology":null},{"url":"/paper/fine-grained-causal-dynamics-learning-with","slug":"fine-grained-causal-dynamics-learning-with","title":"Fine-Grained Causal Dynamics Learning with Quantization for Improving Robustness in Reinforcement Learning","date":"2024-06-05","arxiv_id":"2406.03234","repositories_listed":1,"syntology":{"n":11,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/fine-grained-causal-dynamics-learning-with#ran","syntology_url":"https://syntology.ai/paper/2406.03234","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03234"}},"official":{"repos":["iwhwang/Fine-Grained-Causal-RL"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/give-me-an-example-like-this-episodic-active","slug":"give-me-an-example-like-this-episodic-active","title":"\"Give Me an Example Like This\": Episodic Active Reinforcement Learning from Demonstrations","date":"2024-06-05","arxiv_id":"2406.03069","repositories_listed":1,"syntology":null},{"url":"/paper/cross-embodiment-robot-manipulation-skill","slug":"cross-embodiment-robot-manipulation-skill","title":"Cross-Embodiment Robot Manipulation Skill Transfer using Latent Space Alignment","date":"2024-06-04","arxiv_id":"2406.01968","repositories_listed":1,"syntology":null},{"url":"/paper/mamba-as-decision-maker-exploring-multi-scale","slug":"mamba-as-decision-maker-exploring-multi-scale","title":"Mamba as Decision Maker: Exploring Multi-scale Sequence Modeling in Offline Reinforcement Learning","date":"2024-06-04","arxiv_id":"2406.02013","repositories_listed":1,"syntology":null},{"url":"/paper/moseac-streamlined-variable-time-step","slug":"moseac-streamlined-variable-time-step","title":"MOSEAC: Streamlined Variable Time Step Reinforcement Learning","date":"2024-06-03","arxiv_id":"2406.01521","repositories_listed":1,"syntology":null},{"url":"/paper/when-to-sense-and-control-a-time-adaptive","slug":"when-to-sense-and-control-a-time-adaptive","title":"When to Sense and Control? A Time-adaptive Approach for Continuous-Time RL","date":"2024-06-03","arxiv_id":"2406.01163","repositories_listed":1,"syntology":null},{"url":"/paper/furl-visual-language-models-as-fuzzy-rewards","slug":"furl-visual-language-models-as-fuzzy-rewards","title":"FuRL: Visual-Language Models as Fuzzy Rewards for Reinforcement Learning","date":"2024-06-02","arxiv_id":"2406.00645","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/furl-visual-language-models-as-fuzzy-rewards#ran","syntology_url":"https://syntology.ai/paper/2406.00645","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.00645"}},"official":{"repos":["fuyw/furl"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/crafting-a-pogo-stick-in-minecraft-with","slug":"crafting-a-pogo-stick-in-minecraft-with","title":"Crafting a Pogo Stick in Minecraft with Heuristic Search (Extended Abstract)","date":"2024-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-design-principles-for-offline-to","slug":"bayesian-design-principles-for-offline-to","title":"Bayesian Design Principles for Offline-to-Online Reinforcement Learning","date":"2024-05-31","arxiv_id":"2405.20984","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/bayesian-design-principles-for-offline-to#ran","syntology_url":"https://syntology.ai/paper/2405.20984","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.20984"}},"official":{"repos":["YiqinYang/BOORL"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/diffusion-actor-critic-formulating","slug":"diffusion-actor-critic-formulating","title":"Diffusion Actor-Critic: Formulating Constrained Policy Iteration as Diffusion Noise Regression for Offline Reinforcement Learning","date":"2024-05-31","arxiv_id":"2405.20555","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":8,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/diffusion-actor-critic-formulating#ran","syntology_url":"https://syntology.ai/paper/2405.20555","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.20555"}},"official":{"repos":["Fang-Lin93/DAC"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/enhancing-efficiency-of-safe-reinforcement","slug":"enhancing-efficiency-of-safe-reinforcement","title":"Enhancing Efficiency of Safe Reinforcement Learning via Sample Manipulation","date":"2024-05-31","arxiv_id":"2405.20860","repositories_listed":1,"syntology":null},{"url":"/paper/in-context-decision-transformer-reinforcement","slug":"in-context-decision-transformer-reinforcement","title":"In-Context Decision Transformer: Reinforcement Learning via Hierarchical Chain-of-Thought","date":"2024-05-31","arxiv_id":"2405.20692","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/in-context-decision-transformer-reinforcement#ran","syntology_url":"https://syntology.ai/paper/2405.20692","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.20692"}},"official":{"repos":["silihuang-ai/idt"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/diffusion-policies-creating-a-trust-region","slug":"diffusion-policies-creating-a-trust-region","title":"Diffusion Policies creating a Trust Region for Offline Reinforcement Learning","date":"2024-05-30","arxiv_id":"2405.19690","repositories_listed":1,"syntology":{"n":20,"n_ran":17,"n_constructed":0,"n_ran_checked":11,"n_instrument":6,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":20,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 6 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/diffusion-policies-creating-a-trust-region#ran","syntology_url":"https://syntology.ai/paper/2405.19690","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.19690"}},"official":{"repos":["tianyucodings/diffusion_trusted_q_learning"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/a-study-of-plasticity-loss-in-on-policy-deep","slug":"a-study-of-plasticity-loss-in-on-policy-deep","title":"A Study of Plasticity Loss in On-Policy Deep Reinforcement Learning","date":"2024-05-29","arxiv_id":"2405.19153","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":11,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/a-study-of-plasticity-loss-in-on-policy-deep#ran","syntology_url":"https://syntology.ai/paper/2405.19153","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.19153"}},"official":{"repos":["awjuliani/deep-rl-plasticity"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/kernel-metric-learning-for-in-sample-off","slug":"kernel-metric-learning-for-in-sample-off","title":"Kernel Metric Learning for In-Sample Off-Policy Evaluation of Deterministic RL Policies","date":"2024-05-29","arxiv_id":"2405.18792","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":2,"n_ran_checked":2,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"5 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/kernel-metric-learning-for-in-sample-off#ran","syntology_url":"https://syntology.ai/paper/2405.18792","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.18792"}},"official":{"repos":["haanvid/kmifqe"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/rlexplore-accelerating-research-in","slug":"rlexplore-accelerating-research-in","title":"RLeXplore: Accelerating Research in Intrinsically-Motivated Reinforcement Learning","date":"2024-05-29","arxiv_id":"2405.19548","repositories_listed":1,"syntology":null},{"url":"/paper/adr-bc-adversarial-density-weighted","slug":"adr-bc-adversarial-density-weighted","title":"Imitating from auxiliary imperfect demonstrations via Adversarial Density Weighted Regression","date":"2024-05-28","arxiv_id":"2405.20351","repositories_listed":1,"syntology":null},{"url":"/paper/dtr-bench-an-in-silico-environment-and","slug":"dtr-bench-an-in-silico-environment-and","title":"DTR-Bench: An in silico Environment and Benchmark Platform for Reinforcement Learning Based Dynamic Treatment Regime","date":"2024-05-28","arxiv_id":"2405.18610","repositories_listed":1,"syntology":null},{"url":"/paper/getting-more-juice-out-of-the-sft-data-reward","slug":"getting-more-juice-out-of-the-sft-data-reward","title":"Getting More Juice Out of the SFT Data: Reward Learning from Human Demonstration Improves SFT for LLM Alignment","date":"2024-05-28","arxiv_id":"2405.17888","repositories_listed":1,"syntology":{"n":8,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/getting-more-juice-out-of-the-sft-data-reward#ran","syntology_url":"https://syntology.ai/paper/2405.17888","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.17888"}},"official":{"repos":["jasonjiaxiangli/reward_learning_sft"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/large-language-model-driven-curriculum-design","slug":"large-language-model-driven-curriculum-design","title":"Large Language Model-Driven Curriculum Design for Mobile Networks","date":"2024-05-28","arxiv_id":"2405.18039","repositories_listed":1,"syntology":null},{"url":"/paper/offline-boosted-actor-critic-adaptively","slug":"offline-boosted-actor-critic-adaptively","title":"Offline-Boosted Actor-Critic: Adaptively Blending Optimal Historical Behaviors in Deep Off-Policy RL","date":"2024-05-28","arxiv_id":"2405.18520","repositories_listed":1,"syntology":null},{"url":"/paper/reinforcement-learning-in-dynamic-treatment","slug":"reinforcement-learning-in-dynamic-treatment","title":"Reinforcement Learning in Dynamic Treatment Regimes Needs Critical Reexamination","date":"2024-05-28","arxiv_id":"2405.18556","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":9,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/reinforcement-learning-in-dynamic-treatment#ran","syntology_url":"https://syntology.ai/paper/2405.18556","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.18556"}},"official":{"repos":["gilesluo/reassessdtr"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/safe-reinforcement-learning-in-black-box","slug":"safe-reinforcement-learning-in-black-box","title":"Safe Reinforcement Learning in Black-Box Environments via Adaptive Shielding","date":"2024-05-28","arxiv_id":"2405.18180","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-transformers-in-solving-pomdps","slug":"rethinking-transformers-in-solving-pomdps","title":"Rethinking Transformers in Solving POMDPs","date":"2024-05-27","arxiv_id":"2405.17358","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/rethinking-transformers-in-solving-pomdps#ran","syntology_url":"https://syntology.ai/paper/2405.17358","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.17358"}},"official":{"repos":["ctp314/tfporl"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/surprise-adaptive-intrinsic-motivation-for","slug":"surprise-adaptive-intrinsic-motivation-for","title":"Surprise-Adaptive Intrinsic Motivation for Unsupervised Reinforcement Learning","date":"2024-05-27","arxiv_id":"2405.17243","repositories_listed":1,"syntology":null},{"url":"/paper/symmetric-reinforcement-learning-loss-for","slug":"symmetric-reinforcement-learning-loss-for","title":"Symmetric Reinforcement Learning Loss for Robust Learning on Diverse Tasks and Model Scales","date":"2024-05-27","arxiv_id":"2405.17618","repositories_listed":1,"syntology":null},{"url":"/paper/competing-for-pixels-a-self-play-algorithm","slug":"competing-for-pixels-a-self-play-algorithm","title":"Competing for pixels: a self-play algorithm for weakly-supervised segmentation","date":"2024-05-26","arxiv_id":"2405.16628","repositories_listed":1,"syntology":null},{"url":"/paper/safe-and-balanced-a-framework-for-constrained","slug":"safe-and-balanced-a-framework-for-constrained","title":"Safe and Balanced: A Framework for Constrained Multi-Objective Reinforcement Learning","date":"2024-05-26","arxiv_id":"2405.16390","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/safe-and-balanced-a-framework-for-constrained#ran","syntology_url":"https://syntology.ai/paper/2405.16390","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16390"}},"official":{"repos":["SafeRL-Lab/Safe-Multi-Objective-MuJoCo"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/triple-preference-optimization-achieving","slug":"triple-preference-optimization-achieving","title":"Triple Preference Optimization: Achieving Better Alignment with Less Data in a Single Step Optimization","date":"2024-05-26","arxiv_id":"2405.16681","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/triple-preference-optimization-achieving#ran","syntology_url":"https://syntology.ai/paper/2405.16681","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16681"}},"official":{"repos":["sahsaeedi/triple-preference-optimization"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/bigger-regularized-optimistic-scaling-for","slug":"bigger-regularized-optimistic-scaling-for","title":"Bigger, Regularized, Optimistic: scaling for compute and sample-efficient continuous control","date":"2024-05-25","arxiv_id":"2405.16158","repositories_listed":1,"syntology":{"n":20,"n_ran":11,"n_constructed":7,"n_ran_checked":10,"n_instrument":1,"n_unverified":9,"n_honours":2,"n_violates":1,"n_no_contract":7,"n_pointer_only":3,"phrase":"11 ran (of which 7 constructed an object rather than computing a result; 10 with no instrument failure: 2 honoured, 1 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/bigger-regularized-optimistic-scaling-for#ran","syntology_url":"https://syntology.ai/paper/2405.16158","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16158"}},"official":{"repos":["naumix/BiggerRegularizedOptimistic"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/diffusion-based-reinforcement-learning-via-q","slug":"diffusion-based-reinforcement-learning-via-q","title":"Diffusion-based Reinforcement Learning via Q-weighted Variational Policy Optimization","date":"2024-05-25","arxiv_id":"2405.16173","repositories_listed":1,"syntology":null},{"url":"/paper/cross-domain-policy-adaptation-by-capturing","slug":"cross-domain-policy-adaptation-by-capturing","title":"Cross-Domain Policy Adaptation by Capturing Representation Mismatch","date":"2024-05-24","arxiv_id":"2405.15369","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":3,"n_ran_checked":9,"n_instrument":1,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":9,"phrase":"10 ran (of which 3 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/cross-domain-policy-adaptation-by-capturing#ran","syntology_url":"https://syntology.ai/paper/2405.15369","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.15369"}},"official":{"repos":["dmksjfl/par"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/diffusion-actor-critic-with-entropy-regulator","slug":"diffusion-actor-critic-with-entropy-regulator","title":"Diffusion Actor-Critic with Entropy Regulator","date":"2024-05-24","arxiv_id":"2405.15177","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/diffusion-actor-critic-with-entropy-regulator#ran","syntology_url":"https://syntology.ai/paper/2405.15177","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.15177"}},"official":{"repos":["happy-yan/DACER-Diffusion-with-Online-RL"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-recurrent-off-policy-rl-requires-a","slug":"efficient-recurrent-off-policy-rl-requires-a","title":"Efficient Recurrent Off-Policy RL Requires a Context-Encoder-Specific Learning Rate","date":"2024-05-24","arxiv_id":"2405.15384","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/efficient-recurrent-off-policy-rl-requires-a#ran","syntology_url":"https://syntology.ai/paper/2405.15384","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.15384"}},"official":{"repos":["FanmingL/Recurrent-Offpolicy-RL"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/generating-code-world-models-with-large","slug":"generating-code-world-models-with-large","title":"Generating Code World Models with Large Language Models Guided by Monte Carlo Tree Search","date":"2024-05-24","arxiv_id":"2405.15383","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/generating-code-world-models-with-large#ran","syntology_url":"https://syntology.ai/paper/2405.15383","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.15383"}},"official":{"repos":["nicoladainese96/code-world-models"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/model-free-reinforcement-learning-with-noisy","slug":"model-free-reinforcement-learning-with-noisy","title":"Model-free reinforcement learning with noisy actions for automated experimental control in optics","date":"2024-05-24","arxiv_id":"2405.15421","repositories_listed":1,"syntology":null},{"url":"/paper/agile-a-novel-framework-of-llm-agents","slug":"agile-a-novel-framework-of-llm-agents","title":"AGILE: A Novel Reinforcement Learning Framework of LLM Agents","date":"2024-05-23","arxiv_id":"2405.14751","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/agile-a-novel-framework-of-llm-agents#ran","syntology_url":"https://syntology.ai/paper/2405.14751","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.14751"}},"official":{"repos":["bytarnish/agile"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-turn-reinforcement-learning-from","slug":"multi-turn-reinforcement-learning-from","title":"Multi-turn Reinforcement Learning from Preference Human Feedback","date":"2024-05-23","arxiv_id":"2405.14655","repositories_listed":1,"syntology":null},{"url":"/paper/offline-reinforcement-learning-from-datasets","slug":"offline-reinforcement-learning-from-datasets","title":"Offline Reinforcement Learning from Datasets with Structured Non-Stationarity","date":"2024-05-23","arxiv_id":"2405.14114","repositories_listed":1,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/offline-reinforcement-learning-from-datasets#ran","syntology_url":"https://syntology.ai/paper/2405.14114","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.14114"}},"official":{"repos":["johannesack/offlinerlstructurednonstationarity"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/peac-unsupervised-pre-training-for-cross","slug":"peac-unsupervised-pre-training-for-cross","title":"PEAC: Unsupervised Pre-training for Cross-Embodiment Reinforcement Learning","date":"2024-05-23","arxiv_id":"2405.14073","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/peac-unsupervised-pre-training-for-cross#ran","syntology_url":"https://syntology.ai/paper/2405.14073","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.14073"}},"official":{"repos":["thu-ml/CEURL"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/variational-delayed-policy-optimization","slug":"variational-delayed-policy-optimization","title":"Variational Delayed Policy Optimization","date":"2024-05-23","arxiv_id":"2405.14226","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":7,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/variational-delayed-policy-optimization#ran","syntology_url":"https://syntology.ai/paper/2405.14226","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.14226"}},"official":{"repos":["qingyuanwunothing/vdpo"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/actor-critic-algorithms-for-fiber-sampling","slug":"actor-critic-algorithms-for-fiber-sampling","title":"Learning to sample fibers for goodness-of-fit testing","date":"2024-05-22","arxiv_id":"2405.13950","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-reasoning-with-self","slug":"knowledge-graph-reasoning-with-self","title":"Knowledge Graph Reasoning with Self-supervised Reinforcement Learning","date":"2024-05-22","arxiv_id":"2405.13640","repositories_listed":1,"syntology":null},{"url":"/paper/lusifer-llm-based-user-simulated-feedback","slug":"lusifer-llm-based-user-simulated-feedback","title":"Lusifer: LLM-based User SImulated Feedback Environment for online Recommender systems","date":"2024-05-22","arxiv_id":"2405.13362","repositories_listed":1,"syntology":null},{"url":"/paper/maximum-entropy-reinforcement-learning-via","slug":"maximum-entropy-reinforcement-learning-via","title":"Maximum Entropy Reinforcement Learning via Energy-Based Normalizing Flow","date":"2024-05-22","arxiv_id":"2405.13629","repositories_listed":1,"syntology":null},{"url":"/paper/causalplayground-addressing-data-generation","slug":"causalplayground-addressing-data-generation","title":"CausalPlayground: Addressing Data-Generation Requirements in Cutting-Edge Causality Research","date":"2024-05-21","arxiv_id":"2405.13092","repositories_listed":1,"syntology":null},{"url":"/paper/feasibility-consistent-representation","slug":"feasibility-consistent-representation","title":"Feasibility Consistent Representation Learning for Safe Reinforcement Learning","date":"2024-05-20","arxiv_id":"2405.11718","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/feasibility-consistent-representation#ran","syntology_url":"https://syntology.ai/paper/2405.11718","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.11718"}},"official":{"repos":["czp16/fcsrl"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/scrutinize-what-we-ignore-reining-task","slug":"scrutinize-what-we-ignore-reining-task","title":"Scrutinize What We Ignore: Reining In Task Representation Shift Of Context-Based Offline Meta Reinforcement Learning","date":"2024-05-20","arxiv_id":"2405.12001","repositories_listed":1,"syntology":null},{"url":"/paper/large-language-models-are-biased","slug":"large-language-models-are-biased","title":"Large Language Models are Biased Reinforcement Learners","date":"2024-05-19","arxiv_id":"2405.11422","repositories_listed":1,"syntology":null},{"url":"/paper/simulation-based-benchmarking-of","slug":"simulation-based-benchmarking-of","title":"Simulation-Based Benchmarking of Reinforcement Learning Agents for Personalized Retail Promotions","date":"2024-05-16","arxiv_id":"2405.10469","repositories_listed":1,"syntology":null},{"url":"/paper/cardreamer-open-source-learning-platform-for","slug":"cardreamer-open-source-learning-platform-for","title":"CarDreamer: Open-Source Learning Platform for World Model based Autonomous Driving","date":"2024-05-15","arxiv_id":"2405.09111","repositories_listed":1,"syntology":null},{"url":"/paper/reinformer-max-return-sequence-modeling-for","slug":"reinformer-max-return-sequence-modeling-for","title":"Reinformer: Max-Return Sequence Modeling for Offline RL","date":"2024-05-14","arxiv_id":"2405.08740","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/reinformer-max-return-sequence-modeling-for#ran","syntology_url":"https://syntology.ai/paper/2405.08740","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.08740"}},"official":{"repos":["dragon-zhuang/reinformer"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/cages-cost-aware-gradient-entropy-search-for","slug":"cages-cost-aware-gradient-entropy-search-for","title":"CAGES: Cost-Aware Gradient Entropy Search for Efficient Local Multi-Fidelity Bayesian Optimization","date":"2024-05-13","arxiv_id":"2405.07760","repositories_listed":1,"syntology":null},{"url":"/paper/hype-or-heuristic-quantum-reinforcement","slug":"hype-or-heuristic-quantum-reinforcement","title":"Hype or Heuristic? Quantum Reinforcement Learning for Join Order Optimisation","date":"2024-05-13","arxiv_id":"2405.07770","repositories_listed":1,"syntology":null},{"url":"/paper/value-augmented-sampling-for-language-model","slug":"value-augmented-sampling-for-language-model","title":"Value Augmented Sampling for Language Model Alignment and Personalization","date":"2024-05-10","arxiv_id":"2405.06639","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/value-augmented-sampling-for-language-model#ran","syntology_url":"https://syntology.ai/paper/2405.06639","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.06639"}},"official":{"repos":["idanshen/Value-Augmented-Sampling"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/in-context-learning-for-automated-driving","slug":"in-context-learning-for-automated-driving","title":"Human-centric Reward Optimization for Reinforcement Learning-based Automated Driving using Large Language Models","date":"2024-05-07","arxiv_id":"2405.04135","repositories_listed":1,"syntology":null},{"url":"/paper/swiftrl-towards-efficient-reinforcement","slug":"swiftrl-towards-efficient-reinforcement","title":"SwiftRL: Towards Efficient Reinforcement Learning on Real Processing-In-Memory Systems","date":"2024-05-07","arxiv_id":"2405.03967","repositories_listed":1,"syntology":null},{"url":"/paper/reverse-forward-curriculum-learning-for","slug":"reverse-forward-curriculum-learning-for","title":"Reverse Forward Curriculum Learning for Extreme Sample and Demonstration Efficiency in Reinforcement Learning","date":"2024-05-06","arxiv_id":"2405.03379","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":7,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/reverse-forward-curriculum-learning-for#ran","syntology_url":"https://syntology.ai/paper/2405.03379","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.03379"}},"official":{"repos":["stonet2000/rfcl"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/ctd4-a-deep-continuous-distributional-actor","slug":"ctd4-a-deep-continuous-distributional-actor","title":"CTD4 -- A Deep Continuous Distributional Actor-Critic Agent with a Kalman Fusion of Multiple Critics","date":"2024-05-04","arxiv_id":"2405.02576","repositories_listed":1,"syntology":null},{"url":"/paper/proximal-curriculum-with-task-correlations","slug":"proximal-curriculum-with-task-correlations","title":"Proximal Curriculum with Task Correlations for Deep Reinforcement Learning","date":"2024-05-03","arxiv_id":"2405.02481","repositories_listed":1,"syntology":null},{"url":"/paper/simulating-the-economic-impact-of-rationality","slug":"simulating-the-economic-impact-of-rationality","title":"Simulating the Economic Impact of Rationality through Reinforcement Learning and Agent-Based Modelling","date":"2024-05-03","arxiv_id":"2405.02161","repositories_listed":1,"syntology":null},{"url":"/paper/no-representation-no-trust-connecting","slug":"no-representation-no-trust-connecting","title":"No Representation, No Trust: Connecting Representation, Collapse, and Trust Issues in PPO","date":"2024-05-01","arxiv_id":"2405.00662","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/no-representation-no-trust-connecting#ran","syntology_url":"https://syntology.ai/paper/2405.00662","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.00662"}},"official":{"repos":["claire-labo/no-representation-no-trust"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/countering-reward-over-optimization-in-llm","slug":"countering-reward-over-optimization-in-llm","title":"Countering Reward Over-optimization in LLM with Demonstration-Guided Reinforcement Learning","date":"2024-04-30","arxiv_id":"2404.19409","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-communicate-functional-states","slug":"learning-to-communicate-functional-states","title":"Learning to Communicate Functional States with Nonverbal Expressions for Improved Human-Robot Collaboration","date":"2024-04-30","arxiv_id":"2404.19253","repositories_listed":1,"syntology":null},{"url":"/paper/pessimistic-value-iteration-for-multi-task","slug":"pessimistic-value-iteration-for-multi-task","title":"Pessimistic Value Iteration for Multi-Task Data Sharing in Offline Reinforcement Learning","date":"2024-04-30","arxiv_id":"2404.19346","repositories_listed":1,"syntology":null},{"url":"/paper/a-fast-balance-optimization-approach-for","slug":"a-fast-balance-optimization-approach-for","title":"A fast balance optimization approach for charging enhancement of lithium-ion battery packs through deep reinforcement learning","date":"2024-04-24","arxiv_id":null,"repositories_listed":1,"syntology":null}],"record_sha256":"f37718d64e7750cbbeab1589bf8974655179f9c71a384c50ebc0197a4f2a94ee","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}