{"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/asymmetric-l2-loss","entry":"asymmetric_l2_loss","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":0,"n_papers_ran_instrument_only":11,"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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":5,"n_samples_unverified":0,"n_samples_fingerprinted":5,"n_places":12,"n_places_pointer_only":9,"n_places_pointer_only_link_open":2,"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":5,"ran_fixture":0,"ran":0,"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":"2608.02332","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-02332","title":"Diffusion Policy with Behavioral Advantage Correction for Offline Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"thu-ml/SRPO","path":"SRPO.py","file_url":"https://github.com/thu-ml/SRPO/blob/HEAD/SRPO.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"579d77f78c03773e","code_sha256_prefix":"579d77f78c03773e","mcp_get_code":{"code_sha256":"579d77f78c03773e"}},{"arxiv_id":"2512.02486","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2512-02486","title":"Dual-Robust Cross-Domain Offline Reinforcement Learning Against Dynamics Shifts","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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":"82a8f299419d4d83","code_sha256_prefix":"82a8f299419d4d83","mcp_get_code":{"code_sha256":"82a8f299419d4d83"}},{"arxiv_id":"2510.15382","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-15382","title":"Towards Robust Zero-Shot Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"Whiterrrrr/BREEZE","path":"agents/breeze/utils/losses.py","file_url":"https://github.com/Whiterrrrr/BREEZE/blob/HEAD/agents/breeze/utils/losses.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6943fbf5c4f34756","code_sha256_prefix":"6943fbf5c4f34756","mcp_get_code":{"code_sha256":"6943fbf5c4f34756"}},{"arxiv_id":"2412.18946","arxiv_id_is_arxiv":true,"paper":"/paper/constraint-adaptive-policy-switching-for","title":"Constraint-Adaptive Policy Switching for Offline Safe Reinforcement Learning","date":"2024-12-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yassinech/caps","path":"osrl/algorthims/capsiql.py","file_url":"https://github.com/yassinech/caps/blob/HEAD/osrl/algorthims/capsiql.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yassinech/caps when it was checked","code_sha256":"82a8f299419d4d83","code_sha256_prefix":"82a8f299419d4d83","mcp_get_code":{"code_sha256":"82a8f299419d4d83"}},{"arxiv_id":"2412.08794","arxiv_id_is_arxiv":true,"paper":"/paper/latent-safety-constrained-policy-approach-for","title":"Latent Safety-Constrained Policy Approach for Safe Offline Reinforcement Learning","date":"2024-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PrajwalKoirala/LSPC-Safe-Offline-RL","path":"lspc_iql.py","file_url":"https://github.com/PrajwalKoirala/LSPC-Safe-Offline-RL/blob/HEAD/lspc_iql.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, PrajwalKoirala/LSPC-Safe-Offline-RL when it was checked","code_sha256":"82a8f299419d4d83","code_sha256_prefix":"82a8f299419d4d83","mcp_get_code":{"code_sha256":"82a8f299419d4d83"}},{"arxiv_id":"2410.20750","arxiv_id_is_arxiv":true,"paper":"/paper/odrl-a-benchmark-for-off-dynamics","title":"ODRL: A Benchmark for Off-Dynamics Reinforcement Learning","date":"2024-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"offdynamicsrl/off-dynamics-rl","path":"algo/offline_offline/dara.py","file_url":"https://github.com/offdynamicsrl/off-dynamics-rl/blob/HEAD/algo/offline_offline/dara.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from yassinech/caps, and GitHub detected no licence in that repository when it was checked","code_sha256":"82a8f299419d4d83","code_sha256_prefix":"82a8f299419d4d83","mcp_get_code":{"code_sha256":"82a8f299419d4d83"}},{"arxiv_id":"2408.07753","arxiv_id_is_arxiv":true,"paper":"/paper/how-to-solve-contextual-goal-oriented","title":"How to Solve Contextual Goal-Oriented Problems with Offline Datasets?","date":"2024-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yingfan-bot/coda","path":"src/iql.py","file_url":"https://github.com/yingfan-bot/coda/blob/HEAD/src/iql.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yingfan-bot/coda when it was checked","code_sha256":"e73cbb034680db95","code_sha256_prefix":"e73cbb034680db95","mcp_get_code":{"code_sha256":"e73cbb034680db95"}},{"arxiv_id":"2407.09024","arxiv_id_is_arxiv":true,"paper":"/paper/aligning-diffusion-behaviors-with-q-functions","title":"Aligning Diffusion Behaviors with Q-functions for Efficient Continuous Control","date":"2024-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-ml/Efficient-Diffusion-Alignment","path":"BDiffusion.py","file_url":"https://github.com/thu-ml/Efficient-Diffusion-Alignment/blob/HEAD/BDiffusion.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, thu-ml/Efficient-Diffusion-Alignment when it was checked","code_sha256":"579d77f78c03773e","code_sha256_prefix":"579d77f78c03773e","mcp_get_code":{"code_sha256":"579d77f78c03773e"}},{"arxiv_id":"2405.16907","arxiv_id_is_arxiv":true,"paper":"/paper/gta-generative-trajectory-augmentation-with","title":"GTA: Generative Trajectory Augmentation with Guidance for Offline Reinforcement Learning","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jaewoopudding/GTA","path":"corl/algorithms/iql.py","file_url":"https://github.com/Jaewoopudding/GTA/blob/HEAD/corl/algorithms/iql.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from yassinech/caps, and GitHub detected no licence in that repository when it was checked","code_sha256":"82a8f299419d4d83","code_sha256_prefix":"82a8f299419d4d83","mcp_get_code":{"code_sha256":"82a8f299419d4d83"}},{"arxiv_id":"2310.07297","arxiv_id_is_arxiv":true,"paper":"/paper/score-regularized-policy-optimization-through","title":"Score Regularized Policy Optimization through Diffusion Behavior","date":"2023-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-ml/srpo","path":"SRPO.py","file_url":"https://github.com/thu-ml/srpo/blob/HEAD/SRPO.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"579d77f78c03773e","code_sha256_prefix":"579d77f78c03773e","mcp_get_code":{"code_sha256":"579d77f78c03773e"}},{"arxiv_id":"2110.06169","arxiv_id_is_arxiv":true,"paper":"/paper/offline-reinforcement-learning-with-implicit","title":"Offline Reinforcement Learning with Implicit Q-Learning","date":"2021-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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":"579d77f78c03773e","code_sha256_prefix":"579d77f78c03773e","mcp_get_code":{"code_sha256":"579d77f78c03773e"}},{"arxiv_id":"2110.06169","arxiv_id_is_arxiv":true,"paper":"/paper/offline-reinforcement-learning-with-implicit","title":"Offline Reinforcement Learning with Implicit Q-Learning","date":"2021-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linhlpv/Offline-and-OfflineOnline-RL","path":"IQL/iql.py","file_url":"https://github.com/linhlpv/Offline-and-OfflineOnline-RL/blob/HEAD/IQL/iql.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, linhlpv/Offline-and-OfflineOnline-RL when it was checked","code_sha256":"b2bdeb779182394b","code_sha256_prefix":"b2bdeb779182394b","mcp_get_code":{"code_sha256":"b2bdeb779182394b"}}],"record_sha256":"564bc5f4df4b98c2be97d3330d1be28e34011ba2a37fc87489b4c7d1f476b51c","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}