{"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/cg","entry":"cg","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":10,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":6,"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":7,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":10,"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":0,"ran_violates":0,"ran_draft_wrong":4,"ran_fixture":0,"ran":3,"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":"2308.14409","arxiv_id_is_arxiv":true,"paper":"/paper/steerable-conditional-diffusion-for-out-of","title":"Steerable Conditional Diffusion for Out-of-Distribution Adaptation in Medical Image Reconstruction","date":"2023-08-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alexdenker/SteerableConditionalDiffusion","path":"algos/scd.py","file_url":"https://github.com/alexdenker/SteerableConditionalDiffusion/blob/HEAD/algos/scd.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"705c1fbfad2fe15f","code_sha256_prefix":"705c1fbfad2fe15f","mcp_get_code":{"code_sha256":"705c1fbfad2fe15f"}},{"arxiv_id":"2305.13681","arxiv_id_is_arxiv":true,"paper":"/paper/guard-a-safe-reinforcement-learning-benchmark","title":"GUARD: A Safe Reinforcement Learning Benchmark","date":"2023-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"intelligent-control-lab/guard","path":"safe_rl_lib/cpo/cpo.py","file_url":"https://github.com/intelligent-control-lab/guard/blob/HEAD/safe_rl_lib/cpo/cpo.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c49c1432a1f5bace","code_sha256_prefix":"c49c1432a1f5bace","mcp_get_code":{"code_sha256":"c49c1432a1f5bace"}},{"arxiv_id":"2302.03407","arxiv_id_is_arxiv":true,"paper":"/paper/averaged-method-of-multipliers-for-bi-level","title":"Averaged Method of Multipliers for Bi-Level Optimization without Lower-Level Strong Convexity","date":"2023-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vis-opt-group/sl-bamm","path":"hypergrad/CG_torch.py","file_url":"https://github.com/vis-opt-group/sl-bamm/blob/HEAD/hypergrad/CG_torch.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ccd4881b531f738e","code_sha256_prefix":"ccd4881b531f738e","mcp_get_code":{"code_sha256":"ccd4881b531f738e"}},{"arxiv_id":"2109.15048","arxiv_id_is_arxiv":true,"paper":"/paper/physical-gradients-for-deep-learning","title":"Scale-invariant Learning by Physics Inversion","date":"2021-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ltatzel/PyTorchHessianFree","path":"hessianfree/cg.py","file_url":"https://github.com/ltatzel/PyTorchHessianFree/blob/HEAD/hessianfree/cg.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5d32fc50353666d3","code_sha256_prefix":"5d32fc50353666d3","mcp_get_code":{"code_sha256":"5d32fc50353666d3"}},{"arxiv_id":"2106.04692","arxiv_id_is_arxiv":true,"paper":"/paper/provably-faster-algorithms-for-bilevel","title":"Provably Faster Algorithms for Bilevel Optimization","date":"2021-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junjieyang97/mrvrbo","path":"hypergrad/CG_torch.py","file_url":"https://github.com/junjieyang97/mrvrbo/blob/HEAD/hypergrad/CG_torch.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"31f282d2a7c181bb","code_sha256_prefix":"31f282d2a7c181bb","mcp_get_code":{"code_sha256":"31f282d2a7c181bb"}},{"arxiv_id":"2010.07962","arxiv_id_is_arxiv":true,"paper":"/paper/provably-faster-algorithms-for-bilevel-1","title":"Bilevel Optimization: Convergence Analysis and Enhanced Design","date":"2020-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junjieyang97/stocbio_hp","path":"Hyperparameter-optimization/hypergrad/CG_torch.py","file_url":"https://github.com/junjieyang97/stocbio_hp/blob/HEAD/Hyperparameter-optimization/hypergrad/CG_torch.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"31f282d2a7c181bb","code_sha256_prefix":"31f282d2a7c181bb","mcp_get_code":{"code_sha256":"31f282d2a7c181bb"}},{"arxiv_id":"2010.07916","arxiv_id_is_arxiv":true,"paper":"/paper/multi-agent-trust-region-policy-optimization","title":"Multi-Agent Trust Region Policy Optimization","date":"2020-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hepengli/matrpo","path":"matrpo/common/cg.py","file_url":"https://github.com/hepengli/matrpo/blob/HEAD/matrpo/common/cg.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":"e0fa22de3d36e9f1","code_sha256_prefix":"e0fa22de3d36e9f1","mcp_get_code":{"code_sha256":"e0fa22de3d36e9f1"}},{"arxiv_id":"2006.14606","arxiv_id_is_arxiv":true,"paper":"/paper/global-convergence-and-induced-kernels-of","title":"Global Convergence and Generalization Bound of Gradient-Based Meta-Learning with Deep Neural Nets","date":"2020-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AI-secure/Meta-Neural-Kernel","path":"hypergrad/CG_torch.py","file_url":"https://github.com/AI-secure/Meta-Neural-Kernel/blob/HEAD/hypergrad/CG_torch.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"31f282d2a7c181bb","code_sha256_prefix":"31f282d2a7c181bb","mcp_get_code":{"code_sha256":"31f282d2a7c181bb"}},{"arxiv_id":"2006.04061","arxiv_id_is_arxiv":true,"paper":"/paper/dual-policy-distillation","title":"Dual Policy Distillation","date":"2020-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kiminh/dual-policy-distillation","path":"baselines/common/cg.py","file_url":"https://github.com/kiminh/dual-policy-distillation/blob/HEAD/baselines/common/cg.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, kiminh/dual-policy-distillation, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"a14fa85826d8091c","code_sha256_prefix":"a14fa85826d8091c","mcp_get_code":{"code_sha256":"a14fa85826d8091c"}},{"arxiv_id":"1905.02363","arxiv_id_is_arxiv":true,"paper":"/paper/dimension-wise-importance-sampling-weight","title":"Dimension-Wise Importance Sampling Weight Clipping for Sample-Efficient Reinforcement Learning","date":"2019-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seungyulhan/disc","path":"baselines/common/cg.py","file_url":"https://github.com/seungyulhan/disc/blob/HEAD/baselines/common/cg.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, seungyulhan/disc, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"a14fa85826d8091c","code_sha256_prefix":"a14fa85826d8091c","mcp_get_code":{"code_sha256":"a14fa85826d8091c"}}],"record_sha256":"76418652db6a3c8111cd5dad2127310980d7a835cfa3ded513ee63d1054d4723","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}