{"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/evaluate-policy","entry":"evaluate_policy","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":12,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":2,"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":14,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":3,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":14,"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":5,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":2,"unverified":4},"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":"2607.22832","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-22832","title":"MEMENTO: Memory-Guided Memetic Code-as-Policy Evolution","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"sygkounas/MEMENTO","path":"MEMENTO/inference.py","file_url":"https://github.com/sygkounas/MEMENTO/blob/HEAD/MEMENTO/inference.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, sygkounas/MEMENTO when it was checked","code_sha256":"fa7c1ce1e0acb07b","code_sha256_prefix":"fa7c1ce1e0acb07b","mcp_get_code":{"code_sha256":"fa7c1ce1e0acb07b"}},{"arxiv_id":"2606.10321","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-10321","title":"Baseline-Free Policy Optimization for Neural Combinatorial Optimization","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"carsepmo/grpo-nco","path":"validate_checkpoints.py","file_url":"https://github.com/carsepmo/grpo-nco/blob/HEAD/validate_checkpoints.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, carsepmo/grpo-nco (NOASSERTION)","code_sha256":"887a5f94b047dd9b","code_sha256_prefix":"887a5f94b047dd9b","mcp_get_code":{"code_sha256":"887a5f94b047dd9b"}},{"arxiv_id":"2606.10187","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-10187","title":"Decision-Calibrated Conformal Uncertainty for Pacing Decisions in Streaming Advertising","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"p-shekhar/pacing-decisions-advertising","path":"src/pacing.py","file_url":"https://github.com/p-shekhar/pacing-decisions-advertising/blob/HEAD/src/pacing.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d3e1e851a080a450","code_sha256_prefix":"d3e1e851a080a450","mcp_get_code":{"code_sha256":"d3e1e851a080a450"}},{"arxiv_id":"2410.08979","arxiv_id_is_arxiv":true,"paper":"/paper/overcoming-slow-decision-frequencies-in","title":"Overcoming Slow Decision Frequencies in Continuous Control: Model-Based Sequence Reinforcement Learning for Model-Free Control","date":"2024-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dee0512/sequence-reinforcement-learning","path":"scripts/eval_sac.py","file_url":"https://github.com/dee0512/sequence-reinforcement-learning/blob/HEAD/scripts/eval_sac.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"54f3f957abc96d34","code_sha256_prefix":"54f3f957abc96d34","mcp_get_code":{"code_sha256":"54f3f957abc96d34"}},{"arxiv_id":"2409.04792","arxiv_id_is_arxiv":true,"paper":"/paper/improving-deep-reinforcement-learning-by","title":"Improving Deep Reinforcement Learning by Reducing the Chain Effect of Value and Policy Churn","date":"2024-09-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bluecontra/chain","path":"minatar/run_double_dqn_chain.py","file_url":"https://github.com/bluecontra/chain/blob/HEAD/minatar/run_double_dqn_chain.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, bluecontra/chain when it was checked","code_sha256":"519bcb97d620e3bb","code_sha256_prefix":"519bcb97d620e3bb","mcp_get_code":{"code_sha256":"519bcb97d620e3bb"}},{"arxiv_id":"2311.08384","arxiv_id_is_arxiv":true,"paper":"/paper/offline-data-enhanced-on-policy-policy","title":"Offline Data Enhanced On-Policy Policy Gradient with Provable Guarantees","date":"2023-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yifeizhou02/hnpg","path":"collect_offline.py","file_url":"https://github.com/yifeizhou02/hnpg/blob/HEAD/collect_offline.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, yifeizhou02/hnpg (NOASSERTION)","code_sha256":"ff955a588d675fe2","code_sha256_prefix":"ff955a588d675fe2","mcp_get_code":{"code_sha256":"ff955a588d675fe2"}},{"arxiv_id":"2307.08875","arxiv_id_is_arxiv":true,"paper":"/paper/natural-actor-critic-for-robust-reinforcement","title":"Natural Actor-Critic for Robust Reinforcement Learning with Function Approximation","date":"2023-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tliu1997/rnac","path":"train_rnac.py","file_url":"https://github.com/tliu1997/rnac/blob/HEAD/train_rnac.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, tliu1997/rnac when it was checked","code_sha256":"f74e37440bbe7726","code_sha256_prefix":"f74e37440bbe7726","mcp_get_code":{"code_sha256":"f74e37440bbe7726"}},{"arxiv_id":"2307.08875","arxiv_id_is_arxiv":true,"paper":"/paper/natural-actor-critic-for-robust-reinforcement","title":"Natural Actor-Critic for Robust Reinforcement Learning with Function Approximation","date":"2023-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tliu1997/rnac","path":"eval_rnac.py","file_url":"https://github.com/tliu1997/rnac/blob/HEAD/eval_rnac.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, tliu1997/rnac when it was checked","code_sha256":"b49898d9bdfeb500","code_sha256_prefix":"b49898d9bdfeb500","mcp_get_code":{"code_sha256":"b49898d9bdfeb500"}},{"arxiv_id":"2302.13348","arxiv_id_is_arxiv":true,"paper":"/paper/kernel-conditional-moment-constraints-for","title":"Kernel Conditional Moment Constraints for Confounding Robust Inference","date":"2023-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kstoneriv3/confounding-robust-inference-old","path":"kcmc/data_binary.py","file_url":"https://github.com/kstoneriv3/confounding-robust-inference-old/blob/HEAD/kcmc/data_binary.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":"212507fb5a1cb43c","code_sha256_prefix":"212507fb5a1cb43c","mcp_get_code":{"code_sha256":"212507fb5a1cb43c"}},{"arxiv_id":"2302.13348","arxiv_id_is_arxiv":true,"paper":"/paper/kernel-conditional-moment-constraints-for","title":"Kernel Conditional Moment Constraints for Confounding Robust Inference","date":"2023-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kstoneriv3/confounding-robust-inference-old","path":"kcmc/data_continuous.py","file_url":"https://github.com/kstoneriv3/confounding-robust-inference-old/blob/HEAD/kcmc/data_continuous.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":"92802e330a871651","code_sha256_prefix":"92802e330a871651","mcp_get_code":{"code_sha256":"92802e330a871651"}},{"arxiv_id":"1910.12179","arxiv_id_is_arxiv":true,"paper":"/paper/bail-best-action-imitation-learning-for-batch-1","title":"BAIL: Best-Action Imitation Learning for Batch Deep Reinforcement Learning","date":"2019-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lanyavik/BAIL","path":"spinup/spinup/algos/BAIL/main_static_bail.py","file_url":"https://github.com/lanyavik/BAIL/blob/HEAD/spinup/spinup/algos/BAIL/main_static_bail.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lanyavik/BAIL when it was checked","code_sha256":"c74671448905c5d4","code_sha256_prefix":"c74671448905c5d4","mcp_get_code":{"code_sha256":"c74671448905c5d4"}},{"arxiv_id":"1908.09357","arxiv_id_is_arxiv":true,"paper":"/paper/dynamics-aware-embeddings","title":"Dynamics-aware Embeddings","date":"2019-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dyne-submission/dynamics-aware-embeddings","path":"rl/main_dyne.py","file_url":"https://github.com/dyne-submission/dynamics-aware-embeddings/blob/HEAD/rl/main_dyne.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, dyne-submission/dynamics-aware-embeddings when it was checked","code_sha256":"a992966274227e22","code_sha256_prefix":"a992966274227e22","mcp_get_code":{"code_sha256":"a992966274227e22"}},{"arxiv_id":"1805.09801","arxiv_id_is_arxiv":true,"paper":"/paper/meta-gradient-reinforcement-learning","title":"Meta-Gradient Reinforcement Learning","date":"2018-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RobvanGastel/meta-rl-algorithms","path":"algos/rl2_ppo/learning.py","file_url":"https://github.com/RobvanGastel/meta-rl-algorithms/blob/HEAD/algos/rl2_ppo/learning.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":"29d380560ab46818","code_sha256_prefix":"29d380560ab46818","mcp_get_code":{"code_sha256":"29d380560ab46818"}},{"arxiv_id":"1802.09477","arxiv_id_is_arxiv":true,"paper":"/paper/addressing-function-approximation-error-in","title":"Addressing Function Approximation Error in Actor-Critic Methods","date":"2018-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VasaKiDD/TD3-deep-rl-research","path":"train/main_faimemory.py","file_url":"https://github.com/VasaKiDD/TD3-deep-rl-research/blob/HEAD/train/main_faimemory.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b0a2d4b21b2d48e6","code_sha256_prefix":"b0a2d4b21b2d48e6","mcp_get_code":{"code_sha256":"b0a2d4b21b2d48e6"}}],"record_sha256":"d4b3cff9cda73339bde5d40efcaee450797d11219e88a87c84b3afba5fdb81bf","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}