{"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/huber","entry":"huber","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":13,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":8,"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":6,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":5,"n_places":13,"n_places_pointer_only":8,"n_places_pointer_only_link_open":5,"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":1,"ran_draft_wrong":2,"ran_fixture":0,"ran":3,"unverified":1},"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.19134","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-19134","title":"Pareto Q-Learning with Reward Machines","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"arnaudlequen/PQLRM","path":"baselines/common/networks.py","file_url":"https://github.com/arnaudlequen/PQLRM/blob/HEAD/baselines/common/networks.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, arnaudlequen/PQLRM when it was checked","code_sha256":"5f99e218ffb1f571","code_sha256_prefix":"5f99e218ffb1f571","mcp_get_code":{"code_sha256":"5f99e218ffb1f571"}},{"arxiv_id":"2602.18277","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-18277","title":"PRISM: Parallel Reward Integration with Symmetry for MORL","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"EVIEHub/PRISM","path":"code/morl_baselines/common/networks.py","file_url":"https://github.com/EVIEHub/PRISM/blob/HEAD/code/morl_baselines/common/networks.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"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 arnaudlequen/PQLRM, and GitHub detected no licence in that repository when it was checked","code_sha256":"5f99e218ffb1f571","code_sha256_prefix":"5f99e218ffb1f571","mcp_get_code":{"code_sha256":"5f99e218ffb1f571"}},{"arxiv_id":"2501.02087","arxiv_id_is_arxiv":true,"paper":"/paper/beyond-cvar-leveraging-static-spectral-risk","title":"Beyond CVaR: Leveraging Static Spectral Risk Measures for Enhanced Decision-Making in Distributional Reinforcement Learning","date":"2025-01-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mehrdadmoghimi/qrsrm","path":"qrsrm.py","file_url":"https://github.com/mehrdadmoghimi/qrsrm/blob/HEAD/qrsrm.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, mehrdadmoghimi/qrsrm when it was checked","code_sha256":"c31cb0cb3f1f949f","code_sha256_prefix":"c31cb0cb3f1f949f","mcp_get_code":{"code_sha256":"c31cb0cb3f1f949f"}},{"arxiv_id":"2411.03604","arxiv_id_is_arxiv":true,"paper":"/paper/temporal-difference-learning-using","title":"Temporal-Difference Learning Using Distributed Error Signals","date":"2024-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"social-ai-uoft/ad-paper","path":"src/artificial_dopamine/algorithms/ad_qrdqn.py","file_url":"https://github.com/social-ai-uoft/ad-paper/blob/HEAD/src/artificial_dopamine/algorithms/ad_qrdqn.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"32ccda7b7e95f774","code_sha256_prefix":"32ccda7b7e95f774","mcp_get_code":{"code_sha256":"32ccda7b7e95f774"}},{"arxiv_id":"2410.04386","arxiv_id_is_arxiv":true,"paper":"/paper/data-distribution-valuation","title":"Data Distribution Valuation","date":"2024-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XinyiYS/Data_Distribution_Valuation","path":"data_utils.py","file_url":"https://github.com/XinyiYS/Data_Distribution_Valuation/blob/HEAD/data_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":"3f594ff441c3d230","code_sha256_prefix":"3f594ff441c3d230","mcp_get_code":{"code_sha256":"3f594ff441c3d230"}},{"arxiv_id":"2312.14472","arxiv_id_is_arxiv":true,"paper":"/paper/not-all-tasks-are-equally-difficult-multi","title":"Not All Tasks Are Equally Difficult: Multi-Task Deep Reinforcement Learning with Dynamic Depth Routing","date":"2023-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DarkDawn233/D2R_MTRL","path":"torchrl/algo/utils.py","file_url":"https://github.com/DarkDawn233/D2R_MTRL/blob/HEAD/torchrl/algo/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from mehrdadmoghimi/qrsrm, and GitHub detected no licence in that repository when it was checked","code_sha256":"c31cb0cb3f1f949f","code_sha256_prefix":"c31cb0cb3f1f949f","mcp_get_code":{"code_sha256":"c31cb0cb3f1f949f"}},{"arxiv_id":"2311.12495","arxiv_id_is_arxiv":true,"paper":"/paper/multi-objective-reinforcement-learning-based-2","title":"Multi-Objective Reinforcement Learning Based on Decomposition: A Taxonomy and Framework","date":"2023-11-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucasalegre/morl-baselines","path":"morl_baselines/common/networks.py","file_url":"https://github.com/lucasalegre/morl-baselines/blob/HEAD/morl_baselines/common/networks.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"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 arnaudlequen/PQLRM, and GitHub detected no licence in that repository when it was checked","code_sha256":"5f99e218ffb1f571","code_sha256_prefix":"5f99e218ffb1f571","mcp_get_code":{"code_sha256":"5f99e218ffb1f571"}},{"arxiv_id":"2301.04330","arxiv_id_is_arxiv":true,"paper":"/paper/fast-kinodynamic-planning-on-the-constraint","title":"Fast Kinodynamic Planning on the Constraint Manifold with Deep Neural Networks","date":"2023-01-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pkicki/cnp-b","path":"losses/utils.py","file_url":"https://github.com/pkicki/cnp-b/blob/HEAD/losses/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5e178c7f41639d65","code_sha256_prefix":"5e178c7f41639d65","mcp_get_code":{"code_sha256":"5e178c7f41639d65"}},{"arxiv_id":"2204.00406","arxiv_id_is_arxiv":true,"paper":"/paper/a-semismooth-newton-stochastic-proximal-point","title":"A Semismooth Newton Stochastic Proximal Point Algorithm with Variance Reduction","date":"2022-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fabian-sp/snspp","path":"snspp/matopt/nuclear.py","file_url":"https://github.com/fabian-sp/snspp/blob/HEAD/snspp/matopt/nuclear.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1793c2507afc4fe3","code_sha256_prefix":"1793c2507afc4fe3","mcp_get_code":{"code_sha256":"1793c2507afc4fe3"}},{"arxiv_id":"2101.08477","arxiv_id_is_arxiv":true,"paper":"/paper/unifying-cardiovascular-modelling-with-deep","title":"Unifying Cardiovascular Modelling with Deep Reinforcement Learning for Uncertainty Aware Control of Sepsis Treatment","date":"2021-01-21","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":"c31cb0cb3f1f949f","code_sha256_prefix":"c31cb0cb3f1f949f","mcp_get_code":{"code_sha256":"c31cb0cb3f1f949f"}},{"arxiv_id":"2009.04278","arxiv_id_is_arxiv":true,"paper":"/paper/dynode-neural-ordinary-differential-equations","title":"DyNODE: Neural Ordinary Differential Equations for Dynamics Modeling in Continuous Control","date":"2020-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vmartinezalvarez/DyNODE","path":"utils.py","file_url":"https://github.com/vmartinezalvarez/DyNODE/blob/HEAD/utils.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 mehrdadmoghimi/qrsrm, and GitHub detected no licence in that repository when it was checked","code_sha256":"c31cb0cb3f1f949f","code_sha256_prefix":"c31cb0cb3f1f949f","mcp_get_code":{"code_sha256":"c31cb0cb3f1f949f"}},{"arxiv_id":"1906.00966","arxiv_id_is_arxiv":true,"paper":"/paper/190600966","title":"Wotan: Comprehensive time-series de-trending in Python","date":null,"month_inferred_from_arxiv_id":"2019-06","title_source":"archive","repo":"hippke/wotan","path":"wotan/norms.py","file_url":"https://github.com/hippke/wotan/blob/HEAD/wotan/norms.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":"4f6e83315977f1c2","code_sha256_prefix":"4f6e83315977f1c2","mcp_get_code":{"code_sha256":"4f6e83315977f1c2"}},{"arxiv_id":"1710.10044","arxiv_id_is_arxiv":true,"paper":"/paper/distributional-reinforcement-learning-with-1","title":"Distributional Reinforcement Learning with Quantile Regression","date":"2017-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ars-ashuha/quantile-regression-dqn-pytorch","path":"rl_utils.py","file_url":"https://github.com/ars-ashuha/quantile-regression-dqn-pytorch/blob/HEAD/rl_utils.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 mehrdadmoghimi/qrsrm, and GitHub detected no licence in that repository when it was checked","code_sha256":"c31cb0cb3f1f949f","code_sha256_prefix":"c31cb0cb3f1f949f","mcp_get_code":{"code_sha256":"c31cb0cb3f1f949f"}}],"record_sha256":"6250d1e69b74cdd6f27a11b504fd58e8d5b97825f4836b90bbc3a49cabe9c40a","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}