{"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/configure-optimizers","entry":"configure_optimizers","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":9,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":5,"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":8,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":5,"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":5,"unverified":3},"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":"2409.19660","arxiv_id_is_arxiv":true,"paper":"/paper/all-in-one-image-coding-for-joint-human","title":"All-in-One Image Coding for Joint Human-Machine Vision with Multi-Path Aggregation","date":"2024-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"njuvision/mpa","path":"examples/train_stage1_wo_gan.py","file_url":"https://github.com/njuvision/mpa/blob/HEAD/examples/train_stage1_wo_gan.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, njuvision/mpa (NOASSERTION)","code_sha256":"07013938ed5a3d55","code_sha256_prefix":"07013938ed5a3d55","mcp_get_code":{"code_sha256":"07013938ed5a3d55"}},{"arxiv_id":"2409.02980","arxiv_id_is_arxiv":true,"paper":"/paper/how-dreams-are-made-emulating-satellite","title":"How DREAMS are made: Emulating Satellite Galaxy and Subhalo Populations with Diffusion Models and Point Clouds","date":"2024-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"trivnguyen/nehod_torch","path":"nehod/train_utils.py","file_url":"https://github.com/trivnguyen/nehod_torch/blob/HEAD/nehod/train_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":"6a0e2da74509a75d","code_sha256_prefix":"6a0e2da74509a75d","mcp_get_code":{"code_sha256":"6a0e2da74509a75d"}},{"arxiv_id":"2408.12578","arxiv_id_is_arxiv":true,"paper":"/paper/a-percolation-model-of-emergence-analyzing","title":"A Percolation Model of Emergence: Analyzing Transformers Trained on a Formal Language","date":"2024-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ekdeepslubana/conceptpercolation","path":"utils/optimizer.py","file_url":"https://github.com/ekdeepslubana/conceptpercolation/blob/HEAD/utils/optimizer.py","status":"ran","verification_level":1,"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, ekdeepslubana/conceptpercolation when it was checked","code_sha256":"58b140e77a3c276d","code_sha256_prefix":"58b140e77a3c276d","mcp_get_code":{"code_sha256":"58b140e77a3c276d"}},{"arxiv_id":"2407.12538","arxiv_id_is_arxiv":true,"paper":"/paper/high-frequency-matters-uncertainty-guided","title":"High Frequency Matters: Uncertainty Guided Image Compression with Wavelet Diffusion","date":"2024-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hejiaxiang1/wavelet-diffusion","path":"train_wavelet.py","file_url":"https://github.com/hejiaxiang1/wavelet-diffusion/blob/HEAD/train_wavelet.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, hejiaxiang1/wavelet-diffusion when it was checked","code_sha256":"ec336cdefdf0fa3b","code_sha256_prefix":"ec336cdefdf0fa3b","mcp_get_code":{"code_sha256":"ec336cdefdf0fa3b"}},{"arxiv_id":"2308.16258","arxiv_id_is_arxiv":true,"paper":"/paper/robust-principles-architectural-design","title":"Robust Principles: Architectural Design Principles for Adversarially Robust CNNs","date":"2023-08-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"poloclub/robust-principles","path":"robustarch/utils.py","file_url":"https://github.com/poloclub/robust-principles/blob/HEAD/robustarch/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":"8a34bfd2e4db1dbf","code_sha256_prefix":"8a34bfd2e4db1dbf","mcp_get_code":{"code_sha256":"8a34bfd2e4db1dbf"}},{"arxiv_id":"2301.03110","arxiv_id_is_arxiv":true,"paper":"/paper/robarch-designing-robust-architectures","title":"RobArch: Designing Robust Architectures against Adversarial Attacks","date":"2023-01-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shengyun-peng/robarch","path":"robustarch/utils.py","file_url":"https://github.com/shengyun-peng/robarch/blob/HEAD/robustarch/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":"d9f8f64596cdbaa7","code_sha256_prefix":"d9f8f64596cdbaa7","mcp_get_code":{"code_sha256":"d9f8f64596cdbaa7"}},{"arxiv_id":"2210.00094","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-weight-decay-on-the-fly-weight-decay","title":"Improving Robustness with Adaptive Weight Decay","date":"2022-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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":"c8b9bade517b7115","code_sha256_prefix":"c8b9bade517b7115","mcp_get_code":{"code_sha256":"c8b9bade517b7115"}},{"arxiv_id":"2005.14165","arxiv_id_is_arxiv":true,"paper":"/paper/language-models-are-few-shot-learners","title":"Language Models are Few-Shot Learners","date":"2020-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ramanakshay/nanogpt","path":"src/algorithm/optimizer.py","file_url":"https://github.com/ramanakshay/nanogpt/blob/HEAD/src/algorithm/optimizer.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":"451bc0edacfc317d","code_sha256_prefix":"451bc0edacfc317d","mcp_get_code":{"code_sha256":"451bc0edacfc317d"}},{"arxiv_id":"1907.08931","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-weight-decay-for-deep-neural","title":"Adaptive Weight Decay for Deep Neural Networks","date":"2019-07-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hed-ucas/alphadecay","path":"LLaMa-pretraining/torchrun_main.py","file_url":"https://github.com/hed-ucas/alphadecay/blob/HEAD/LLaMa-pretraining/torchrun_main.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, hed-ucas/alphadecay when it was checked","code_sha256":"c8b9bade517b7115","code_sha256_prefix":"c8b9bade517b7115","mcp_get_code":{"code_sha256":"c8b9bade517b7115"}}],"record_sha256":"cd1aeea06cb441fc3e38e8303c60222f0211516d2e6bbe4e0b223cbde6047178","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}