{"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/adam","entry":"adam","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":11,"n_papers_ran":2,"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":12,"n_samples_ran":3,"n_samples_fingerprinted":1,"n_places":12,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":1,"unverified":9},"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":"2306.10989","paper":"/paper/scaling-of-class-wise-training-losses-for","title":"Scaling of Class-wise Training Losses for Post-hoc Calibration","date":"2023-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SeungjinJung/SCTL","path":"models/optimizer.py","file_url":"https://github.com/SeungjinJung/SCTL/blob/HEAD/models/optimizer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"27010e72471f6c1d","mcp_get_code":{"code_sha256":"27010e72471f6c1d"}},{"arxiv_id":"2102.04032","paper":"/paper/one-qubit-as-a-universal-approximant","title":"One qubit as a Universal Approximant","date":null,"month_inferred_from_arxiv_id":"2021-02","title_source":"archive","repo":"UB-Quantic/Universal-Approximator","path":"ApproximantNN.py","file_url":"https://github.com/UB-Quantic/Universal-Approximator/blob/HEAD/ApproximantNN.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6c1ad4b8d315043c","mcp_get_code":{"code_sha256":"6c1ad4b8d315043c"}},{"arxiv_id":"2001.04032","paper":"/paper/popcorn-partially-observed-prediction","title":"POPCORN: Partially Observed Prediction COnstrained ReiNforcement Learning","date":"2020-01-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dtak/POPCORN-POMDP","path":"src/util.py","file_url":"https://github.com/dtak/POPCORN-POMDP/blob/HEAD/src/util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3f4c74055a033cb3","mcp_get_code":{"code_sha256":"3f4c74055a033cb3"}},{"arxiv_id":"1906.01235","paper":"/paper/universal-boosting-variational-inference","title":"Universal Boosting Variational Inference","date":"2019-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"trevorcampbell/ubvi","path":"ubvi/optimization/adam.py","file_url":"https://github.com/trevorcampbell/ubvi/blob/HEAD/ubvi/optimization/adam.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1a27b1d51a1493fc","mcp_get_code":{"code_sha256":"1a27b1d51a1493fc"}},{"arxiv_id":"1901.09136","paper":"/paper/graphical-model-based-estimation-and","title":"Graphical-model based estimation and inference for differential privacy","date":"2019-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"journalprivacyconfidentiality/private-pgm-jpc-778","path":"src/mbi/mixture_inference.py","file_url":"https://github.com/journalprivacyconfidentiality/private-pgm-jpc-778/blob/HEAD/src/mbi/mixture_inference.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"f2c4b2fa138db7d1","mcp_get_code":{"code_sha256":"f2c4b2fa138db7d1"}},{"arxiv_id":"1803.10123","paper":"/paper/task-agnostic-continual-learning-using-online","title":"Task Agnostic Continual Learning Using Online Variational Bayes","date":"2018-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"igolan/bgd","path":"optimizers_lib/optimizers_lib.py","file_url":"https://github.com/igolan/bgd/blob/HEAD/optimizers_lib/optimizers_lib.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e4de4e90f9014c20","mcp_get_code":{"code_sha256":"e4de4e90f9014c20"}},{"arxiv_id":"1802.09419","paper":"/paper/stochastic-hyperparameter-optimization","title":"Stochastic Hyperparameter Optimization through Hypernetworks","date":"2018-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lorraine2/hypernet-hypertraining","path":"code/optimizers.py","file_url":"https://github.com/lorraine2/hypernet-hypertraining/blob/HEAD/code/optimizers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ee2f9c951a3f0a07","mcp_get_code":{"code_sha256":"ee2f9c951a3f0a07"}},{"arxiv_id":"1703.04046","paper":"/paper/deepsleepnet-a-model-for-automatic-sleep","title":"DeepSleepNet: a Model for Automatic Sleep Stage Scoring based on Raw Single-Channel EEG","date":"2017-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UKBWorks/AccSleepNet","path":"deepsleep/optimize.py","file_url":"https://github.com/UKBWorks/AccSleepNet/blob/HEAD/deepsleep/optimize.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"2dead6ef52205bfa","mcp_get_code":{"code_sha256":"2dead6ef52205bfa"}},{"arxiv_id":"1509.09292","paper":"/paper/convolutional-networks-on-graphs-for-learning","title":"Convolutional Networks on Graphs for Learning Molecular Fingerprints","date":"2015-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HIPS/neural-fingerprint","path":"neuralfingerprint/optimizers.py","file_url":"https://github.com/HIPS/neural-fingerprint/blob/HEAD/neuralfingerprint/optimizers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c32ee9d8ca97ba6e","mcp_get_code":{"code_sha256":"c32ee9d8ca97ba6e"}},{"arxiv_id":"1412.6980","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":"navdeepkumar12/Tic","path":"nn.py","file_url":"https://github.com/navdeepkumar12/Tic/blob/HEAD/nn.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d617942446009de2","mcp_get_code":{"code_sha256":"d617942446009de2"}},{"arxiv_id":"1412.6980","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":"rokkian/adam_implementation","path":"adam_implementation.py","file_url":"https://github.com/rokkian/adam_implementation/blob/HEAD/adam_implementation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"da1304a720259f4d","mcp_get_code":{"code_sha256":"da1304a720259f4d"}},{"arxiv_id":"Young_Fully_Convolutional_Slice-to-Volume_Reconstruction_for_Single-Stack_MRI_CVPR_2024_paper","paper":null,"title":"arXiv:Young_Fully_Convolutional_Slice-to-Volume_Reconstruction_for_Single-Stack_MRI_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"seannz/svr","path":"models/optimizers.py","file_url":"https://github.com/seannz/svr/blob/HEAD/models/optimizers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"80b423441de4bfd7","mcp_get_code":{"code_sha256":"80b423441de4bfd7"}}]}