{"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/configure-model","entry":"configure_model","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":14,"n_papers_ran":11,"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":13,"n_samples_ran":7,"n_samples_fingerprinted":0,"n_places":18,"n_places_pointer_only":7,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":4,"ran_fixture":0,"ran":3,"unverified":6},"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","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/awmc.py","file_url":"https://github.com/JiahengDong/SETTA/blob/HEAD/TTAs/awmc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cba1227868760f74","mcp_get_code":{"code_sha256":"cba1227868760f74"}},{"arxiv_id":"2601.16240","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/foa.py","file_url":"https://github.com/JiahengDong/SETTA/blob/HEAD/TTAs/foa.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9a2691d3cbcb8ac5","mcp_get_code":{"code_sha256":"9a2691d3cbcb8ac5"}},{"arxiv_id":"2601.16240","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/lame.py","file_url":"https://github.com/JiahengDong/SETTA/blob/HEAD/TTAs/lame.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1e2bf759e443d20d","mcp_get_code":{"code_sha256":"1e2bf759e443d20d"}},{"arxiv_id":"2601.16240","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/t3a.py","file_url":"https://github.com/JiahengDong/SETTA/blob/HEAD/TTAs/t3a.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"909ab68fbaa4f281","mcp_get_code":{"code_sha256":"909ab68fbaa4f281"}},{"arxiv_id":"2510.22127","paper":"/paper/arxiv-2510-22127","title":"Mint: A Simple Test-Time Adaptation of Vision-Language Models against Common Corruptions","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"baowenxuan/Mint","path":"src/methods/utils.py","file_url":"https://github.com/baowenxuan/Mint/blob/HEAD/src/methods/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f0706a15b36dcf6a","mcp_get_code":{"code_sha256":"f0706a15b36dcf6a"}},{"arxiv_id":"2505.16860","paper":"/paper/gcal-adapting-graph-models-to-evolving-domain","title":"GCAL: Adapting Graph Models to Evolving Domain Shifts","date":"2025-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joe817/gcal","path":"GCAL.py","file_url":"https://github.com/joe817/gcal/blob/HEAD/GCAL.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8541b1126f4f1e8f","mcp_get_code":{"code_sha256":"8541b1126f4f1e8f"}},{"arxiv_id":"2407.09498","paper":"/paper/ot-vp-optimal-transport-guided-visual","title":"OT-VP: Optimal Transport-guided Visual Prompting for Test-Time Adaptation","date":"2024-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zybeich/ot-vp","path":"domainbed/adapt_algorithms.py","file_url":"https://github.com/zybeich/ot-vp/blob/HEAD/domainbed/adapt_algorithms.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"09762c09de098b26","mcp_get_code":{"code_sha256":"09762c09de098b26"}},{"arxiv_id":"2405.16486","paper":"/paper/decomposing-the-neurons-activation-sparsity","title":"Decomposing the Neurons: Activation Sparsity via Mixture of Experts for Continual Test Time Adaptation","date":"2024-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"royzry98/moase-pytorch","path":"norm.py","file_url":"https://github.com/royzry98/moase-pytorch/blob/HEAD/norm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8f537ee8d4a9b397","mcp_get_code":{"code_sha256":"8f537ee8d4a9b397"}},{"arxiv_id":"2404.06065","paper":"/paper/unified-entropy-optimization-for-open-set","title":"Unified Entropy Optimization for Open-Set Test-Time Adaptation","date":"2024-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gaozhengqing/UniEnt","path":"imagenet/norm.py","file_url":"https://github.com/gaozhengqing/UniEnt/blob/HEAD/imagenet/norm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8f537ee8d4a9b397","mcp_get_code":{"code_sha256":"8f537ee8d4a9b397"}},{"arxiv_id":"2311.14402","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/adazoo/norm.py","file_url":"https://github.com/yuanyige/tea/blob/HEAD/core/adazoo/norm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8f537ee8d4a9b397","mcp_get_code":{"code_sha256":"8f537ee8d4a9b397"}},{"arxiv_id":"2311.14402","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/param.py","file_url":"https://github.com/yuanyige/tea/blob/HEAD/core/param.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"16a89171a04c1ac1","mcp_get_code":{"code_sha256":"16a89171a04c1ac1"}},{"arxiv_id":"2310.19011","paper":"/paper/efficient-test-time-adaptation-for-super-1","title":"Efficient Test-Time Adaptation for Super-Resolution with Second-Order Degradation and Reconstruction","date":"2023-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DengZeshuai/SRTTA","path":"src/srtta.py","file_url":"https://github.com/DengZeshuai/SRTTA/blob/HEAD/src/srtta.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d06f6abb54aaa2af","mcp_get_code":{"code_sha256":"d06f6abb54aaa2af"}},{"arxiv_id":"2207.10792","paper":"/paper/test-time-adaptation-via-self-training-with","title":"Test-Time Adaptation via Self-Training with Nearest Neighbor Information","date":"2022-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mingukjang/tast","path":"domainbed/adapt_algorithms.py","file_url":"https://github.com/mingukjang/tast/blob/HEAD/domainbed/adapt_algorithms.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"09762c09de098b26","mcp_get_code":{"code_sha256":"09762c09de098b26"}},{"arxiv_id":"2207.09640","paper":"/paper/test-time-adaptation-via-conjugate-pseudo","title":"Test-Time Adaptation via Conjugate Pseudo-labels","date":"2022-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"locuslab/tta_conjugate","path":"cifar_tta_test.py","file_url":"https://github.com/locuslab/tta_conjugate/blob/HEAD/cifar_tta_test.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3f2dcd69307df74d","mcp_get_code":{"code_sha256":"3f2dcd69307df74d"}},{"arxiv_id":"2206.15476","paper":"/paper/anoshift-a-distribution-shift-benchmark-for","title":"AnoShift: A Distribution Shift Benchmark for Unsupervised Anomaly Detection","date":"2022-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bit-ml/anoshift","path":"language_models/model_utils.py","file_url":"https://github.com/bit-ml/anoshift/blob/HEAD/language_models/model_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"5a538b08c1e8471b","mcp_get_code":{"code_sha256":"5a538b08c1e8471b"}},{"arxiv_id":"2203.05574","paper":"/paper/on-the-fly-test-time-adaptation-for-medical","title":"On-the-Fly Test-time Adaptation for Medical Image Segmentation","date":"2022-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jeya-maria-jose/on-the-fly-adaptation","path":"val_adaptiveunet.py","file_url":"https://github.com/jeya-maria-jose/on-the-fly-adaptation/blob/HEAD/val_adaptiveunet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0e62e898cf223451","mcp_get_code":{"code_sha256":"0e62e898cf223451"}},{"arxiv_id":"2111.12853","paper":"/paper/amortized-prompt-lightweight-fine-tuning-for","title":"Domain Prompt Learning for Efficiently Adapting CLIP to Unseen Domains","date":"2021-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shogi880/DPLCLIP","path":"domainbed/adapt_algorithms.py","file_url":"https://github.com/shogi880/DPLCLIP/blob/HEAD/domainbed/adapt_algorithms.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"09762c09de098b26","mcp_get_code":{"code_sha256":"09762c09de098b26"}},{"arxiv_id":"2105.08714","paper":"/paper/fighting-gradients-with-gradients-dynamic","title":"Fighting Gradients with Gradients: Dynamic Defenses against Adversarial Attacks","date":"2021-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DequanWang/dent","path":"norm.py","file_url":"https://github.com/DequanWang/dent/blob/HEAD/norm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8f537ee8d4a9b397","mcp_get_code":{"code_sha256":"8f537ee8d4a9b397"}}]}