{"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/forward-and-adapt","entry":"forward_and_adapt","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":15,"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":17,"n_samples_ran":12,"n_samples_fingerprinted":0,"n_places":21,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":9,"ran_fixture":0,"ran":3,"unverified":5},"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":"2604.15609","paper":"/paper/arxiv-2604-15609","title":"Adapting in the Dark: Efficient and Stable Test-Time Adaptation for Black-Box Models","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"yunbeizhang/BETA","path":"tta_library/beta.py","file_url":"https://github.com/yunbeizhang/BETA/blob/HEAD/tta_library/beta.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b8b53e25bbf6ad42","mcp_get_code":{"code_sha256":"b8b53e25bbf6ad42"}},{"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/tent.py","file_url":"https://github.com/JiahengDong/SETTA/blob/HEAD/TTAs/tent.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"96b3ed6720ba528c","mcp_get_code":{"code_sha256":"96b3ed6720ba528c"}},{"arxiv_id":"2506.07078","paper":"/paper/e-bats-efficient-backpropagation-free-test","title":"E-BATS: Efficient Backpropagation-Free Test-Time Adaptation for Speech Foundation Models","date":"2025-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JiahengDong/E-BATS","path":"TTAs-2/E-BATS.py","file_url":"https://github.com/JiahengDong/E-BATS/blob/HEAD/TTAs-2/E-BATS.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d986ac977d6f97d7","mcp_get_code":{"code_sha256":"d986ac977d6f97d7"}},{"arxiv_id":"2503.02616","paper":"/paper/smoothing-the-shift-towards-stable-test-time","title":"Smoothing the Shift: Towards Stable Test-Time Adaptation under Complex Multimodal Noises","date":"2025-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zrguo/sumi","path":"src/sumi.py","file_url":"https://github.com/zrguo/sumi/blob/HEAD/src/sumi.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"18f265b0e1d1f02f","mcp_get_code":{"code_sha256":"18f265b0e1d1f02f"}},{"arxiv_id":"2503.02616","paper":"/paper/smoothing-the-shift-towards-stable-test-time","title":"Smoothing the Shift: Towards Stable Test-Time Adaptation under Complex Multimodal Noises","date":"2025-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zrguo/sumi","path":"src/sumi.py","file_url":"https://github.com/zrguo/sumi/blob/HEAD/src/sumi.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7f787eed2caa543c","mcp_get_code":{"code_sha256":"7f787eed2caa543c"}},{"arxiv_id":"2408.13983","paper":"/paper/dual-path-adversarial-lifting-for-domain","title":"Dual-Path Adversarial Lifting for Domain Shift Correction in Online Test-time Adaptation","date":"2024-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yushuntang/dpal","path":"tent.py","file_url":"https://github.com/yushuntang/dpal/blob/HEAD/tent.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dbdbd9c45e96c572","mcp_get_code":{"code_sha256":"dbdbd9c45e96c572"}},{"arxiv_id":"2406.10737","paper":"/paper/dynamic-domains-dynamic-solutions-dpcore-for","title":"Dynamic Domains, Dynamic Solutions: DPCore for Continual Test-Time Adaptation","date":"2024-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zybeich/DPCore","path":"imagenet/tent.py","file_url":"https://github.com/zybeich/DPCore/blob/HEAD/imagenet/tent.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dae52c9027c48afd","mcp_get_code":{"code_sha256":"dae52c9027c48afd"}},{"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/ostta.py","file_url":"https://github.com/gaozhengqing/UniEnt/blob/HEAD/imagenet/ostta.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0b2d02a3e572ebdb","mcp_get_code":{"code_sha256":"0b2d02a3e572ebdb"}},{"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/tent.py","file_url":"https://github.com/gaozhengqing/UniEnt/blob/HEAD/imagenet/tent.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e792fe789fb94df3","mcp_get_code":{"code_sha256":"e792fe789fb94df3"}},{"arxiv_id":"2310.18562","paper":"/paper/optimization-free-test-time-adaptation-for","title":"Optimization-Free Test-Time Adaptation for Cross-Person Activity Recognition","date":"2023-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Claydon-Wang/OFTTA","path":"TTA/adapt_algorithm/oftta.py","file_url":"https://github.com/Claydon-Wang/OFTTA/blob/HEAD/TTA/adapt_algorithm/oftta.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0792ed73d94bcef9","mcp_get_code":{"code_sha256":"0792ed73d94bcef9"}},{"arxiv_id":"2308.06879","paper":"/paper/towards-open-set-test-time-adaptation","title":"Towards Open-Set Test-Time Adaptation Utilizing the Wisdom of Crowds in Entropy Minimization","date":"2023-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gaozhengqing/unient","path":"imagenet/ostta.py","file_url":"https://github.com/gaozhengqing/unient/blob/HEAD/imagenet/ostta.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"26cecc2ce04de52e","mcp_get_code":{"code_sha256":"26cecc2ce04de52e"}},{"arxiv_id":"2306.04344","paper":"/paper/vida-homeostatic-visual-domain-adapter-for","title":"ViDA: Homeostatic Visual Domain Adapter for Continual Test Time Adaptation","date":"2023-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangsenqiao/vida","path":"imagenet/tent.py","file_url":"https://github.com/yangsenqiao/vida/blob/HEAD/imagenet/tent.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dae52c9027c48afd","mcp_get_code":{"code_sha256":"dae52c9027c48afd"}},{"arxiv_id":"2110.10232","paper":"/paper/test-time-adaptation-through-perturbation","title":"Test time Adaptation through Perturbation Robustness","date":"2021-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"prabhuteja12/pest","path":"adaptation_methods/noise_robustness.py","file_url":"https://github.com/prabhuteja12/pest/blob/HEAD/adaptation_methods/noise_robustness.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b82f06e6139d5f59","mcp_get_code":{"code_sha256":"b82f06e6139d5f59"}},{"arxiv_id":"2110.10232","paper":"/paper/test-time-adaptation-through-perturbation","title":"Test time Adaptation through Perturbation Robustness","date":"2021-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"prabhuteja12/pest","path":"adaptation_methods/tent.py","file_url":"https://github.com/prabhuteja12/pest/blob/HEAD/adaptation_methods/tent.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b091215b926074c2","mcp_get_code":{"code_sha256":"b091215b926074c2"}},{"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/tent","path":"tent.py","file_url":"https://github.com/DequanWang/tent/blob/HEAD/tent.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dae52c9027c48afd","mcp_get_code":{"code_sha256":"dae52c9027c48afd"}},{"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":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"1d10e9bc70ce18a5","mcp_get_code":{"code_sha256":"1d10e9bc70ce18a5"}},{"arxiv_id":"2006.10726","paper":"/paper/fully-test-time-adaptation-by-entropy","title":"Tent: Fully Test-time Adaptation by Entropy Minimization","date":"2020-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DequanWang/tent","path":"tent.py","file_url":"https://github.com/DequanWang/tent/blob/HEAD/tent.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2471575c724b32c5","mcp_get_code":{"code_sha256":"2471575c724b32c5"}},{"arxiv_id":"2006.10726","paper":"/paper/fully-test-time-adaptation-by-entropy","title":"Tent: Fully Test-time Adaptation by Entropy Minimization","date":"2020-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DequanWang/tent","path":"tent.py","file_url":"https://github.com/DequanWang/tent/blob/HEAD/tent.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1d10e9bc70ce18a5","mcp_get_code":{"code_sha256":"1d10e9bc70ce18a5"}},{"arxiv_id":"2006.10726","paper":"/paper/fully-test-time-adaptation-by-entropy","title":"Tent: Fully Test-time Adaptation by Entropy Minimization","date":"2020-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mr-eggplant/eata","path":"tent.py","file_url":"https://github.com/mr-eggplant/eata/blob/HEAD/tent.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"5afe3f9d26c1b278","mcp_get_code":{"code_sha256":"5afe3f9d26c1b278"}},{"arxiv_id":"openreview_yMYRr00HFS","paper":null,"title":"arXiv:openreview_yMYRr00HFS","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"XLearning-SCU/2025-ICLR-TCR","path":"models/tta_baselines/tcr.py","file_url":"https://github.com/XLearning-SCU/2025-ICLR-TCR/blob/HEAD/models/tta_baselines/tcr.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":"8e45fbea284679e4","mcp_get_code":{"code_sha256":"8e45fbea284679e4"}},{"arxiv_id":"openreview_QYPKLGyz7K","paper":null,"title":"arXiv:openreview_QYPKLGyz7K","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"scienceliuc/SaTeen","path":"tent.py","file_url":"https://github.com/scienceliuc/SaTeen/blob/HEAD/tent.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"dbdbd9c45e96c572","mcp_get_code":{"code_sha256":"dbdbd9c45e96c572"}}]}