{"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/multi-goal-reinforcement-learning","name":"Multi-Goal Reinforcement Learning","slug":"multi-goal-reinforcement-learning","description_markdown":null,"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":34,"papers_with_code":20,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"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":2,"subtasks":0,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/multi-goal-reinforcement-learning-on-no-extra","slug":"multi-goal-reinforcement-learning-on-no-extra","dataset":"no extra data","dataset_url":null,"rows_in_archive":1,"metrics":["Average Reward"],"first_row_in_archive_order":{"model":"FDQN","paper_title":"FDQN: A Flexible Deep Q-Network Framework for Game Automation","paper_url":"/paper/fdqn-a-flexible-deep-q-network-framework-for","paper_date":"2024-05-29","arxiv_id":"2405.18761","code_links":[{"title":"prabhath-r/FDQN_RL","url":"https://github.com/prabhath-r/FDQN_RL"}],"syntology":null}}],"datasets":[{"url":"/dataset/unimib-shar","name":"UniMiB SHAR","full_name":"","num_papers_in_archive":4},{"url":"/dataset/bipedal-skills","name":"bipedal-skills","full_name":"Bipedal Skills Benchmark for Reinforcement Learning","num_papers_in_archive":2}],"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":1,"rows_per_page":100,"shown":34,"of":34,"of_with_code":20,"tagged_in_all":34,"counts":{"archive_papers_tagged":34,"with_a_code_link":20,"where_syntology_ran_a_sample":9,"not_listed_spam_title":0,"listed":34,"listed_where_code_ran":9,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":8,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":8,"listed_every_run_a_failure_of_syntologys_instrument":1,"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/proximal-policy-optimization-algorithms","slug":"proximal-policy-optimization-algorithms","title":"Proximal Policy Optimization Algorithms","date":"2017-07-20","arxiv_id":"1707.06347","repositories_listed":188,"syntology":{"n":176,"n_ran":99,"n_constructed":53,"n_ran_checked":71,"n_instrument":28,"n_unverified":77,"n_honours":7,"n_violates":2,"n_no_contract":62,"n_pointer_only":94,"phrase":"99 ran (of which 53 constructed an object rather than computing a result; 71 with no instrument failure: 7 honoured, 2 violated, 62 with no contract checked; 28 where Syntology's instrument failed) · 77 unverified","sample_list":"/paper/proximal-policy-optimization-algorithms#ran","syntology_url":"https://syntology.ai/paper/1707.06347","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1707.06347"}},"official":null}},{"url":"/paper/playing-atari-with-deep-reinforcement","slug":"playing-atari-with-deep-reinforcement","title":"Playing Atari with Deep Reinforcement Learning","date":"2013-12-19","arxiv_id":"1312.5602","repositories_listed":112,"syntology":{"n":117,"n_ran":64,"n_constructed":24,"n_ran_checked":46,"n_instrument":18,"n_unverified":53,"n_honours":5,"n_violates":0,"n_no_contract":41,"n_pointer_only":56,"phrase":"64 ran (of which 24 constructed an object rather than computing a result; 46 with no instrument failure: 5 honoured, 0 violated, 41 with no contract checked; 18 where Syntology's instrument failed) · 53 unverified","sample_list":"/paper/playing-atari-with-deep-reinforcement#ran","syntology_url":"https://syntology.ai/paper/1312.5602","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1312.5602"}},"official":null}},{"url":"/paper/multi-goal-reinforcement-learning-challenging","slug":"multi-goal-reinforcement-learning-challenging","title":"Multi-Goal Reinforcement Learning: Challenging Robotics Environments and Request for Research","date":"2018-02-26","arxiv_id":"1802.09464","repositories_listed":28,"syntology":null},{"url":"/paper/maximum-entropy-regularized-multi-goal","slug":"maximum-entropy-regularized-multi-goal","title":"Maximum Entropy-Regularized Multi-Goal Reinforcement Learning","date":"2019-05-21","arxiv_id":"1905.08786","repositories_listed":3,"syntology":null},{"url":"/paper/intrinsically-motivated-goal-exploration","slug":"intrinsically-motivated-goal-exploration","title":"Intrinsically Motivated Goal Exploration Processes with Automatic Curriculum Learning","date":"2017-08-07","arxiv_id":"1708.02190","repositories_listed":3,"syntology":null},{"url":"/paper/grounding-hindsight-instructions-in-multi","slug":"grounding-hindsight-instructions-in-multi","title":"Grounding Hindsight Instructions in Multi-Goal Reinforcement Learning for Robotics","date":"2022-04-08","arxiv_id":"2204.04308","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/grounding-hindsight-instructions-in-multi#ran","syntology_url":"https://syntology.ai/paper/2204.04308","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.04308"}},"official":{"repos":["knowledgetechnologyuhh/hipss"],"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/an-open-source-multi-goal-reinforcement","slug":"an-open-source-multi-goal-reinforcement","title":"An Open-Source Multi-Goal Reinforcement Learning Environment for Robotic Manipulation with Pybullet","date":"2021-05-12","arxiv_id":"2105.05985","repositories_listed":2,"syntology":null},{"url":"/paper/maximum-entropy-gain-exploration-for-long","slug":"maximum-entropy-gain-exploration-for-long","title":"Maximum Entropy Gain Exploration for Long Horizon Multi-goal Reinforcement Learning","date":"2020-07-06","arxiv_id":"2007.02832","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"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 1 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/maximum-entropy-gain-exploration-for-long#ran","syntology_url":"https://syntology.ai/paper/2007.02832","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.02832"}},"official":{"repos":["spitis/mrl"],"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/an-inductive-bias-for-distances-neural-nets-1","slug":"an-inductive-bias-for-distances-neural-nets-1","title":"An Inductive Bias for Distances: Neural Nets that Respect the Triangle Inequality","date":"2020-02-14","arxiv_id":"2002.05825","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":3,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":5,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/an-inductive-bias-for-distances-neural-nets-1#ran","syntology_url":"https://syntology.ai/paper/2002.05825","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.05825"}},"official":{"repos":["spitis/deepnorms"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-reach-goals-without-reinforcement-1","slug":"learning-to-reach-goals-without-reinforcement-1","title":"Learning to Reach Goals via Iterated Supervised Learning","date":"2019-12-12","arxiv_id":"1912.06088","repositories_listed":2,"syntology":null},{"url":"/paper/fdqn-a-flexible-deep-q-network-framework-for","slug":"fdqn-a-flexible-deep-q-network-framework-for","title":"FDQN: A Flexible Deep Q-Network Framework for Game Automation","date":"2024-05-29","arxiv_id":"2405.18761","repositories_listed":1,"syntology":null},{"url":"/paper/romo-her-robust-model-based-hindsight","slug":"romo-her-robust-model-based-hindsight","title":"MRHER: Model-based Relay Hindsight Experience Replay for Sequential Object Manipulation Tasks with Sparse Rewards","date":"2023-06-28","arxiv_id":"2306.16061","repositories_listed":1,"syntology":null},{"url":"/paper/bilinear-value-networks","slug":"bilinear-value-networks","title":"Bilinear value networks","date":"2022-04-28","arxiv_id":"2204.13695","repositories_listed":1,"syntology":null},{"url":"/paper/multi-goal-reinforcement-learning","slug":"multi-goal-reinforcement-learning","title":"Multi-Goal Reinforcement Learning environments for simulated Franka Emika Panda robot","date":"2021-06-25","arxiv_id":"2106.13687","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/multi-goal-reinforcement-learning#ran","syntology_url":"https://syntology.ai/paper/2106.13687","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.13687"}},"official":{"repos":["qgallouedec/panda-gym"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarial-intrinsic-motivation-for","slug":"adversarial-intrinsic-motivation-for","title":"Adversarial Intrinsic Motivation for Reinforcement Learning","date":"2021-05-27","arxiv_id":"2105.13345","repositories_listed":1,"syntology":{"n":14,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/adversarial-intrinsic-motivation-for#ran","syntology_url":"https://syntology.ai/paper/2105.13345","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.13345"}},"official":{"repos":["iDurugkar/adversarial-intrinsic-motivation"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/roll-visual-self-supervised-reinforcement","slug":"roll-visual-self-supervised-reinforcement","title":"ROLL: Visual Self-Supervised Reinforcement Learning with Object Reasoning","date":"2020-11-13","arxiv_id":"2011.06777","repositories_listed":1,"syntology":null},{"url":"/paper/counterfactual-data-augmentation-using","slug":"counterfactual-data-augmentation-using","title":"Counterfactual Data Augmentation using Locally Factored Dynamics","date":"2020-07-06","arxiv_id":"2007.02863","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":0,"n_instrument":6,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"6 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; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/counterfactual-data-augmentation-using#ran","syntology_url":"https://syntology.ai/paper/2007.02863","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.02863"}},"official":null}},{"url":"/paper/learning-discrete-state-abstractions-with","slug":"learning-discrete-state-abstractions-with","title":"Learning Discrete State Abstractions With Deep Variational Inference","date":"2020-03-09","arxiv_id":"2003.04300","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 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; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/learning-discrete-state-abstractions-with#ran","syntology_url":"https://syntology.ai/paper/2003.04300","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.04300"}},"official":{"repos":["ondrejba/discrete_abstractions"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/bias-reduced-hindsight-experience-replay-with","slug":"bias-reduced-hindsight-experience-replay-with","title":"Bias-Reduced Hindsight Experience Replay with Virtual Goal Prioritization","date":"2019-05-14","arxiv_id":"1905.05498","repositories_listed":1,"syntology":null},{"url":"/paper/curious-intrinsically-motivated-multi-task","slug":"curious-intrinsically-motivated-multi-task","title":"CURIOUS: Intrinsically Motivated Modular Multi-Goal Reinforcement Learning","date":"2018-10-15","arxiv_id":"1810.06284","repositories_listed":1,"syntology":null},{"url":null,"slug":"next-future-sample-efficient-policy-learning","title":"Next-Future: Sample-Efficient Policy Learning for Robotic-Arm Tasks","date":"2025-04-15","arxiv_id":"2504.11247","repositories_listed":0,"syntology":null},{"url":null,"slug":"proposing-hierarchical-goal-conditioned","title":"Proposing Hierarchical Goal-Conditioned Policy Planning in Multi-Goal Reinforcement Learning","date":"2025-01-03","arxiv_id":"2501.01727","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-multi-goal-robotic-tasks-with","title":"Solving Multi-Goal Robotic Tasks with Decision Transformer","date":"2024-10-08","arxiv_id":"2410.06347","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-hindsight-goal-relabeling","title":"Understanding Hindsight Goal Relabeling from a Divergence Minimization Perspective","date":"2022-09-26","arxiv_id":"2209.13046","repositories_listed":0,"syntology":null},{"url":null,"slug":"cluster-based-sampling-in-hindsight","title":"Cluster-based Sampling in Hindsight Experience Replay for Robotic Tasks (Student Abstract)","date":"2022-08-31","arxiv_id":"2208.14741","repositories_listed":0,"syntology":null},{"url":null,"slug":"stein-variational-goal-generation-for","title":"Stein Variational Goal Generation for adaptive Exploration in Multi-Goal Reinforcement Learning","date":"2022-06-14","arxiv_id":"2206.06719","repositories_listed":0,"syntology":null},{"url":null,"slug":"bi-linear-value-networks-for-multi-goal","title":"Bi-linear Value Networks for Multi-goal Reinforcement Learning","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"mher-model-based-hindsight-experience-replay","title":"MHER: Model-based Hindsight Experience Replay","date":"2021-07-01","arxiv_id":"2107.00306","repositories_listed":0,"syntology":null},{"url":null,"slug":"unbiased-methods-for-multi-goal-reinforcement","title":"Unbiased Methods for Multi-Goal Reinforcement Learning","date":"2021-06-16","arxiv_id":"2106.08863","repositories_listed":0,"syntology":null},{"url":null,"slug":"bias-reduced-multi-step-hindsight-experience","title":"Bias-reduced Multi-step Hindsight Experience Replay for Efficient Multi-goal Reinforcement Learning","date":"2021-02-25","arxiv_id":"2102.12962","repositories_listed":0,"syntology":null},{"url":null,"slug":"mdldroid-a-chainsgd-reduce-approach-to-mobile","title":"MDLdroid: a ChainSGD-reduce Approach to Mobile Deep Learning for Personal Mobile Sensing","date":"2020-02-07","arxiv_id":"2002.02897","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-reinforcement-learning-for-complex-1","title":"Deep Reinforcement Learning for Complex Manipulation Tasks with Sparse Feedback","date":"2020-01-12","arxiv_id":"2001.03877","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-goal-conditioned-value-functions","title":"Learning Goal-Conditioned Value Functions with one-step Path rewards rather than Goal-Rewards","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"actrce-augmenting-experience-via-teachers","title":"ACTRCE: Augmenting Experience via Teacher's Advice For Multi-Goal Reinforcement Learning","date":"2019-02-12","arxiv_id":"1902.04546","repositories_listed":0,"syntology":null}],"syntology_records":9,"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":9,"papers_where_code_ran_first_page":"/task/multi-goal-reinforcement-learning/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":"ran","page":1,"of":1,"url":"/task/multi-goal-reinforcement-learning/papers/ran/1","json":"/task/multi-goal-reinforcement-learning/papers/ran/1.json","rows":9}],"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":"f881f7a200b45762fe94a68d285f320c479fcd27979b8bc33ab1a42f349a5c2b","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}