{"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/adam-2","entry":"Adam","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":7,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"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":10,"n_samples_ran":7,"n_samples_constructed":5,"n_samples_ran_checked":7,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":4,"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":7,"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":"2406.12649","arxiv_id_is_arxiv":true,"paper":"/paper/probabilistic-conceptual-explainers","title":"Probabilistic Conceptual Explainers: Trustworthy Conceptual Explanations for Vision Foundation Models","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Wang-ML-Lab/interpretable-foundation-models","path":"PACE/src/model.py","file_url":"https://github.com/Wang-ML-Lab/interpretable-foundation-models/blob/HEAD/PACE/src/model.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, Wang-ML-Lab/interpretable-foundation-models when it was checked","code_sha256":"53ce46e55205efc8","code_sha256_prefix":"53ce46e55205efc8","mcp_get_code":{"code_sha256":"53ce46e55205efc8"}},{"arxiv_id":"2405.01615","arxiv_id_is_arxiv":true,"paper":"/paper/hard-thresholding-meets-evolution-strategies","title":"Hard-Thresholding Meets Evolution Strategies in Reinforcement Learning","date":"2024-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cangcn/NES-HT","path":"NES.py","file_url":"https://github.com/cangcn/NES-HT/blob/HEAD/NES.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, cangcn/NES-HT when it was checked","code_sha256":"5d018203b687bdd6","code_sha256_prefix":"5d018203b687bdd6","mcp_get_code":{"code_sha256":"5d018203b687bdd6"}},{"arxiv_id":"2308.04073","arxiv_id_is_arxiv":true,"paper":"/paper/learning-specialized-activation-functions-for","title":"Learning Specialized Activation Functions for Physics-informed Neural Networks","date":"2023-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leaplabthu/adaafforpinns","path":"source/choose_optimizer.py","file_url":"https://github.com/leaplabthu/adaafforpinns/blob/HEAD/source/choose_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, leaplabthu/adaafforpinns when it was checked","code_sha256":"9962b7f1cb6fc33c","code_sha256_prefix":"9962b7f1cb6fc33c","mcp_get_code":{"code_sha256":"9962b7f1cb6fc33c"}},{"arxiv_id":"2207.11368","arxiv_id_is_arxiv":true,"paper":"/paper/neural-sim-learning-to-generate-training-data","title":"Neural-Sim: Learning to Generate Training Data with NeRF","date":"2022-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gyhandy/Neural-Sim-NeRF","path":"optimization/neural_sim_main.py","file_url":"https://github.com/gyhandy/Neural-Sim-NeRF/blob/HEAD/optimization/neural_sim_main.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":"9fbeb5525d1cd232","code_sha256_prefix":"9fbeb5525d1cd232","mcp_get_code":{"code_sha256":"9fbeb5525d1cd232"}},{"arxiv_id":"2103.07113","arxiv_id_is_arxiv":true,"paper":"/paper/training-networks-in-null-space-of-covariance","title":"Training Networks in Null Space of Feature Covariance for Continual Learning","date":"2021-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShipengWang/Adam-NSCL","path":"optim/adam_svd.py","file_url":"https://github.com/ShipengWang/Adam-NSCL/blob/HEAD/optim/adam_svd.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":"8171798fa8ce14c8","code_sha256_prefix":"8171798fa8ce14c8","mcp_get_code":{"code_sha256":"8171798fa8ce14c8"}},{"arxiv_id":"1711.05101","arxiv_id_is_arxiv":true,"paper":"/paper/decoupled-weight-decay-regularization","title":"Decoupled Weight Decay Regularization","date":"2017-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JakobHavtorn/nn","path":"optim/adam.py","file_url":"https://github.com/JakobHavtorn/nn/blob/HEAD/optim/adam.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":"ba570ad7fc7fc941","code_sha256_prefix":"ba570ad7fc7fc941","mcp_get_code":{"code_sha256":"ba570ad7fc7fc941"}},{"arxiv_id":"1412.6980","arxiv_id_is_arxiv":true,"paper":"/paper/adam-a-method-for-stochastic-optimization","title":"Adam: A Method for Stochastic Optimization","date":"2014-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nnaisense/pgpelib","path":"pgpelib/optimizers.py","file_url":"https://github.com/nnaisense/pgpelib/blob/HEAD/pgpelib/optimizers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7f2c925da971c0b5","code_sha256_prefix":"7f2c925da971c0b5","mcp_get_code":{"code_sha256":"7f2c925da971c0b5"}},{"arxiv_id":"1412.6980","arxiv_id_is_arxiv":true,"paper":"/paper/adam-a-method-for-stochastic-optimization","title":"Adam: A Method for Stochastic Optimization","date":"2014-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MaximeVandegar/Papers-in-100-Lines-of-Code","path":"Adam_a_Method_For_Stochastic_Optimization/adam.py","file_url":"https://github.com/MaximeVandegar/Papers-in-100-Lines-of-Code/blob/HEAD/Adam_a_Method_For_Stochastic_Optimization/adam.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":"cbb1359e9a11e474","code_sha256_prefix":"cbb1359e9a11e474","mcp_get_code":{"code_sha256":"cbb1359e9a11e474"}},{"arxiv_id":"1412.6980","arxiv_id_is_arxiv":true,"paper":"/paper/adam-a-method-for-stochastic-optimization","title":"Adam: A Method for Stochastic Optimization","date":"2014-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vpj/jax_transformer","path":"transformer.py","file_url":"https://github.com/vpj/jax_transformer/blob/HEAD/transformer.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, vpj/jax_transformer when it was checked","code_sha256":"c48006199ed3e050","code_sha256_prefix":"c48006199ed3e050","mcp_get_code":{"code_sha256":"c48006199ed3e050"}},{"arxiv_id":"1412.6980","arxiv_id_is_arxiv":true,"paper":"/paper/adam-a-method-for-stochastic-optimization","title":"Adam: A Method for Stochastic Optimization","date":"2014-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"labmlai/annotated_deep_learning_paper_implementations","path":"labml_nn/optimizers/adam.py","file_url":"https://github.com/labmlai/annotated_deep_learning_paper_implementations/blob/HEAD/labml_nn/optimizers/adam.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":"10c32bb6eaf9662a","code_sha256_prefix":"10c32bb6eaf9662a","mcp_get_code":{"code_sha256":"10c32bb6eaf9662a"}}],"record_sha256":"9af516992a09e2e061e79f0f4f5ee70374dbbcdf86c4c063c41fb2fa1104e29f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}