{"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/soft-update","entry":"soft_update","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":8,"n_papers_ran":0,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":0,"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":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":14,"n_samples_fingerprinted":0,"n_places":14,"n_places_pointer_only":11,"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":0,"ran_fixture":0,"ran":0,"unverified":14},"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":"2411.00610","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2411.00610","date":null,"month_inferred_from_arxiv_id":"2024-11","title_source":null,"repo":"lviano/p2il","path":"deep_PPIL/iq.py","file_url":"https://github.com/lviano/p2il/blob/HEAD/deep_PPIL/iq.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, lviano/p2il when it was checked","code_sha256":"f4f61a3c20d542b0","code_sha256_prefix":"f4f61a3c20d542b0","mcp_get_code":{"code_sha256":"f4f61a3c20d542b0"}},{"arxiv_id":"2402.13147","arxiv_id_is_arxiv":true,"paper":"/paper/subiq-inverse-soft-q-learning-for-offline","title":"SPRINQL: Sub-optimal Demonstrations driven Offline Imitation Learning","date":"2024-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hmhuy0/SPRINQL","path":"Sources/algos/sprinql.py","file_url":"https://github.com/hmhuy0/SPRINQL/blob/HEAD/Sources/algos/sprinql.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":"168373daffe72add","code_sha256_prefix":"168373daffe72add","mcp_get_code":{"code_sha256":"168373daffe72add"}},{"arxiv_id":"2310.12955","arxiv_id_is_arxiv":true,"paper":"/paper/towards-robust-offline-reinforcement-learning","title":"Towards Robust Offline Reinforcement Learning under Diverse Data Corruption","date":"2023-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangrui2015/riql","path":"RIQL.py","file_url":"https://github.com/yangrui2015/riql/blob/HEAD/RIQL.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, yangrui2015/riql when it was checked","code_sha256":"cca4505f10b19283","code_sha256_prefix":"cca4505f10b19283","mcp_get_code":{"code_sha256":"cca4505f10b19283"}},{"arxiv_id":"2110.01548","arxiv_id_is_arxiv":true,"paper":"/paper/uncertainty-based-offline-reinforcement","title":"Uncertainty-Based Offline Reinforcement Learning with Diversified Q-Ensemble","date":"2021-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"corl-team/CORL","path":"algorithms/offline/edac.py","file_url":"https://github.com/corl-team/CORL/blob/HEAD/algorithms/offline/edac.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"12fd41e242a13169","code_sha256_prefix":"12fd41e242a13169","mcp_get_code":{"code_sha256":"12fd41e242a13169"}},{"arxiv_id":"2006.09359","arxiv_id_is_arxiv":true,"paper":"/paper/accelerating-online-reinforcement-learning","title":"AWAC: Accelerating Online Reinforcement Learning with Offline Datasets","date":"2020-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linhlpv/Offline-and-OfflineOnline-RL","path":"AWAC/awac.py","file_url":"https://github.com/linhlpv/Offline-and-OfflineOnline-RL/blob/HEAD/AWAC/awac.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, linhlpv/Offline-and-OfflineOnline-RL when it was checked","code_sha256":"1ddf841eed24fa3a","code_sha256_prefix":"1ddf841eed24fa3a","mcp_get_code":{"code_sha256":"1ddf841eed24fa3a"}},{"arxiv_id":"2002.00632","arxiv_id_is_arxiv":true,"paper":"/paper/effective-diversity-in-population-based","title":"Effective Diversity in Population Based Reinforcement Learning","date":"2020-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"holounic/DvD-TD3","path":"td3/algorithm.py","file_url":"https://github.com/holounic/DvD-TD3/blob/HEAD/td3/algorithm.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, holounic/DvD-TD3 when it was checked","code_sha256":"ea8c4add89ea88fb","code_sha256_prefix":"ea8c4add89ea88fb","mcp_get_code":{"code_sha256":"ea8c4add89ea88fb"}},{"arxiv_id":"1801.01290","arxiv_id_is_arxiv":true,"paper":"/paper/soft-actor-critic-off-policy-maximum-entropy","title":"Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor","date":"2018-01-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Rafael1s/Deep-Reinforcement-Learning-Udacity","path":"Ant-PyBulletEnv-Soft-Actor-Critic/sac_agent.py","file_url":"https://github.com/Rafael1s/Deep-Reinforcement-Learning-Udacity/blob/HEAD/Ant-PyBulletEnv-Soft-Actor-Critic/sac_agent.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, Rafael1s/Deep-Reinforcement-Learning-Udacity when it was checked","code_sha256":"f735812881238a1f","code_sha256_prefix":"f735812881238a1f","mcp_get_code":{"code_sha256":"f735812881238a1f"}},{"arxiv_id":"1801.01290","arxiv_id_is_arxiv":true,"paper":"/paper/soft-actor-critic-off-policy-maximum-entropy","title":"Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor","date":"2018-01-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ku2482/discor.pytorch","path":"discor/algorithm/sac.py","file_url":"https://github.com/ku2482/discor.pytorch/blob/HEAD/discor/algorithm/sac.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":"e8abbe917721f0c8","code_sha256_prefix":"e8abbe917721f0c8","mcp_get_code":{"code_sha256":"e8abbe917721f0c8"}},{"arxiv_id":"1801.01290","arxiv_id_is_arxiv":true,"paper":"/paper/soft-actor-critic-off-policy-maximum-entropy","title":"Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor","date":"2018-01-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShawK91/Evolutionary-Reinforcement-Learning","path":"algos/sac.py","file_url":"https://github.com/ShawK91/Evolutionary-Reinforcement-Learning/blob/HEAD/algos/sac.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, ShawK91/Evolutionary-Reinforcement-Learning when it was checked","code_sha256":"fcdeb82694a504e1","code_sha256_prefix":"fcdeb82694a504e1","mcp_get_code":{"code_sha256":"fcdeb82694a504e1"}},{"arxiv_id":"1801.01290","arxiv_id_is_arxiv":true,"paper":"/paper/soft-actor-critic-off-policy-maximum-entropy","title":"Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor","date":"2018-01-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"garyzyr001/rethinking-airl","path":"airl/algo/sac.py","file_url":"https://github.com/garyzyr001/rethinking-airl/blob/HEAD/airl/algo/sac.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, garyzyr001/rethinking-airl when it was checked","code_sha256":"8dc0540b8dfe9b97","code_sha256_prefix":"8dc0540b8dfe9b97","mcp_get_code":{"code_sha256":"8dc0540b8dfe9b97"}},{"arxiv_id":"1801.01290","arxiv_id_is_arxiv":true,"paper":"/paper/soft-actor-critic-off-policy-maximum-entropy","title":"Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor","date":"2018-01-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MarsEleven/car_racer_RL","path":"sac/sac.py","file_url":"https://github.com/MarsEleven/car_racer_RL/blob/HEAD/sac/sac.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, MarsEleven/car_racer_RL when it was checked","code_sha256":"ace24484ab1d6b7f","code_sha256_prefix":"ace24484ab1d6b7f","mcp_get_code":{"code_sha256":"ace24484ab1d6b7f"}},{"arxiv_id":"1801.01290","arxiv_id_is_arxiv":true,"paper":"/paper/soft-actor-critic-off-policy-maximum-entropy","title":"Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor","date":"2018-01-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ajaysub110/rl-pytorch","path":"sac/models/soft_actor_critic.py","file_url":"https://github.com/ajaysub110/rl-pytorch/blob/HEAD/sac/models/soft_actor_critic.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, ajaysub110/rl-pytorch when it was checked","code_sha256":"54ab8d446018b958","code_sha256_prefix":"54ab8d446018b958","mcp_get_code":{"code_sha256":"54ab8d446018b958"}},{"arxiv_id":"1706.02275","arxiv_id_is_arxiv":true,"paper":"/paper/multi-agent-actor-critic-for-mixed","title":"Multi-Agent Actor-Critic for Mixed Cooperative-Competitive Environments","date":"2017-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Chan1998/MAAC","path":"algorithms/attention_sac.py","file_url":"https://github.com/Chan1998/MAAC/blob/HEAD/algorithms/attention_sac.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, Chan1998/MAAC (NOASSERTION)","code_sha256":"f36b207d39a0f07a","code_sha256_prefix":"f36b207d39a0f07a","mcp_get_code":{"code_sha256":"f36b207d39a0f07a"}},{"arxiv_id":"1706.02275","arxiv_id_is_arxiv":true,"paper":"/paper/multi-agent-actor-critic-for-mixed","title":"Multi-Agent Actor-Critic for Mixed Cooperative-Competitive Environments","date":"2017-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"isp1tze/MAProj","path":"algo/maddpg/maddpg_agent.py","file_url":"https://github.com/isp1tze/MAProj/blob/HEAD/algo/maddpg/maddpg_agent.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, isp1tze/MAProj when it was checked","code_sha256":"f0ba29ce2b116d79","code_sha256_prefix":"f0ba29ce2b116d79","mcp_get_code":{"code_sha256":"f0ba29ce2b116d79"}}],"record_sha256":"5346725b6fedd200769ab15c088c5eeb03a0bac06696b634136501288507cde9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}