{"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":"/code/td-target","entry":"td_target","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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)"},"n_papers":11,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":11,"n_papers_ran_instrument_only":0,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":3,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":11,"n_places_pointer_only":2,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":0},"key_notes":{"n_samples_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_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2402.06819","arxiv_id_is_arxiv":true,"paper":"/paper/monitored-markov-decision-processes","title":"Monitored Markov Decision Processes","date":"2024-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amiithinks/mon_mdp_aamas24","path":"src/critic.py","file_url":"https://github.com/amiithinks/mon_mdp_aamas24/blob/HEAD/src/critic.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ff95638173fd5d86","code_sha256_prefix":"ff95638173fd5d86","mcp_get_code":{"code_sha256":"ff95638173fd5d86"}},{"arxiv_id":"2309.08571","arxiv_id_is_arxiv":true,"paper":"/paper/a-bayesian-approach-to-robust-inverse","title":"A Bayesian Approach to Robust Inverse Reinforcement Learning","date":"2023-09-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ran-weii/bmirl_tf","path":"rambo/algorithms/birl.py","file_url":"https://github.com/ran-weii/bmirl_tf/blob/HEAD/rambo/algorithms/birl.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6785bf48d01be235","code_sha256_prefix":"6785bf48d01be235","mcp_get_code":{"code_sha256":"6785bf48d01be235"}},{"arxiv_id":"2212.00124","arxiv_id_is_arxiv":true,"paper":"/paper/one-risk-to-rule-them-all-a-risk-sensitive-1","title":"One Risk to Rule Them All: A Risk-Sensitive Perspective on Model-Based Offline Reinforcement Learning","date":"2022-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marc-rigter/1R2R","path":"_1R2R/algorithms/_1R2R.py","file_url":"https://github.com/marc-rigter/1R2R/blob/HEAD/_1R2R/algorithms/_1R2R.py","status":"ran_honours","verification_level":2,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"31deb9c7be58e00c","code_sha256_prefix":"31deb9c7be58e00c","mcp_get_code":{"code_sha256":"31deb9c7be58e00c"}},{"arxiv_id":"2204.12581","arxiv_id_is_arxiv":true,"paper":"/paper/rambo-rl-robust-adversarial-model-based","title":"RAMBO-RL: Robust Adversarial Model-Based Offline Reinforcement Learning","date":"2022-04-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marc-rigter/rambo","path":"rambo/algorithms/rambo.py","file_url":"https://github.com/marc-rigter/rambo/blob/HEAD/rambo/algorithms/rambo.py","status":"ran_honours","verification_level":2,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"31deb9c7be58e00c","code_sha256_prefix":"31deb9c7be58e00c","mcp_get_code":{"code_sha256":"31deb9c7be58e00c"}},{"arxiv_id":"2103.13842","arxiv_id_is_arxiv":true,"paper":"/paper/model-predictive-actor-critic-accelerating","title":"Model Predictive Actor-Critic: Accelerating Robot Skill Acquisition with Deep Reinforcement Learning","date":"2021-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dnandha/mopac","path":"mopac/algorithms/mopac.py","file_url":"https://github.com/dnandha/mopac/blob/HEAD/mopac/algorithms/mopac.py","status":"ran_honours","verification_level":2,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"31deb9c7be58e00c","code_sha256_prefix":"31deb9c7be58e00c","mcp_get_code":{"code_sha256":"31deb9c7be58e00c"}},{"arxiv_id":"2010.09546","arxiv_id_is_arxiv":true,"paper":"/paper/model-based-policy-optimization-with","title":"Model-based Policy Optimization with Unsupervised Model Adaptation","date":"2020-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RockySJ/ampo","path":"ampo.py","file_url":"https://github.com/RockySJ/ampo/blob/HEAD/ampo.py","status":"ran_honours","verification_level":2,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"31deb9c7be58e00c","code_sha256_prefix":"31deb9c7be58e00c","mcp_get_code":{"code_sha256":"31deb9c7be58e00c"}},{"arxiv_id":"2007.01995","arxiv_id_is_arxiv":true,"paper":"/paper/bidirectional-model-based-policy-optimization","title":"Bidirectional Model-based Policy Optimization","date":"2020-07-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hanglai/bmpo","path":"bmpo.py","file_url":"https://github.com/hanglai/bmpo/blob/HEAD/bmpo.py","status":"ran_honours","verification_level":2,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"31deb9c7be58e00c","code_sha256_prefix":"31deb9c7be58e00c","mcp_get_code":{"code_sha256":"31deb9c7be58e00c"}},{"arxiv_id":"2006.13916","arxiv_id_is_arxiv":true,"paper":"/paper/off-dynamics-reinforcement-learning-training","title":"Off-Dynamics Reinforcement Learning: Training for Transfer with Domain Classifiers","date":"2020-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JannerM/mbpo","path":"mbpo/algorithms/mbpo.py","file_url":"https://github.com/JannerM/mbpo/blob/HEAD/mbpo/algorithms/mbpo.py","status":"ran_honours","verification_level":2,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"31deb9c7be58e00c","code_sha256_prefix":"31deb9c7be58e00c","mcp_get_code":{"code_sha256":"31deb9c7be58e00c"}},{"arxiv_id":"1906.08253","arxiv_id_is_arxiv":true,"paper":"/paper/when-to-trust-your-model-model-based-policy","title":"When to Trust Your Model: Model-Based Policy Optimization","date":"2019-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":2,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"31deb9c7be58e00c","code_sha256_prefix":"31deb9c7be58e00c","mcp_get_code":{"code_sha256":"31deb9c7be58e00c"}},{"arxiv_id":"1812.05905","arxiv_id_is_arxiv":true,"paper":"/paper/soft-actor-critic-algorithms-and-applications","title":"Soft Actor-Critic Algorithms and Applications","date":"2018-12-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":2,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"31deb9c7be58e00c","code_sha256_prefix":"31deb9c7be58e00c","mcp_get_code":{"code_sha256":"31deb9c7be58e00c"}},{"arxiv_id":"1703.03400","arxiv_id_is_arxiv":true,"paper":"/paper/model-agnostic-meta-learning-for-fast","title":"Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks","date":"2017-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iclavera/meta-mb","path":"meta_mb/algos/sac.py","file_url":"https://github.com/iclavera/meta-mb/blob/HEAD/meta_mb/algos/sac.py","status":"ran_honours","verification_level":2,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"31deb9c7be58e00c","code_sha256_prefix":"31deb9c7be58e00c","mcp_get_code":{"code_sha256":"31deb9c7be58e00c"}}],"record_sha256":"3fad3137e920e50991ac7c701bedf9966a986636be27451926374a5f905ea458","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}