{"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/setup-optimizer","entry":"setup_optimizer","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":11,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":4,"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":15,"n_samples_ran":12,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":4,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":16,"n_places_pointer_only":7,"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":4,"ran_fixture":0,"ran":8,"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":"2601.16240","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-16240","title":"Test-Time Adaptation for Speech Emotion Recognition","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"JiahengDong/SETTA","path":"TTAs/cea.py","file_url":"https://github.com/JiahengDong/SETTA/blob/HEAD/TTAs/cea.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":"0026cf99d3f77ea0","code_sha256_prefix":"0026cf99d3f77ea0","mcp_get_code":{"code_sha256":"0026cf99d3f77ea0"}},{"arxiv_id":"2601.16240","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-16240","title":"Test-Time Adaptation for Speech Emotion Recognition","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"JiahengDong/SETTA","path":"TTAs/suta.py","file_url":"https://github.com/JiahengDong/SETTA/blob/HEAD/TTAs/suta.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":"268ac794d7a49485","code_sha256_prefix":"268ac794d7a49485","mcp_get_code":{"code_sha256":"268ac794d7a49485"}},{"arxiv_id":"2408.11778","arxiv_id_is_arxiv":true,"paper":"/paper/sum-of-squares-circuits","title":"Sum of Squares Circuits","date":"2024-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anon-npc/squared-npcs","path":"src/pcs/optimizers.py","file_url":"https://github.com/anon-npc/squared-npcs/blob/HEAD/src/pcs/optimizers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, anon-npc/squared-npcs, is not in the permissive set Syntology serves inline","code_sha256":"d5335bb3b5b07df3","code_sha256_prefix":"d5335bb3b5b07df3","mcp_get_code":{"code_sha256":"d5335bb3b5b07df3"}},{"arxiv_id":"2405.00754","arxiv_id_is_arxiv":true,"paper":"/paper/clipartt-light-weight-adaptation-of-clip-to","title":"CLIPArTT: Adaptation of CLIP to New Domains at Test Time","date":"2024-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dosowiechi/clipartt","path":"adapt.py","file_url":"https://github.com/dosowiechi/clipartt/blob/HEAD/adapt.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, dosowiechi/clipartt when it was checked","code_sha256":"b3a7110b4cd7c335","code_sha256_prefix":"b3a7110b4cd7c335","mcp_get_code":{"code_sha256":"b3a7110b4cd7c335"}},{"arxiv_id":"2311.14402","arxiv_id_is_arxiv":true,"paper":"/paper/tea-test-time-energy-adaptation","title":"TEA: Test-time Energy Adaptation","date":"2023-11-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuanyige/tea","path":"core/optim.py","file_url":"https://github.com/yuanyige/tea/blob/HEAD/core/optim.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, yuanyige/tea when it was checked","code_sha256":"b0b20bfb6ab94443","code_sha256_prefix":"b0b20bfb6ab94443","mcp_get_code":{"code_sha256":"b0b20bfb6ab94443"}},{"arxiv_id":"2310.09505","arxiv_id_is_arxiv":true,"paper":"/paper/advancing-test-time-adaptation-for-acoustic","title":"Advancing Test-Time Adaptation in Wild Acoustic Test Settings","date":"2023-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Waffle-Liu/CEA","path":"utils.py","file_url":"https://github.com/Waffle-Liu/CEA/blob/HEAD/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":"f5679e2c4c24ad92","code_sha256_prefix":"f5679e2c4c24ad92","mcp_get_code":{"code_sha256":"f5679e2c4c24ad92"}},{"arxiv_id":"2307.16847","arxiv_id_is_arxiv":true,"paper":"/paper/latent-masking-for-multimodal-self-supervised","title":"CroSSL: Cross-modal Self-Supervised Learning for Time-series through Latent Masking","date":"2023-07-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dr-bell/crossl","path":"src/trainer.py","file_url":"https://github.com/dr-bell/crossl/blob/HEAD/src/trainer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause-Clear","inline_ok":false,"inline_ok_link":false,"withheld_clause":"BSD-3-Clause-Clear, as GitHub detects it on this paper's repository, dr-bell/crossl, is not in the permissive set Syntology serves inline","code_sha256":"fafece7b03bd514d","code_sha256_prefix":"fafece7b03bd514d","mcp_get_code":{"code_sha256":"fafece7b03bd514d"}},{"arxiv_id":"2212.12749","arxiv_id_is_arxiv":true,"paper":"/paper/deep-latent-state-space-models-for-time","title":"Deep Latent State Space Models for Time-Series Generation","date":"2022-12-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alexzhou907/ls4","path":"train_monash.py","file_url":"https://github.com/alexzhou907/ls4/blob/HEAD/train_monash.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"aab83273893c15bf","code_sha256_prefix":"aab83273893c15bf","mcp_get_code":{"code_sha256":"aab83273893c15bf"}},{"arxiv_id":"2110.13561","arxiv_id_is_arxiv":true,"paper":"/paper/non-gaussian-gaussian-processes-for-few-shot","title":"Non-Gaussian Gaussian Processes for Few-Shot Regression","date":"2021-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gmum/non-gaussian-gaussian-processes","path":"run_regression.py","file_url":"https://github.com/gmum/non-gaussian-gaussian-processes/blob/HEAD/run_regression.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, gmum/non-gaussian-gaussian-processes when it was checked","code_sha256":"15f25f7c444028b2","code_sha256_prefix":"15f25f7c444028b2","mcp_get_code":{"code_sha256":"15f25f7c444028b2"}},{"arxiv_id":"2005.09921","arxiv_id_is_arxiv":true,"paper":"/paper/end-to-end-speaker-diarization-for-an-unknown","title":"End-to-End Speaker Diarization for an Unknown Number of Speakers with Encoder-Decoder Based Attractors","date":"2020-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"butspeechfit/diacorrect","path":"diacorrect/backend/updater.py","file_url":"https://github.com/butspeechfit/diacorrect/blob/HEAD/diacorrect/backend/updater.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":"75294dcc89fb7683","code_sha256_prefix":"75294dcc89fb7683","mcp_get_code":{"code_sha256":"75294dcc89fb7683"}},{"arxiv_id":"1911.07164","arxiv_id_is_arxiv":true,"paper":"/paper/meta-reinforced-synthetic-data-for-one-shot-1","title":"Meta-Reinforced Synthetic Data for One-Shot Fine-Grained Visual Recognition","date":"2019-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"apple2373/MetaIRNet","path":"generate_images.py","file_url":"https://github.com/apple2373/MetaIRNet/blob/HEAD/generate_images.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, apple2373/MetaIRNet when it was checked","code_sha256":"67a68e72d4d2ea90","code_sha256_prefix":"67a68e72d4d2ea90","mcp_get_code":{"code_sha256":"67a68e72d4d2ea90"}},{"arxiv_id":"1901.09732","arxiv_id_is_arxiv":true,"paper":"/paper/making-deep-q-learning-methods-robust-to-time","title":"Making Deep Q-learning methods robust to time discretization","date":"2019-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ctallec/continuous-rl","path":"code/optimizer.py","file_url":"https://github.com/ctallec/continuous-rl/blob/HEAD/code/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":"a8989b4bdc4d5c51","code_sha256_prefix":"a8989b4bdc4d5c51","mcp_get_code":{"code_sha256":"a8989b4bdc4d5c51"}},{"arxiv_id":"1803.10122","arxiv_id_is_arxiv":true,"paper":"/paper/world-models","title":"World Models","date":"2018-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neuroevolution-ai/ProcgenAutoencoder","path":"autoencoder_training.py","file_url":"https://github.com/neuroevolution-ai/ProcgenAutoencoder/blob/HEAD/autoencoder_training.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":"2216d05b615869fb","code_sha256_prefix":"2216d05b615869fb","mcp_get_code":{"code_sha256":"2216d05b615869fb"}},{"arxiv_id":"1611.07865","arxiv_id_is_arxiv":true,"paper":"/paper/controlling-perceptual-factors-in-neural","title":"Controlling Perceptual Factors in Neural Style Transfer","date":"2016-11-23","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":"8b4b191945066d1a","code_sha256_prefix":"8b4b191945066d1a","mcp_get_code":{"code_sha256":"8b4b191945066d1a"}},{"arxiv_id":"1508.06576","arxiv_id_is_arxiv":true,"paper":"/paper/a-neural-algorithm-of-artistic-style","title":"A Neural Algorithm of Artistic Style","date":"2015-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ProGamerGov/neural-style-pt","path":"neural_style.py","file_url":"https://github.com/ProGamerGov/neural-style-pt/blob/HEAD/neural_style.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":"8b4b191945066d1a","code_sha256_prefix":"8b4b191945066d1a","mcp_get_code":{"code_sha256":"8b4b191945066d1a"}},{"arxiv_id":"2023.findings-emnlp.761","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.findings-emnlp.761","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"YaooXu/Q2T","path":"ssl-relation-prediction/src/utils.py","file_url":"https://github.com/YaooXu/Q2T/blob/HEAD/ssl-relation-prediction/src/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":"65723913a33ffde3","code_sha256_prefix":"65723913a33ffde3","mcp_get_code":{"code_sha256":"65723913a33ffde3"}}],"record_sha256":"056cbd8e1f318b1d56efc39387746cd9e62e7d0c1c490bf09042fd11fedbc928","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}