{"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/acrobot","name":"Acrobot","slug":"acrobot","description_markdown":"The acrobot system includes two joints and two links, where the joint between the two links is actuated. Initially, the links are hanging downwards, and the goal is to swing the end of the lower link up to a given height.","categories":[{"name":"Playing Games","url":"/area/playing-games"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":28,"papers_with_code":10,"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":1,"subtasks":0,"parent_tasks":1},"benchmarks":[],"datasets":[{"url":"/dataset/omniverse-isaac-gym","name":"Omniverse Isaac Gym","full_name":"","num_papers_in_archive":240}],"subtasks":[],"parent_tasks":[{"url":"/task/openai-gym","name":"OpenAI Gym"}],"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":28,"of":28,"of_with_code":10,"tagged_in_all":28,"counts":{"archive_papers_tagged":28,"with_a_code_link":10,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":28,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":0,"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/criticality-as-it-could-be-organizational","slug":"criticality-as-it-could-be-organizational","title":"Criticality as It Could Be: organizational invariance as self-organized criticality in embodied agents","date":"2017-04-18","arxiv_id":"1704.05255","repositories_listed":6,"syntology":null},{"url":"/paper/robotdiffuse-motion-planning-for-redundant","slug":"robotdiffuse-motion-planning-for-redundant","title":"RobotDiffuse: Motion Planning for Redundant Manipulator based on Diffusion Model","date":"2024-12-27","arxiv_id":"2412.19500","repositories_listed":1,"syntology":null},{"url":"/paper/signal-novelty-detection-as-an-intrinsic","slug":"signal-novelty-detection-as-an-intrinsic","title":"Signal Novelty Detection as an Intrinsic Reward for Robotics","date":"2023-04-14","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/total-energy-shaping-control-for-mechanical","slug":"total-energy-shaping-control-for-mechanical","title":"Total energy-shaping control for mechanical systems via Control-by-Interconnection","date":"2023-01-10","arxiv_id":"2301.03746","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-online-value-function-approximation","slug":"adaptive-online-value-function-approximation","title":"Adaptive Online Value Function Approximation with Wavelets","date":"2022-04-22","arxiv_id":"2204.11842","repositories_listed":1,"syntology":null},{"url":"/paper/transfer-reinforcement-learning-for-differing","slug":"transfer-reinforcement-learning-for-differing","title":"Transfer Reinforcement Learning for Differing Action Spaces via Q-Network Representations","date":"2022-02-05","arxiv_id":"2202.02442","repositories_listed":1,"syntology":null},{"url":"/paper/model-based-micro-data-reinforcement-learning-1","slug":"model-based-micro-data-reinforcement-learning-1","title":"Model-based micro-data reinforcement learning: what are the crucial model properties and which model to choose?","date":"2021-07-24","arxiv_id":"2107.11587","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/model-based-micro-data-reinforcement-learning-1#ran","syntology_url":"https://syntology.ai/paper/2107.11587","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.11587"}},"official":{"repos":["ramp-kits/rl_simulator"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/learning-synthetic-environments-for","slug":"learning-synthetic-environments-for","title":"Learning Synthetic Environments for Reinforcement Learning with Evolution Strategies","date":"2021-01-24","arxiv_id":"2101.09721","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-curiosity-algorithms-1","slug":"meta-learning-curiosity-algorithms-1","title":"Meta-learning curiosity algorithms","date":"2020-03-11","arxiv_id":"2003.05325","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/meta-learning-curiosity-algorithms-1#ran","syntology_url":"https://syntology.ai/paper/2003.05325","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.05325"}},"official":{"repos":["mfranzs/meta-learning-curiosity-algorithms"],"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/adaptation-to-criticality-through","slug":"adaptation-to-criticality-through","title":"Adaptation to criticality through organizational invariance in embodied agents","date":"2017-12-13","arxiv_id":"1712.05284","repositories_listed":1,"syntology":null},{"url":null,"slug":"basil-best-action-symbolic-interpretable","title":"BASIL: Best-Action Symbolic Interpretable Learning for Evolving Compact RL Policies","date":"2025-05-31","arxiv_id":"2506.00328","repositories_listed":0,"syntology":null},{"url":null,"slug":"bellman-operator-convergence-enhancements-in","title":"Bellman operator convergence enhancements in reinforcement learning algorithms","date":"2025-05-20","arxiv_id":"2505.14564","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-global-control-of-underactuated","title":"Learning global control of underactuated systems with Model-Based Reinforcement Learning","date":"2025-04-09","arxiv_id":"2504.06721","repositories_listed":0,"syntology":null},{"url":null,"slug":"real-time-model-predictive-control-for-the","title":"Real-Time Model Predictive Control for the Swing-Up Problem of an Underactuated Double Pendulum","date":"2025-04-07","arxiv_id":"2504.05363","repositories_listed":0,"syntology":null},{"url":null,"slug":"average-reward-maximum-entropy-reinforcement","title":"Average-Reward Maximum Entropy Reinforcement Learning for Underactuated Double Pendulum Tasks","date":"2024-09-13","arxiv_id":"2409.08938","repositories_listed":0,"syntology":null},{"url":null,"slug":"linear-function-approximation-as-a","title":"Linear Function Approximation as a Computationally Efficient Method to Solve Classical Reinforcement Learning Challenges","date":"2024-05-27","arxiv_id":"2405.20350","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-the-swing-up-and-balance-task-for-the","title":"Solving the swing-up and balance task for the Acrobot and Pendubot with SAC","date":"2023-12-18","arxiv_id":"2312.11311","repositories_listed":0,"syntology":null},{"url":null,"slug":"hypersnn-a-new-efficient-and-robust-deep","title":"HyperSNN: A new efficient and robust deep learning model for resource constrained control applications","date":"2023-08-16","arxiv_id":"2308.08222","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-neuromorphic-architecture-for-reinforcement","title":"A Neuromorphic Architecture for Reinforcement Learning from Real-Valued Observations","date":"2023-07-06","arxiv_id":"2307.02947","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-environment-models-with-continuous","title":"Learning Environment Models with Continuous Stochastic Dynamics","date":"2023-06-29","arxiv_id":"2306.17204","repositories_listed":0,"syntology":null},{"url":null,"slug":"keycld-learning-constrained-lagrangian","title":"KeyCLD: Learning Constrained Lagrangian Dynamics in Keypoint Coordinates from Images","date":"2022-06-22","arxiv_id":"2206.11030","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-attentive-kernel-based-temporal","title":"Online Attentive Kernel-Based Temporal Difference Learning","date":"2022-01-22","arxiv_id":"2201.09065","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-guide-and-the-explorer-smart-agents-for","title":"The guide and the explorer: smart agents for resource-limited iterated batch reinforcement learning","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"experimental-study-on-reinforcement-learning","title":"Experimental Study on Reinforcement Learning-based Control of an Acrobot","date":"2020-11-18","arxiv_id":"2011.09246","repositories_listed":0,"syntology":null},{"url":null,"slug":"lagnetvip-a-lagrangian-neural-network-for","title":"LagNetViP: A Lagrangian Neural Network for Video Prediction","date":"2020-10-24","arxiv_id":"2010.12932","repositories_listed":0,"syntology":null},{"url":null,"slug":"robot-design-with-neural-networks-milp","title":"Robot Design With Neural Networks, MILP Solvers and Active Learning","date":"2020-10-19","arxiv_id":"2010.09842","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-sparse-representations-in-1","title":"Learning sparse representations in reinforcement learning","date":"2019-09-04","arxiv_id":"1909.01575","repositories_listed":0,"syntology":null},{"url":null,"slug":"deterministic-policy-optimization-by","title":"Deterministic Policy Optimization by Combining Pathwise and Score Function Estimators for Discrete Action Spaces","date":"2017-11-21","arxiv_id":"1711.08068","repositories_listed":0,"syntology":null}],"syntology_records":2,"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":1,"papers_where_code_ran_first_page":"/task/acrobot/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/acrobot/papers/ran/1","json":"/task/acrobot/papers/ran/1.json","rows":1}],"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":"c12cac739a6264edccc451bd32d5618044900eea17c95d1d9bb5fdf2dbdcad32","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}