{"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/efficient-exploration","name":"Efficient Exploration","slug":"efficient-exploration","description_markdown":"**Efficient Exploration** is one of the main obstacles in scaling up modern deep reinforcement learning algorithms. The main challenge in Efficient Exploration is the balance between exploiting current estimates, and gaining information about poorly understood states and actions.\n\n\n<span class=\"description-source\">Source: [Randomized Value Functions via Multiplicative Normalizing Flows ](https://arxiv.org/abs/1806.02315)</span>","categories":[{"name":"Methodology","url":"/area/methodology"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":514,"papers_with_code":189,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":3,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/replica","name":"Replica","full_name":"","num_papers_in_archive":414},{"url":"/dataset/house3d-environment","name":"House3D Environment","full_name":"","num_papers_in_archive":11},{"url":"/dataset/qdsd","name":"QDSD","full_name":"Quantum Dots Stability Diagrams","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":6,"rows_per_page":100,"shown":100,"of":514,"of_with_code":189,"tagged_in_all":514,"counts":{"archive_papers_tagged":514,"with_a_code_link":189,"where_syntology_ran_a_sample":57,"not_listed_spam_title":0,"listed":514,"listed_where_code_ran":57,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":47,"every_run_a_failure_of_syntologys_instrument":10,"listed_with_a_run_with_no_instrument_failure":47,"listed_every_run_a_failure_of_syntologys_instrument":10,"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"},"items":[{"url":"/paper/noisy-networks-for-exploration","slug":"noisy-networks-for-exploration","title":"Noisy Networks for Exploration","date":"2017-06-30","arxiv_id":"1706.10295","repositories_listed":15,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 2 unverified","sample_list":"/paper/noisy-networks-for-exploration#ran","syntology_url":"https://syntology.ai/paper/1706.10295","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.10295"}},"official":null}},{"url":"/paper/automatic-chemical-design-using-a-data-driven","slug":"automatic-chemical-design-using-a-data-driven","title":"Automatic chemical design using a data-driven continuous representation of molecules","date":"2016-10-07","arxiv_id":"1610.02415","repositories_listed":11,"syntology":{"n":26,"n_ran":17,"n_constructed":1,"n_ran_checked":14,"n_instrument":3,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":7,"phrase":"17 ran (of which 1 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 3 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/automatic-chemical-design-using-a-data-driven#ran","syntology_url":"https://syntology.ai/paper/1610.02415","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1610.02415"}},"official":{"repos":["HIPS/molecule-autoencoder","aspuru-guzik-group/chemical_vae"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":5,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/efficient-off-policy-meta-reinforcement","slug":"efficient-off-policy-meta-reinforcement","title":"Efficient Off-Policy Meta-Reinforcement Learning via Probabilistic Context Variables","date":"2019-03-19","arxiv_id":"1903.08254","repositories_listed":7,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":5,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/efficient-off-policy-meta-reinforcement#ran","syntology_url":"https://syntology.ai/paper/1903.08254","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.08254"}},"official":{"repos":["katerakelly/oyster"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/stochastic-gradient-hamiltonian-monte-carlo","slug":"stochastic-gradient-hamiltonian-monte-carlo","title":"Stochastic Gradient Hamiltonian Monte Carlo","date":"2014-02-17","arxiv_id":"1402.4102","repositories_listed":7,"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/stochastic-gradient-hamiltonian-monte-carlo#ran","syntology_url":"https://syntology.ai/paper/1402.4102","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1402.4102"}},"official":null}},{"url":"/paper/deep-exploration-via-bootstrapped-dqn","slug":"deep-exploration-via-bootstrapped-dqn","title":"Deep Exploration via Bootstrapped DQN","date":"2016-02-15","arxiv_id":"1602.04621","repositories_listed":6,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/deep-exploration-via-bootstrapped-dqn#ran","syntology_url":"https://syntology.ai/paper/1602.04621","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1602.04621"}},"official":null}},{"url":"/paper/neural-contextual-bandits-with-upper","slug":"neural-contextual-bandits-with-upper","title":"Neural Contextual Bandits with UCB-based Exploration","date":"2019-11-11","arxiv_id":"1911.04462","repositories_listed":4,"syntology":null},{"url":"/paper/data-efficient-exploration-optimization-and","slug":"data-efficient-exploration-optimization-and","title":"Data-Efficient Exploration, Optimization, and Modeling of Diverse Designs through Surrogate-Assisted Illumination","date":"2017-02-13","arxiv_id":"1702.03713","repositories_listed":4,"syntology":null},{"url":"/paper/hyperagent-a-simple-scalable-efficient-and","slug":"hyperagent-a-simple-scalable-efficient-and","title":"Q-Star Meets Scalable Posterior Sampling: Bridging Theory and Practice via HyperAgent","date":"2024-02-05","arxiv_id":"2402.10228","repositories_listed":3,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/hyperagent-a-simple-scalable-efficient-and#ran","syntology_url":"https://syntology.ai/paper/2402.10228","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.10228"}},"official":{"repos":["szrlee/hyperagent"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/online-limited-memory-neural-linear-bandits-1","slug":"online-limited-memory-neural-linear-bandits-1","title":"Online Limited Memory Neural-Linear Bandits with Likelihood Matching","date":"2021-02-07","arxiv_id":"2102.03799","repositories_listed":3,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"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) · 5 unverified","sample_list":"/paper/online-limited-memory-neural-linear-bandits-1#ran","syntology_url":"https://syntology.ai/paper/2102.03799","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.03799"}},"official":null}},{"url":"/paper/shared-experience-actor-critic-for-multi","slug":"shared-experience-actor-critic-for-multi","title":"Shared Experience Actor-Critic for Multi-Agent Reinforcement Learning","date":"2020-06-12","arxiv_id":"2006.07169","repositories_listed":3,"syntology":null},{"url":"/paper/scaling-map-elites-to-deep-neuroevolution","slug":"scaling-map-elites-to-deep-neuroevolution","title":"Scaling MAP-Elites to Deep Neuroevolution","date":"2020-03-03","arxiv_id":"2003.01825","repositories_listed":3,"syntology":null},{"url":"/paper/conex-efficient-exploration-of-big-data","slug":"conex-efficient-exploration-of-big-data","title":"ConEx: Efficient Exploration of Big-Data System Configurations for Better Performance","date":"2019-10-17","arxiv_id":"1910.09644","repositories_listed":3,"syntology":null},{"url":"/paper/scheduled-policy-optimization-for-natural","slug":"scheduled-policy-optimization-for-natural","title":"Scheduled Policy Optimization for Natural Language Communication with Intelligent Agents","date":"2018-06-16","arxiv_id":"1806.06187","repositories_listed":3,"syntology":null},{"url":"/paper/adaptive-foundation-models-for-online","slug":"adaptive-foundation-models-for-online","title":"Scalable Exploration via Ensemble++","date":"2024-07-18","arxiv_id":"2407.13195","repositories_listed":2,"syntology":{"n":8,"n_ran":5,"n_constructed":1,"n_ran_checked":3,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":8,"phrase":"5 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/adaptive-foundation-models-for-online#ran","syntology_url":"https://syntology.ai/paper/2407.13195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.13195"}},"official":{"repos":["szrlee/GPT-HyperAgent","szrlee/ensemble_plus_plus"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/streamlining-ocean-dynamics-modeling-with","slug":"streamlining-ocean-dynamics-modeling-with","title":"Streamlining Ocean Dynamics Modeling with Fourier Neural Operators: A Multiobjective Hyperparameter and Architecture Optimization Approach","date":"2024-04-07","arxiv_id":"2404.05768","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/streamlining-ocean-dynamics-modeling-with#ran","syntology_url":"https://syntology.ai/paper/2404.05768","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.05768"}},"official":null}},{"url":"/paper/hierarchical-spatial-proximity-reasoning-for","slug":"hierarchical-spatial-proximity-reasoning-for","title":"Hierarchical Spatial Proximity Reasoning for Vision-and-Language Navigation","date":"2024-03-18","arxiv_id":"2403.11541","repositories_listed":2,"syntology":null},{"url":"/paper/demonstration-guided-reinforcement-learning-1","slug":"demonstration-guided-reinforcement-learning-1","title":"Demonstration-Guided Reinforcement Learning with Efficient Exploration for Task Automation of Surgical Robot","date":"2023-02-20","arxiv_id":"2302.09772","repositories_listed":2,"syntology":null},{"url":"/paper/online-decision-transformer","slug":"online-decision-transformer","title":"Online Decision Transformer","date":"2022-02-11","arxiv_id":"2202.05607","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"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) · 0 unverified","sample_list":"/paper/online-decision-transformer#ran","syntology_url":"https://syntology.ai/paper/2202.05607","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.05607"}},"official":{"repos":["facebookresearch/online-dt"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["community"]}}},{"url":"/paper/episodic-multi-agent-reinforcement-learning-1","slug":"episodic-multi-agent-reinforcement-learning-1","title":"Episodic Multi-agent Reinforcement Learning with Curiosity-Driven Exploration","date":"2021-11-22","arxiv_id":"2111.11032","repositories_listed":2,"syntology":null},{"url":"/paper/paradiseo-from-a-modular-framework-for","slug":"paradiseo-from-a-modular-framework-for","title":"Paradiseo: From a Modular Framework for Evolutionary Computation to the Automated Design of Metaheuristics ---22 Years of Paradiseo---","date":"2021-05-02","arxiv_id":"2105.00420","repositories_listed":2,"syntology":null},{"url":"/paper/state-entropy-maximization-with-random","slug":"state-entropy-maximization-with-random","title":"State Entropy Maximization with Random Encoders for Efficient Exploration","date":"2021-02-18","arxiv_id":"2102.09430","repositories_listed":2,"syntology":null},{"url":"/paper/bebold-exploration-beyond-the-boundary-of-1","slug":"bebold-exploration-beyond-the-boundary-of-1","title":"BeBold: Exploration Beyond the Boundary of Explored Regions","date":"2020-12-15","arxiv_id":"2012.08621","repositories_listed":2,"syntology":null},{"url":"/paper/hybrid-genetic-search-for-the-cvrp-open","slug":"hybrid-genetic-search-for-the-cvrp-open","title":"Hybrid Genetic Search for the CVRP: Open-Source Implementation and SWAP* Neighborhood","date":"2020-11-23","arxiv_id":"2012.10384","repositories_listed":2,"syntology":null},{"url":"/paper/self-supervised-exploration-via-disagreement","slug":"self-supervised-exploration-via-disagreement","title":"Self-Supervised Exploration via Disagreement","date":"2019-06-10","arxiv_id":"1906.04161","repositories_listed":2,"syntology":null},{"url":"/paper/estimating-risk-and-uncertainty-in-deep","slug":"estimating-risk-and-uncertainty-in-deep","title":"Estimating Risk and Uncertainty in Deep Reinforcement Learning","date":"2019-05-23","arxiv_id":"1905.09638","repositories_listed":2,"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":0,"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/estimating-risk-and-uncertainty-in-deep#ran","syntology_url":"https://syntology.ai/paper/1905.09638","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.09638"}},"official":{"repos":["IndustAI/risk-and-uncertainty"],"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/learning-exploration-policies-for-navigation","slug":"learning-exploration-policies-for-navigation","title":"Learning Exploration Policies for Navigation","date":"2019-03-05","arxiv_id":"1903.01959","repositories_listed":2,"syntology":null},{"url":"/paper/model-based-active-exploration","slug":"model-based-active-exploration","title":"Model-Based Active Exploration","date":"2018-10-29","arxiv_id":"1810.12162","repositories_listed":2,"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":1,"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/model-based-active-exploration#ran","syntology_url":"https://syntology.ai/paper/1810.12162","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.12162"}},"official":{"repos":["nnaisense/max"],"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/nsga-net-a-multi-objective-genetic-algorithm","slug":"nsga-net-a-multi-objective-genetic-algorithm","title":"NSGA-Net: Neural Architecture Search using Multi-Objective Genetic Algorithm","date":"2018-10-08","arxiv_id":"1810.03522","repositories_listed":2,"syntology":null},{"url":"/paper/count-based-exploration-with-the-successor","slug":"count-based-exploration-with-the-successor","title":"Count-Based Exploration with the Successor Representation","date":"2018-07-31","arxiv_id":"1807.11622","repositories_listed":2,"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":0,"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/count-based-exploration-with-the-successor#ran","syntology_url":"https://syntology.ai/paper/1807.11622","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.11622"}},"official":{"repos":["mcmachado/count_based_exploration_sr"],"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/randomized-value-functions-via-multiplicative","slug":"randomized-value-functions-via-multiplicative","title":"Randomized Value Functions via Multiplicative Normalizing Flows","date":"2018-06-06","arxiv_id":"1806.02315","repositories_listed":2,"syntology":null},{"url":"/paper/variance-networks-when-expectation-does-not","slug":"variance-networks-when-expectation-does-not","title":"Variance Networks: When Expectation Does Not Meet Your Expectations","date":"2018-03-10","arxiv_id":"1803.03764","repositories_listed":2,"syntology":{"n":15,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":7,"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) · 7 unverified","sample_list":"/paper/variance-networks-when-expectation-does-not#ran","syntology_url":"https://syntology.ai/paper/1803.03764","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.03764"}},"official":{"repos":["da-molchanov/variance-networks"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/noisy-natural-gradient-as-variational","slug":"noisy-natural-gradient-as-variational","title":"Noisy Natural Gradient as Variational Inference","date":"2017-12-06","arxiv_id":"1712.02390","repositories_listed":2,"syntology":null},{"url":"/paper/mermaidflow-redefining-agentic-workflow","slug":"mermaidflow-redefining-agentic-workflow","title":"MermaidFlow: Redefining Agentic Workflow Generation via Safety-Constrained Evolutionary Programming","date":"2025-05-29","arxiv_id":"2505.22967","repositories_listed":1,"syntology":null},{"url":"/paper/discover-automated-curricula-for-sparse","slug":"discover-automated-curricula-for-sparse","title":"DISCOVER: Automated Curricula for Sparse-Reward Reinforcement Learning","date":"2025-05-26","arxiv_id":"2505.19850","repositories_listed":1,"syntology":null},{"url":"/paper/foresightnav-learning-scene-imagination-for","slug":"foresightnav-learning-scene-imagination-for","title":"ForesightNav: Learning Scene Imagination for Efficient Exploration","date":"2025-04-22","arxiv_id":"2504.16062","repositories_listed":1,"syntology":null},{"url":"/paper/disentangling-uncertainties-by-learning","slug":"disentangling-uncertainties-by-learning","title":"Disentangling Uncertainties by Learning Compressed Data Representation","date":"2025-03-20","arxiv_id":"2503.15801","repositories_listed":1,"syntology":null},{"url":"/paper/reward-centered-rest-mcts-a-robust-decision","slug":"reward-centered-rest-mcts-a-robust-decision","title":"Reward-Centered ReST-MCTS: A Robust Decision-Making Framework for Robotic Manipulation in High Uncertainty Environments","date":"2025-03-07","arxiv_id":"2503.05226","repositories_listed":1,"syntology":null},{"url":"/paper/contextualizing-biological-perturbation","slug":"contextualizing-biological-perturbation","title":"Contextualizing biological perturbation experiments through language","date":"2025-02-28","arxiv_id":"2502.21290","repositories_listed":1,"syntology":null},{"url":"/paper/training-a-generally-curious-agent","slug":"training-a-generally-curious-agent","title":"Training a Generally Curious Agent","date":"2025-02-24","arxiv_id":"2502.17543","repositories_listed":1,"syntology":null},{"url":"/paper/maximum-entropy-reinforcement-learning-with-1","slug":"maximum-entropy-reinforcement-learning-with-1","title":"Maximum Entropy Reinforcement Learning with Diffusion Policy","date":"2025-02-17","arxiv_id":"2502.11612","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":6,"n_ran_checked":8,"n_instrument":2,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":6,"n_pointer_only":13,"phrase":"10 ran (of which 6 constructed an object rather than computing a result; 8 with no instrument failure: 2 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/maximum-entropy-reinforcement-learning-with-1#ran","syntology_url":"https://syntology.ai/paper/2502.11612","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.11612"}},"official":{"repos":["diffusionyes/maxentdp"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":6,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/few-shot-llm-synthetic-data-with-distribution","slug":"few-shot-llm-synthetic-data-with-distribution","title":"Few-shot_LLM_Synthetic_Data_with_Distribution_Matching","date":"2025-02-09","arxiv_id":"2502.08661","repositories_listed":1,"syntology":null},{"url":"/paper/gnn-dt-graph-neural-network-enhanced-decision","slug":"gnn-dt-graph-neural-network-enhanced-decision","title":"GNN-DT: Graph Neural Network Enhanced Decision Transformer for Efficient Optimization in Dynamic Environments","date":"2025-02-03","arxiv_id":"2502.01778","repositories_listed":1,"syntology":null},{"url":"/paper/langevin-soft-actor-critic-efficient","slug":"langevin-soft-actor-critic-efficient","title":"Langevin Soft Actor-Critic: Efficient Exploration through Uncertainty-Driven Critic Learning","date":"2025-01-29","arxiv_id":"2501.17827","repositories_listed":1,"syntology":{"n":11,"n_ran":6,"n_constructed":1,"n_ran_checked":3,"n_instrument":3,"n_unverified":5,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"6 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/langevin-soft-actor-critic-efficient#ran","syntology_url":"https://syntology.ai/paper/2501.17827","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.17827"}},"official":{"repos":["hmishfaq/lsac"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/mapping-galaxy-images-across-ultraviolet","slug":"mapping-galaxy-images-across-ultraviolet","title":"Mapping Galaxy Images Across Ultraviolet, Visible and Infrared Bands Using Generative Deep Learning","date":"2025-01-25","arxiv_id":"2501.15149","repositories_listed":1,"syntology":null},{"url":"/paper/multi-objective-hyperparameter-selection-via","slug":"multi-objective-hyperparameter-selection-via","title":"Multi-Objective Hyperparameter Selection via Hypothesis Testing on Reliability Graphs","date":"2025-01-22","arxiv_id":"2501.13018","repositories_listed":1,"syntology":null},{"url":"/paper/a-diversity-enhanced-genetic-algorithm-for","slug":"a-diversity-enhanced-genetic-algorithm-for","title":"A diversity-enhanced genetic algorithm for efficient exploration of parameter spaces","date":"2024-12-22","arxiv_id":"2412.17104","repositories_listed":1,"syntology":null},{"url":"/paper/genplan-generative-sequence-models-as","slug":"genplan-generative-sequence-models-as","title":"GenPlan: Generative Sequence Models as Adaptive Planners","date":"2024-12-11","arxiv_id":"2412.08565","repositories_listed":1,"syntology":null},{"url":"/paper/umbrella-reinforcement-learning","slug":"umbrella-reinforcement-learning","title":"Umbrella Reinforcement Learning -- computationally efficient tool for hard non-linear problems","date":"2024-11-21","arxiv_id":"2411.14117","repositories_listed":1,"syntology":null},{"url":"/paper/learning-dynamic-cognitive-map-with","slug":"learning-dynamic-cognitive-map-with","title":"Learning Dynamic Cognitive Map with Autonomous Navigation","date":"2024-11-13","arxiv_id":"2411.08447","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-sampling-for-high-utility-patterns","slug":"scalable-sampling-for-high-utility-patterns","title":"Scalable Sampling for High Utility Patterns","date":"2024-10-30","arxiv_id":"2410.22964","repositories_listed":1,"syntology":null},{"url":"/paper/leveraging-skills-from-unlabeled-prior-data","slug":"leveraging-skills-from-unlabeled-prior-data","title":"Leveraging Skills from Unlabeled Prior Data for Efficient Online Exploration","date":"2024-10-23","arxiv_id":"2410.18076","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":2,"n_instrument":6,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"8 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; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/leveraging-skills-from-unlabeled-prior-data#ran","syntology_url":"https://syntology.ai/paper/2410.18076","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.18076"}},"official":{"repos":["rail-berkeley/supe"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/top-erl-transformer-based-off-policy-episodic","slug":"top-erl-transformer-based-off-policy-episodic","title":"TOP-ERL: Transformer-based Off-Policy Episodic Reinforcement Learning","date":"2024-10-12","arxiv_id":"2410.09536","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-integration-in-hierarchical","slug":"meta-learning-integration-in-hierarchical","title":"Meta-Learning Integration in Hierarchical Reinforcement Learning for Advanced Task Complexity","date":"2024-10-10","arxiv_id":"2410.07921","repositories_listed":1,"syntology":null},{"url":"/paper/llama-berry-pairwise-optimization-for-o1-like","slug":"llama-berry-pairwise-optimization-for-o1-like","title":"LLaMA-Berry: Pairwise Optimization for O1-like Olympiad-Level Mathematical Reasoning","date":"2024-10-03","arxiv_id":"2410.02884","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":6,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/llama-berry-pairwise-optimization-for-o1-like#ran","syntology_url":"https://syntology.ai/paper/2410.02884","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.02884"}},"official":null}},{"url":"/paper/adaptive-teachers-for-amortized-samplers","slug":"adaptive-teachers-for-amortized-samplers","title":"Adaptive teachers for amortized samplers","date":"2024-10-02","arxiv_id":"2410.01432","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":1,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"5 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adaptive-teachers-for-amortized-samplers#ran","syntology_url":"https://syntology.ai/paper/2410.01432","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.01432"}},"official":{"repos":["alstn12088/adaptive-teacher"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/goal-reaching-policy-learning-from-non-expert","slug":"goal-reaching-policy-learning-from-non-expert","title":"Goal-Reaching Policy Learning from Non-Expert Observations via Effective Subgoal Guidance","date":"2024-09-06","arxiv_id":"2409.03996","repositories_listed":1,"syntology":null},{"url":"/paper/persistent-sampling-unleashing-the-potential","slug":"persistent-sampling-unleashing-the-potential","title":"Persistent Sampling: Enhancing the Efficiency of Sequential Monte Carlo","date":"2024-07-30","arxiv_id":"2407.20722","repositories_listed":1,"syntology":null},{"url":"/paper/exciting-action-investigating-efficient","slug":"exciting-action-investigating-efficient","title":"Exciting Action: Investigating Efficient Exploration for Learning Musculoskeletal Humanoid Locomotion","date":"2024-07-16","arxiv_id":"2407.11658","repositories_listed":1,"syntology":null},{"url":"/paper/preference-guided-reinforcement-learning-for","slug":"preference-guided-reinforcement-learning-for","title":"Preference-Guided Reinforcement Learning for Efficient Exploration","date":"2024-07-09","arxiv_id":"2407.06503","repositories_listed":1,"syntology":null},{"url":"/paper/uncertainty-guided-optimization-on-large","slug":"uncertainty-guided-optimization-on-large","title":"Uncertainty-Guided Optimization on Large Language Model Search Trees","date":"2024-07-04","arxiv_id":"2407.03951","repositories_listed":1,"syntology":null},{"url":"/paper/ascent-amplifying-power-side-channel","slug":"ascent-amplifying-power-side-channel","title":"ASCENT: Amplifying Power Side-Channel Resilience via Learning & Monte-Carlo Tree Search","date":"2024-06-27","arxiv_id":"2406.19549","repositories_listed":1,"syntology":null},{"url":"/paper/instance-temperature-knowledge-distillation","slug":"instance-temperature-knowledge-distillation","title":"Instance Temperature Knowledge Distillation","date":"2024-06-27","arxiv_id":"2407.00115","repositories_listed":1,"syntology":null},{"url":"/paper/oto-planner-an-efficient-only-travelling-once","slug":"oto-planner-an-efficient-only-travelling-once","title":"OTO Planner: An Efficient Only Travelling Once Exploration Planner for Complex and Unknown Environments","date":"2024-06-11","arxiv_id":"2406.07294","repositories_listed":1,"syntology":null},{"url":"/paper/robust-quantum-dots-charge-autotuning-using","slug":"robust-quantum-dots-charge-autotuning-using","title":"Robust quantum dots charge autotuning using neural network uncertainty","date":"2024-06-07","arxiv_id":"2406.05175","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-exploration-of-the-rashomon-set-of","slug":"efficient-exploration-of-the-rashomon-set-of","title":"Efficient Exploration of the Rashomon Set of Rule Set Models","date":"2024-06-05","arxiv_id":"2406.03059","repositories_listed":1,"syntology":null},{"url":"/paper/sound-heuristic-search-value-iteration-for","slug":"sound-heuristic-search-value-iteration-for","title":"Sound Heuristic Search Value Iteration for Undiscounted POMDPs with Reachability Objectives","date":"2024-06-05","arxiv_id":"2406.02871","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-exploration-in-average-reward","slug":"efficient-exploration-in-average-reward","title":"Efficient Exploration in Average-Reward Constrained Reinforcement Learning: Achieving Near-Optimal Regret With Posterior Sampling","date":"2024-05-29","arxiv_id":"2405.19017","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":2,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 2 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/efficient-exploration-in-average-reward#ran","syntology_url":"https://syntology.ai/paper/2405.19017","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.19017"}},"official":{"repos":["danilprov/cmdp"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/evolutionary-large-language-model-for","slug":"evolutionary-large-language-model-for","title":"Evolutionary Large Language Model for Automated Feature Transformation","date":"2024-05-25","arxiv_id":"2405.16203","repositories_listed":1,"syntology":null},{"url":"/paper/navigating-chemical-space-with-latent-flows","slug":"navigating-chemical-space-with-latent-flows","title":"Navigating Chemical Space with Latent Flows","date":"2024-05-07","arxiv_id":"2405.03987","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":6,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/navigating-chemical-space-with-latent-flows#ran","syntology_url":"https://syntology.ai/paper/2405.03987","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.03987"}},"official":{"repos":["garywei944/chemflow"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":6,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/diffusion-reinforcement-learning-hierarchical","slug":"diffusion-reinforcement-learning-hierarchical","title":"Diffusion-Reinforcement Learning Hierarchical Motion Planning in Multi-agent Adversarial Games","date":"2024-03-16","arxiv_id":"2403.10794","repositories_listed":1,"syntology":null},{"url":"/paper/mamba-an-effective-world-model-approach-for","slug":"mamba-an-effective-world-model-approach-for","title":"MAMBA: an Effective World Model Approach for Meta-Reinforcement Learning","date":"2024-03-14","arxiv_id":"2403.09859","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":3,"n_instrument":4,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":9,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/mamba-an-effective-world-model-approach-for#ran","syntology_url":"https://syntology.ai/paper/2403.09859","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.09859"}},"official":{"repos":["zoharri/mamba"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/scalable-online-exploration-via-coverability","slug":"scalable-online-exploration-via-coverability","title":"Scalable Online Exploration via Coverability","date":"2024-03-11","arxiv_id":"2403.06571","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/scalable-online-exploration-via-coverability#ran","syntology_url":"https://syntology.ai/paper/2403.06571","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.06571"}},"official":{"repos":["philip-amortila/l1-coverability"],"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/towards-general-computer-control-a-multimodal","slug":"towards-general-computer-control-a-multimodal","title":"Cradle: Empowering Foundation Agents Towards General Computer Control","date":"2024-03-05","arxiv_id":"2403.03186","repositories_listed":1,"syntology":null},{"url":"/paper/gennbv-generalizable-next-best-view-policy","slug":"gennbv-generalizable-next-best-view-policy","title":"GenNBV: Generalizable Next-Best-View Policy for Active 3D Reconstruction","date":"2024-02-25","arxiv_id":"2402.16174","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-low-rank-matrix-estimation","slug":"efficient-low-rank-matrix-estimation","title":"Efficient Low-Rank Matrix Estimation, Experimental Design, and Arm-Set-Dependent Low-Rank Bandits","date":"2024-02-17","arxiv_id":"2402.11156","repositories_listed":1,"syntology":{"n":16,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":9,"n_honours":2,"n_violates":1,"n_no_contract":3,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 1 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/efficient-low-rank-matrix-estimation#ran","syntology_url":"https://syntology.ai/paper/2402.11156","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.11156"}},"official":{"repos":["jajajang/lowpopart"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/noise-adaptive-confidence-sets-for-linear","slug":"noise-adaptive-confidence-sets-for-linear","title":"Noise-Adaptive Confidence Sets for Linear Bandits and Application to Bayesian Optimization","date":"2024-02-12","arxiv_id":"2402.07341","repositories_listed":1,"syntology":{"n":15,"n_ran":15,"n_constructed":0,"n_ran_checked":10,"n_instrument":5,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 3 honoured, 0 violated, 7 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/noise-adaptive-confidence-sets-for-linear#ran","syntology_url":"https://syntology.ai/paper/2402.07341","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.07341"}},"official":{"repos":["jungtaekkim/losan-lofav"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/diffusion-es-gradient-free-planning-with","slug":"diffusion-es-gradient-free-planning-with","title":"Diffusion-ES: Gradient-free Planning with Diffusion for Autonomous Driving and Zero-Shot Instruction Following","date":"2024-02-09","arxiv_id":"2402.06559","repositories_listed":1,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":6,"n_instrument":4,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":12,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/diffusion-es-gradient-free-planning-with#ran","syntology_url":"https://syntology.ai/paper/2402.06559","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.06559"}},"official":{"repos":["bhyang/diffusion-es"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/iterated-denoising-energy-matching-for","slug":"iterated-denoising-energy-matching-for","title":"Iterated Denoising Energy Matching for Sampling from Boltzmann Densities","date":"2024-02-09","arxiv_id":"2402.06121","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":3,"n_ran_checked":3,"n_instrument":5,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"8 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 5 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/iterated-denoising-energy-matching-for#ran","syntology_url":"https://syntology.ai/paper/2402.06121","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.06121"}},"official":{"repos":["jarridrb/dem"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/safe-guaranteed-exploration-for-non-linear","slug":"safe-guaranteed-exploration-for-non-linear","title":"Safe Guaranteed Exploration for Non-linear Systems","date":"2024-02-09","arxiv_id":"2402.06562","repositories_listed":1,"syntology":null},{"url":"/paper/a-sober-look-at-llms-for-material-discovery","slug":"a-sober-look-at-llms-for-material-discovery","title":"A Sober Look at LLMs for Material Discovery: Are They Actually Good for Bayesian Optimization Over Molecules?","date":"2024-02-07","arxiv_id":"2402.05015","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"7 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-sober-look-at-llms-for-material-discovery#ran","syntology_url":"https://syntology.ai/paper/2402.05015","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.05015"}},"official":{"repos":["wiseodd/lapeft-bayesopt"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/ltu-ili-an-all-in-one-framework-for-implicit","slug":"ltu-ili-an-all-in-one-framework-for-implicit","title":"LtU-ILI: An All-in-One Framework for Implicit Inference in Astrophysics and Cosmology","date":"2024-02-06","arxiv_id":"2402.05137","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/ltu-ili-an-all-in-one-framework-for-implicit#ran","syntology_url":"https://syntology.ai/paper/2402.05137","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.05137"}},"official":{"repos":["maho3/ltu-ili"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/layered-and-staged-monte-carlo-tree-search","slug":"layered-and-staged-monte-carlo-tree-search","title":"Layered and Staged Monte Carlo Tree Search for SMT Strategy Synthesis","date":"2024-01-30","arxiv_id":"2401.17159","repositories_listed":1,"syntology":null},{"url":"/paper/transnas-tsad-harnessing-transformers-for","slug":"transnas-tsad-harnessing-transformers-for","title":"TransNAS-TSAD: Harnessing Transformers for Multi-Objective Neural Architecture Search in Time Series Anomaly Detection","date":"2023-11-29","arxiv_id":"2311.18061","repositories_listed":1,"syntology":null},{"url":"/paper/consensus-based-construction-of-high","slug":"consensus-based-construction-of-high","title":"Consensus-based adaptive sampling and approximation for high-dimensional energy landscapes","date":"2023-11-08","arxiv_id":"2311.05009","repositories_listed":1,"syntology":null},{"url":"/paper/pgdqn-preference-guided-deep-q-network","slug":"pgdqn-preference-guided-deep-q-network","title":"PGDQN: Preference-Guided Deep Q-Network","date":"2023-10-03","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/feature-cognition-enhancement-via-interaction","slug":"feature-cognition-enhancement-via-interaction","title":"Feature Interaction Aware Automated Data Representation Transformation","date":"2023-09-29","arxiv_id":"2309.17011","repositories_listed":1,"syntology":null},{"url":"/paper/curiosity-as-a-self-supervised-method-to","slug":"curiosity-as-a-self-supervised-method-to","title":"Curiosity as a Self-Supervised Method to Improve Exploration in De novo Drug Design","date":"2023-09-24","arxiv_id":"2401.06771","repositories_listed":1,"syntology":null},{"url":"/paper/go-beyond-imagination-maximizing-episodic","slug":"go-beyond-imagination-maximizing-episodic","title":"Go Beyond Imagination: Maximizing Episodic Reachability with World Models","date":"2023-08-25","arxiv_id":"2308.13661","repositories_listed":1,"syntology":null},{"url":"/paper/optimizing-protein-fitness-using-gibbs","slug":"optimizing-protein-fitness-using-gibbs","title":"Improving Protein Optimization with Smoothed Fitness Landscapes","date":"2023-07-02","arxiv_id":"2307.00494","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"3 ran (of which 3 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) · 1 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/optimizing-protein-fitness-using-gibbs#ran","syntology_url":"https://syntology.ai/paper/2307.00494","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.00494"}},"official":{"repos":["kirjner/ggs"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/tuning-legged-locomotion-controllers-via-safe","slug":"tuning-legged-locomotion-controllers-via-safe","title":"Tuning Legged Locomotion Controllers via Safe Bayesian Optimization","date":"2023-06-12","arxiv_id":"2306.07092","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":1,"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/tuning-legged-locomotion-controllers-via-safe#ran","syntology_url":"https://syntology.ai/paper/2306.07092","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.07092"}},"official":{"repos":["lasgroup/gosafeopt"],"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/symmetric-exploration-in-combinatorial","slug":"symmetric-exploration-in-combinatorial","title":"Symmetric Replay Training: Enhancing Sample Efficiency in Deep Reinforcement Learning for Combinatorial Optimization","date":"2023-06-02","arxiv_id":"2306.01276","repositories_listed":1,"syntology":null},{"url":"/paper/large-batch-neural-multi-objective-bayesian","slug":"large-batch-neural-multi-objective-bayesian","title":"Large-Batch, Iteration-Efficient Neural Bayesian Design Optimization","date":"2023-06-01","arxiv_id":"2306.01095","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-of-label-efficient-deep-learning-for","slug":"a-survey-of-label-efficient-deep-learning-for","title":"A Survey of Label-Efficient Deep Learning for 3D Point Clouds","date":"2023-05-31","arxiv_id":"2305.19812","repositories_listed":1,"syntology":null},{"url":"/paper/expode-exploiting-policy-discrepancy-for","slug":"expode-exploiting-policy-discrepancy-for","title":"EXPODE: EXploiting POlicy Discrepancy for Efficient Exploration in Multi-agent Reinforcement Learning","date":"2023-05-30","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/provable-and-practical-efficient-exploration","slug":"provable-and-practical-efficient-exploration","title":"Provable and Practical: Efficient Exploration in Reinforcement Learning via Langevin Monte Carlo","date":"2023-05-29","arxiv_id":"2305.18246","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"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) · 0 unverified","sample_list":"/paper/provable-and-practical-efficient-exploration#ran","syntology_url":"https://syntology.ai/paper/2305.18246","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.18246"}},"official":{"repos":["hmishfaq/lmc-lsvi"],"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"]}}},{"url":"/paper/conditionally-optimistic-exploration-for","slug":"conditionally-optimistic-exploration-for","title":"Conditionally Optimistic Exploration for Cooperative Deep Multi-Agent Reinforcement Learning","date":"2023-03-16","arxiv_id":"2303.09032","repositories_listed":1,"syntology":null},{"url":"/paper/strangeness-driven-exploration-in-multi-agent","slug":"strangeness-driven-exploration-in-multi-agent","title":"Strangeness-driven Exploration in Multi-Agent Reinforcement Learning","date":"2022-12-27","arxiv_id":"2212.13448","repositories_listed":1,"syntology":null},{"url":"/paper/generative-colorization-of-structured-mobile","slug":"generative-colorization-of-structured-mobile","title":"Generative Colorization of Structured Mobile Web Pages","date":"2022-12-22","arxiv_id":"2212.11541","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-through-random-curiosity-with","slug":"exploring-through-random-curiosity-with","title":"Exploring through Random Curiosity with General Value Functions","date":"2022-11-18","arxiv_id":"2211.10282","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/exploring-through-random-curiosity-with#ran","syntology_url":"https://syntology.ai/paper/2211.10282","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.10282"}},"official":{"repos":["aditya-ramesh-10/exploring-through-rcgvf"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/geothermalcloud-machine-learning-for","slug":"geothermalcloud-machine-learning-for","title":"GeoThermalCloud: Machine Learning for Geothermal Resource Exploration","date":"2022-10-17","arxiv_id":"2210.08685","repositories_listed":1,"syntology":null}],"syntology_records":33,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":57,"papers_where_code_ran_first_page":"/task/efficient-exploration/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":6,"url":"/task/efficient-exploration/papers/2","json":"/task/efficient-exploration/papers/2.json","rows":100},{"order":"archive","page":3,"of":6,"url":"/task/efficient-exploration/papers/3","json":"/task/efficient-exploration/papers/3.json","rows":100},{"order":"archive","page":4,"of":6,"url":"/task/efficient-exploration/papers/4","json":"/task/efficient-exploration/papers/4.json","rows":100},{"order":"archive","page":5,"of":6,"url":"/task/efficient-exploration/papers/5","json":"/task/efficient-exploration/papers/5.json","rows":100},{"order":"archive","page":6,"of":6,"url":"/task/efficient-exploration/papers/6","json":"/task/efficient-exploration/papers/6.json","rows":14},{"order":"ran","page":1,"of":1,"url":"/task/efficient-exploration/papers/ran/1","json":"/task/efficient-exploration/papers/ran/1.json","rows":57}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"d3abfdb17786aff80c4a7c0d69f2868b0018c6614756a42e925ea783c4d766c4","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}