{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/huber","entry":"huber","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":13,"n_papers_ran":9,"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":3,"n_samples_fingerprinted":2,"n_places":13,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":2,"unverified":4},"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","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5f99e218ffb1f571","mcp_get_code":{"code_sha256":"5f99e218ffb1f571"}},{"arxiv_id":"2602.18277","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5f99e218ffb1f571","mcp_get_code":{"code_sha256":"5f99e218ffb1f571"}},{"arxiv_id":"2501.02087","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,"code_sha256_prefix":"c31cb0cb3f1f949f","mcp_get_code":{"code_sha256":"c31cb0cb3f1f949f"}},{"arxiv_id":"2411.03604","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"32ccda7b7e95f774","mcp_get_code":{"code_sha256":"32ccda7b7e95f774"}},{"arxiv_id":"2410.04386","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,"code_sha256_prefix":"3f594ff441c3d230","mcp_get_code":{"code_sha256":"3f594ff441c3d230"}},{"arxiv_id":"2312.14472","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":true,"code_sha256_prefix":"c31cb0cb3f1f949f","mcp_get_code":{"code_sha256":"c31cb0cb3f1f949f"}},{"arxiv_id":"2311.12495","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5f99e218ffb1f571","mcp_get_code":{"code_sha256":"5f99e218ffb1f571"}},{"arxiv_id":"2301.04330","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5e178c7f41639d65","mcp_get_code":{"code_sha256":"5e178c7f41639d65"}},{"arxiv_id":"2204.00406","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"1793c2507afc4fe3","mcp_get_code":{"code_sha256":"1793c2507afc4fe3"}},{"arxiv_id":"2101.08477","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,"code_sha256_prefix":"c31cb0cb3f1f949f","mcp_get_code":{"code_sha256":"c31cb0cb3f1f949f"}},{"arxiv_id":"2009.04278","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":true,"code_sha256_prefix":"c31cb0cb3f1f949f","mcp_get_code":{"code_sha256":"c31cb0cb3f1f949f"}},{"arxiv_id":"1906.00966","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,"code_sha256_prefix":"4f6e83315977f1c2","mcp_get_code":{"code_sha256":"4f6e83315977f1c2"}},{"arxiv_id":"1710.10044","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":true,"code_sha256_prefix":"c31cb0cb3f1f949f","mcp_get_code":{"code_sha256":"c31cb0cb3f1f949f"}}]}