{"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/learning-rate-schedule","entry":"learning_rate_schedule","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":15,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":10,"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":12,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":9,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":4,"n_places":15,"n_places_pointer_only":2,"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":2,"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":"2509.24526","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-24526","title":"CMT: Mid-Training for Efficient Learning of Consistency, Mean Flow, and Flow Map Models","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"sony/cmt","path":"training/cmt_training_loop.py","file_url":"https://github.com/sony/cmt/blob/HEAD/training/cmt_training_loop.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"67f3d7aa67fc48b6","code_sha256_prefix":"67f3d7aa67fc48b6","mcp_get_code":{"code_sha256":"67f3d7aa67fc48b6"}},{"arxiv_id":"2506.14605","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-imaging-inverse-problems-with","title":"Unsupervised Imaging Inverse Problems with Diffusion Distribution Matching","date":"2025-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"inria-thoth/ddm4ip","path":"ddm4ip/losses/utils.py","file_url":"https://github.com/inria-thoth/ddm4ip/blob/HEAD/ddm4ip/losses/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"25a80a498e6efe47","code_sha256_prefix":"25a80a498e6efe47","mcp_get_code":{"code_sha256":"25a80a498e6efe47"}},{"arxiv_id":"2305.13607","arxiv_id_is_arxiv":true,"paper":"/paper/not-all-image-regions-matter-masked-vector-1","title":"Not All Image Regions Matter: Masked Vector Quantization for Autoregressive Image Generation","date":"2023-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"crossmodalgroup/maskedvectorquantization","path":"models/stage2/utils.py","file_url":"https://github.com/crossmodalgroup/maskedvectorquantization/blob/HEAD/models/stage2/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":"a7f95a154e8faecc","code_sha256_prefix":"a7f95a154e8faecc","mcp_get_code":{"code_sha256":"a7f95a154e8faecc"}},{"arxiv_id":"2305.12403","arxiv_id_is_arxiv":true,"paper":"/paper/spatio-temporal-diffusion-point-processes","title":"Spatio-temporal Diffusion Point Processes","date":"2023-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"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":"8b8f1350fd69b96d","code_sha256_prefix":"8b8f1350fd69b96d","mcp_get_code":{"code_sha256":"8b8f1350fd69b96d"}},{"arxiv_id":"2305.09652","arxiv_id_is_arxiv":true,"paper":"/paper/the-interpreter-understands-your-meaning-end","title":"The Interpreter Understands Your Meaning: End-to-end Spoken Language Understanding Aided by Speech Translation","date":"2023-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"idiap/translation-aided-slu","path":"models/model.py","file_url":"https://github.com/idiap/translation-aided-slu/blob/HEAD/models/model.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":"2ae3cdbae25787c9","code_sha256_prefix":"2ae3cdbae25787c9","mcp_get_code":{"code_sha256":"2ae3cdbae25787c9"}},{"arxiv_id":"2205.09723","arxiv_id_is_arxiv":true,"paper":"/paper/robust-and-efficient-medical-imaging-with","title":"Robust and Efficient Medical Imaging with Self-Supervision","date":"2022-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/medical-ai-research-foundations","path":"model_util.py","file_url":"https://github.com/google-research/medical-ai-research-foundations/blob/HEAD/model_util.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":"fb45bd9f63767265","code_sha256_prefix":"fb45bd9f63767265","mcp_get_code":{"code_sha256":"fb45bd9f63767265"}},{"arxiv_id":"2110.04175","arxiv_id_is_arxiv":true,"paper":"/paper/relaysum-for-decentralized-deep-learning-on","title":"RelaySum for Decentralized Deep Learning on Heterogeneous Data","date":"2021-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"epfml/relaysgd","path":"algorithms.py","file_url":"https://github.com/epfml/relaysgd/blob/HEAD/algorithms.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"74588f664a9fd301","code_sha256_prefix":"74588f664a9fd301","mcp_get_code":{"code_sha256":"74588f664a9fd301"}},{"arxiv_id":"2107.11228","arxiv_id_is_arxiv":true,"paper":"/paper/taxonomizing-local-versus-global-structure-in","title":"Taxonomizing local versus global structure in neural network loss landscapes","date":"2021-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nsfzyzz/loss_landscape_taxonomy","path":"workspace/src/code/Mode_connectivity.py","file_url":"https://github.com/nsfzyzz/loss_landscape_taxonomy/blob/HEAD/workspace/src/code/Mode_connectivity.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":"b72258e10ce08c1e","code_sha256_prefix":"b72258e10ce08c1e","mcp_get_code":{"code_sha256":"b72258e10ce08c1e"}},{"arxiv_id":"2011.04583","arxiv_id_is_arxiv":true,"paper":"/paper/neural-spatio-temporal-point-processes-1","title":"Neural Spatio-Temporal Point Processes","date":"2020-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/neural_stpp","path":"train_stpp.py","file_url":"https://github.com/facebookresearch/neural_stpp/blob/HEAD/train_stpp.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, facebookresearch/neural_stpp (NOASSERTION)","code_sha256":"8b8f1350fd69b96d","code_sha256_prefix":"8b8f1350fd69b96d","mcp_get_code":{"code_sha256":"8b8f1350fd69b96d"}},{"arxiv_id":"2006.10029","arxiv_id_is_arxiv":true,"paper":"/paper/big-self-supervised-models-are-strong-semi","title":"Big Self-Supervised Models are Strong Semi-Supervised Learners","date":"2020-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"serre-lab/prj_selfsup","path":"model/model_util.py","file_url":"https://github.com/serre-lab/prj_selfsup/blob/HEAD/model/model_util.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":"ea360af54446b02b","code_sha256_prefix":"ea360af54446b02b","mcp_get_code":{"code_sha256":"ea360af54446b02b"}},{"arxiv_id":"2006.05576","arxiv_id_is_arxiv":true,"paper":"/paper/demystifying-self-supervised-learning-an","title":"Self-supervised Learning from a Multi-view Perspective","date":"2020-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yaohungt/Demystifying_Self_Supervised_Learning","path":"CIFAR10/model_util.py","file_url":"https://github.com/yaohungt/Demystifying_Self_Supervised_Learning/blob/HEAD/CIFAR10/model_util.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":"fb45bd9f63767265","code_sha256_prefix":"fb45bd9f63767265","mcp_get_code":{"code_sha256":"fb45bd9f63767265"}},{"arxiv_id":"1911.08192","arxiv_id_is_arxiv":true,"paper":"/paper/information-theoretic-local-minima-1","title":"Information-Theoretic Local Minima Characterization and Regularization","date":"2019-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SeanJia/InfoMCR","path":"src/train_cifar10.py","file_url":"https://github.com/SeanJia/InfoMCR/blob/HEAD/src/train_cifar10.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":"1217c6df0212451f","code_sha256_prefix":"1217c6df0212451f","mcp_get_code":{"code_sha256":"1217c6df0212451f"}},{"arxiv_id":"1901.05555","arxiv_id_is_arxiv":true,"paper":"/paper/class-balanced-loss-based-on-effective-number","title":"Class-Balanced Loss Based on Effective Number of Samples","date":"2019-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"richardaecn/class-balanced-loss","path":"src/cifar_main.py","file_url":"https://github.com/richardaecn/class-balanced-loss/blob/HEAD/src/cifar_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":"10fc348fea580bf2","code_sha256_prefix":"10fc348fea580bf2","mcp_get_code":{"code_sha256":"10fc348fea580bf2"}},{"arxiv_id":"1802.10026","arxiv_id_is_arxiv":true,"paper":"/paper/loss-surfaces-mode-connectivity-and-fast","title":"Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNs","date":"2018-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tjwhitaker/prune-and-tune-ensembles","path":"src/utils.py","file_url":"https://github.com/tjwhitaker/prune-and-tune-ensembles/blob/HEAD/src/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1bdf337d2589e11b","code_sha256_prefix":"1bdf337d2589e11b","mcp_get_code":{"code_sha256":"1bdf337d2589e11b"}},{"arxiv_id":"aaai_20650","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_20650","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"IBM/UAE","path":"Unsupversied/simCLR/model_util.py","file_url":"https://github.com/IBM/UAE/blob/HEAD/Unsupversied/simCLR/model_util.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":"ea360af54446b02b","code_sha256_prefix":"ea360af54446b02b","mcp_get_code":{"code_sha256":"ea360af54446b02b"}}],"record_sha256":"967cd6bf5aff80acd061c3992eb831eabcde9bc46f5ef447d54e202944b59595","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}