{"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/select-action","entry":"select_action","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":22,"n_papers_ran":16,"n_papers_ran_no_instrument_failure":9,"n_papers_ran_instrument_only":7,"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":20,"n_samples_ran":13,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":5,"n_samples_unverified":7,"n_samples_fingerprinted":0,"n_places":24,"n_places_pointer_only":8,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":5,"ran":8,"unverified":7},"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":"2606.20832","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-20832","title":"ReLaTS: a Reinforcement Learning-based method for dynamically determining the coupling Time Step in multi-scale simulations of self-gravitating systems","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"veronicasaz/RL_bridgedCluster","path":"TrainRL.py","file_url":"https://github.com/veronicasaz/RL_bridgedCluster/blob/HEAD/TrainRL.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, veronicasaz/RL_bridgedCluster when it was checked","code_sha256":"0d01e6f28ed555ed","code_sha256_prefix":"0d01e6f28ed555ed","mcp_get_code":{"code_sha256":"0d01e6f28ed555ed"}},{"arxiv_id":"2503.00778","arxiv_id_is_arxiv":true,"paper":"/paper/affordgrasp-in-context-affordance-reasoning","title":"AffordGrasp: In-Context Affordance Reasoning for Open-Vocabulary Task-Oriented Grasping in Clutter","date":null,"month_inferred_from_arxiv_id":"2025-03","title_source":"archive","repo":"H-Freax/ThinkGrasp","path":"realarm.py","file_url":"https://github.com/H-Freax/ThinkGrasp/blob/HEAD/realarm.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":"ae08b081b5d182e6","code_sha256_prefix":"ae08b081b5d182e6","mcp_get_code":{"code_sha256":"ae08b081b5d182e6"}},{"arxiv_id":"2405.04342","arxiv_id_is_arxiv":true,"paper":"/paper/the-curse-of-diversity-in-ensemble-based","title":"The Curse of Diversity in Ensemble-Based Exploration","date":"2024-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhixuan-lin/ensemble-rl-discrete","path":"ensemble_rl/agents/boot_quantile_agent.py","file_url":"https://github.com/zhixuan-lin/ensemble-rl-discrete/blob/HEAD/ensemble_rl/agents/boot_quantile_agent.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5eff8223ef2a7296","code_sha256_prefix":"5eff8223ef2a7296","mcp_get_code":{"code_sha256":"5eff8223ef2a7296"}},{"arxiv_id":"2404.05440","arxiv_id_is_arxiv":true,"paper":"/paper/tree-search-based-policy-optimization-under","title":"Tree Search-Based Policy Optimization under Stochastic Execution Delay","date":"2024-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"davidva1/Delayed-EZ","path":"core/utils.py","file_url":"https://github.com/davidva1/Delayed-EZ/blob/HEAD/core/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, davidva1/Delayed-EZ, is not in the permissive set Syntology serves inline","code_sha256":"7cf8a53360f599af","code_sha256_prefix":"7cf8a53360f599af","mcp_get_code":{"code_sha256":"7cf8a53360f599af"}},{"arxiv_id":"2310.10833","arxiv_id_is_arxiv":true,"paper":"/paper/proper-laplacian-representation-learning","title":"Proper Laplacian Representation Learning","date":"2023-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"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":"2957ca0c26f2fc3f","code_sha256_prefix":"2957ca0c26f2fc3f","mcp_get_code":{"code_sha256":"2957ca0c26f2fc3f"}},{"arxiv_id":"2304.13571","arxiv_id_is_arxiv":true,"paper":"/paper/quantum-natural-policy-gradients-towards","title":"Quantum Natural Policy Gradients: Towards Sample-Efficient Reinforcement Learning","date":"2023-04-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nicomeyer96/quantum-natural-policy-gradients","path":"utils.py","file_url":"https://github.com/nicomeyer96/quantum-natural-policy-gradients/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"720b07b98b308694","code_sha256_prefix":"720b07b98b308694","mcp_get_code":{"code_sha256":"720b07b98b308694"}},{"arxiv_id":"2301.11181","arxiv_id_is_arxiv":true,"paper":"/paper/deep-laplacian-based-options-for-temporally","title":"Deep Laplacian-based Options for Temporally-Extended Exploration","date":"2023-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"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":"2957ca0c26f2fc3f","code_sha256_prefix":"2957ca0c26f2fc3f","mcp_get_code":{"code_sha256":"2957ca0c26f2fc3f"}},{"arxiv_id":"2212.02098","arxiv_id_is_arxiv":true,"paper":"/paper/a-machine-with-short-term-episodic-and","title":"A Machine with Short-Term, Episodic, and Semantic Memory Systems","date":"2022-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"humemai/agent-room-env-v1","path":"agent/dqn/utils.py","file_url":"https://github.com/humemai/agent-room-env-v1/blob/HEAD/agent/dqn/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"750debd5365bc34e","code_sha256_prefix":"750debd5365bc34e","mcp_get_code":{"code_sha256":"750debd5365bc34e"}},{"arxiv_id":"2212.02098","arxiv_id_is_arxiv":true,"paper":"/paper/a-machine-with-short-term-episodic-and","title":"A Machine with Short-Term, Episodic, and Semantic Memory Systems","date":"2022-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"humemai/agent-room-env-v1","path":"agent/ppo/utils.py","file_url":"https://github.com/humemai/agent-room-env-v1/blob/HEAD/agent/ppo/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8ee60ab856ea7100","code_sha256_prefix":"8ee60ab856ea7100","mcp_get_code":{"code_sha256":"8ee60ab856ea7100"}},{"arxiv_id":"2210.10763","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-feasibility-of-cross-task-transfer","title":"On the Feasibility of Cross-Task Transfer with Model-Based Reinforcement Learning","date":"2022-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mlpc-ucsd/xtra","path":"src/core/utils.py","file_url":"https://github.com/mlpc-ucsd/xtra/blob/HEAD/src/core/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f20a0c2687734ea6","code_sha256_prefix":"f20a0c2687734ea6","mcp_get_code":{"code_sha256":"f20a0c2687734ea6"}},{"arxiv_id":"2108.11939","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-and-accelerating-neural","title":"Understanding and Accelerating Neural Architecture Search with Training-Free and Theory-Grounded Metrics","date":"2021-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-group/tegnas","path":"reinforce.py","file_url":"https://github.com/vita-group/tegnas/blob/HEAD/reinforce.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":"d76fd75b329eb07e","code_sha256_prefix":"d76fd75b329eb07e","mcp_get_code":{"code_sha256":"d76fd75b329eb07e"}},{"arxiv_id":"2107.00860","arxiv_id_is_arxiv":true,"paper":"/paper/rapid-neural-architecture-search-by-learning-1","title":"Rapid Neural Architecture Search by Learning to Generate Graphs from Datasets","date":"2021-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"D-X-Y/AutoDL-Projects","path":"exps/NAS-Bench-201-algos/reinforce.py","file_url":"https://github.com/D-X-Y/AutoDL-Projects/blob/HEAD/exps/NAS-Bench-201-algos/reinforce.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":"0e6f925ca93551fa","code_sha256_prefix":"0e6f925ca93551fa","mcp_get_code":{"code_sha256":"0e6f925ca93551fa"}},{"arxiv_id":"2106.02193","arxiv_id_is_arxiv":true,"paper":"/paper/cross-trajectory-representation-learning-for","title":"Cross-Trajectory Representation Learning for Zero-Shot Generalization in RL","date":"2021-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bmazoure/ctrl_public","path":"algo.py","file_url":"https://github.com/bmazoure/ctrl_public/blob/HEAD/algo.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, bmazoure/ctrl_public when it was checked","code_sha256":"2ed07b9462bf332f","code_sha256_prefix":"2ed07b9462bf332f","mcp_get_code":{"code_sha256":"2ed07b9462bf332f"}},{"arxiv_id":"2007.09445","arxiv_id_is_arxiv":true,"paper":"/paper/structure-mapping-for-transferability-of","title":"Structure Mapping for Transferability of Causal Models","date":"2020-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Information-Fusion-Lab-Umass/causal_transfer_learning","path":"codes/models/rl_approaches/DQN_main.py","file_url":"https://github.com/Information-Fusion-Lab-Umass/causal_transfer_learning/blob/HEAD/codes/models/rl_approaches/DQN_main.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Information-Fusion-Lab-Umass/causal_transfer_learning when it was checked","code_sha256":"bb75366f778f682d","code_sha256_prefix":"bb75366f778f682d","mcp_get_code":{"code_sha256":"bb75366f778f682d"}},{"arxiv_id":"2002.08376","arxiv_id_is_arxiv":true,"paper":"/paper/a-differentiable-programming-method-for","title":"A differentiable programming method for quantum control","date":null,"month_inferred_from_arxiv_id":"2020-02","title_source":"archive","repo":"frankschae/A-differentiable-programming-method-for-quantum-control","path":"qubit/reinforce/policy_gradient_qubit.py","file_url":"https://github.com/frankschae/A-differentiable-programming-method-for-quantum-control/blob/HEAD/qubit/reinforce/policy_gradient_qubit.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":"e35734bfb6c1e4ee","code_sha256_prefix":"e35734bfb6c1e4ee","mcp_get_code":{"code_sha256":"e35734bfb6c1e4ee"}},{"arxiv_id":"2001.00326","arxiv_id_is_arxiv":true,"paper":"/paper/nas-bench-102-extending-the-scope-of","title":"NAS-Bench-201: Extending the Scope of Reproducible Neural Architecture Search","date":"2020-01-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"D-X-Y/NAS-Projects","path":"exps/NAS-Bench-201-algos/reinforce.py","file_url":"https://github.com/D-X-Y/NAS-Projects/blob/HEAD/exps/NAS-Bench-201-algos/reinforce.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":"0e6f925ca93551fa","code_sha256_prefix":"0e6f925ca93551fa","mcp_get_code":{"code_sha256":"0e6f925ca93551fa"}},{"arxiv_id":"2001.00326","arxiv_id_is_arxiv":true,"paper":"/paper/nas-bench-102-extending-the-scope-of","title":"NAS-Bench-201: Extending the Scope of Reproducible Neural Architecture Search","date":"2020-01-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yoichii/nashpobench2api","path":"bench_algos/reinforce.py","file_url":"https://github.com/yoichii/nashpobench2api/blob/HEAD/bench_algos/reinforce.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0aaac10bb2675319","code_sha256_prefix":"0aaac10bb2675319","mcp_get_code":{"code_sha256":"0aaac10bb2675319"}},{"arxiv_id":"1911.08265","arxiv_id_is_arxiv":true,"paper":"/paper/mastering-atari-go-chess-and-shogi-by","title":"Mastering Atari, Go, Chess and Shogi by Planning with a Learned Model","date":"2019-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dmiracle/muzero-starter","path":"pseudocode.py","file_url":"https://github.com/dmiracle/muzero-starter/blob/HEAD/pseudocode.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, dmiracle/muzero-starter when it was checked","code_sha256":"fe46ed855a1faead","code_sha256_prefix":"fe46ed855a1faead","mcp_get_code":{"code_sha256":"fe46ed855a1faead"}},{"arxiv_id":"1902.02441","arxiv_id_is_arxiv":true,"paper":"/paper/artificial-intelligence-for-prosthetics","title":"Artificial Intelligence for Prosthetics - challenge solutions","date":"2019-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iasawseen/MultiServerRL","path":"simple_virtual_env/client.py","file_url":"https://github.com/iasawseen/MultiServerRL/blob/HEAD/simple_virtual_env/client.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":"17277a43a521c152","code_sha256_prefix":"17277a43a521c152","mcp_get_code":{"code_sha256":"17277a43a521c152"}},{"arxiv_id":"1812.09755","arxiv_id_is_arxiv":true,"paper":"/paper/learning-when-to-communicate-at-scale-in","title":"Learning when to Communicate at Scale in Multiagent Cooperative and Competitive Tasks","date":"2018-12-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IC3Net/IC3Net","path":"action_utils.py","file_url":"https://github.com/IC3Net/IC3Net/blob/HEAD/action_utils.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":"dbf148c04f6bc762","code_sha256_prefix":"dbf148c04f6bc762","mcp_get_code":{"code_sha256":"dbf148c04f6bc762"}},{"arxiv_id":"1812.06110","arxiv_id_is_arxiv":true,"paper":"/paper/dopamine-a-research-framework-for-deep","title":"Dopamine: A Research Framework for Deep Reinforcement Learning","date":"2018-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google/dopamine","path":"dopamine/jax/agents/rainbow/rainbow_agent.py","file_url":"https://github.com/google/dopamine/blob/HEAD/dopamine/jax/agents/rainbow/rainbow_agent.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e71ad53b0a330121","code_sha256_prefix":"e71ad53b0a330121","mcp_get_code":{"code_sha256":"e71ad53b0a330121"}},{"arxiv_id":"1810.06339","arxiv_id_is_arxiv":true,"paper":"/paper/deep-reinforcement-learning","title":"Deep Reinforcement Learning","date":"2018-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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":"e71ad53b0a330121","code_sha256_prefix":"e71ad53b0a330121","mcp_get_code":{"code_sha256":"e71ad53b0a330121"}},{"arxiv_id":"1805.09044","arxiv_id_is_arxiv":true,"paper":"/paper/representation-balancing-mdps-for-off-policy","title":"Representation Balancing MDPs for Off-Policy Policy Evaluation","date":"2018-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stanfordai4hi/repbm","path":"qlearning_cartpole.py","file_url":"https://github.com/stanfordai4hi/repbm/blob/HEAD/qlearning_cartpole.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a1999e91696fab13","code_sha256_prefix":"a1999e91696fab13","mcp_get_code":{"code_sha256":"a1999e91696fab13"}},{"arxiv_id":"1710.11089","arxiv_id_is_arxiv":true,"paper":"/paper/eigenoption-discovery-through-the-deep","title":"Eigenoption Discovery through the Deep Successor Representation","date":"2017-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mklissa/dceo","path":"dopamine/jax/agents/full_rainbow/full_rainbow_dceo.py","file_url":"https://github.com/mklissa/dceo/blob/HEAD/dopamine/jax/agents/full_rainbow/full_rainbow_dceo.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2957ca0c26f2fc3f","code_sha256_prefix":"2957ca0c26f2fc3f","mcp_get_code":{"code_sha256":"2957ca0c26f2fc3f"}}],"record_sha256":"2fb57c3d3968d6b7d678236d9471f1d24f5ca100a55f7e8b2d3015f4fd61d8ee","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}