{"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/softmax-entropy","entry":"softmax_entropy","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":54,"n_papers_ran":52,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":45,"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":34,"n_samples_ran":32,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":25,"n_samples_unverified":2,"n_samples_fingerprinted":12,"n_places":71,"n_places_pointer_only":42,"n_places_pointer_only_link_open":11,"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":1,"ran_violates":1,"ran_draft_wrong":8,"ran_fixture":17,"ran":5,"unverified":2},"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":"2606.22914","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-22914","title":"PromptDyG: Test-Time Prompt Adaptation on Dynamic Graphs","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"mala-lab/PromptDyG","path":"PromptDyG.py","file_url":"https://github.com/mala-lab/PromptDyG/blob/HEAD/PromptDyG.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, mala-lab/PromptDyG when it was checked","code_sha256":"91c9b17caed9c461","code_sha256_prefix":"91c9b17caed9c461","mcp_get_code":{"code_sha256":"91c9b17caed9c461"}},{"arxiv_id":"2605.17743","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-17743","title":"MoASE++: Mixture of Activation Sparsity Experts with Domain-Adaptive On-policy Distillation for Continual Test Time Adaptation","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"RoyZry98/MoASE-Pytorch","path":"cotta_vit_opd.py","file_url":"https://github.com/RoyZry98/MoASE-Pytorch/blob/HEAD/cotta_vit_opd.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, RoyZry98/MoASE-Pytorch when it was checked","code_sha256":"6aa4e7aea80769c7","code_sha256_prefix":"6aa4e7aea80769c7","mcp_get_code":{"code_sha256":"6aa4e7aea80769c7"}},{"arxiv_id":"2604.21728","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-21728","title":"Ramen: Robust Test-Time Adaptation of Vision-Language Models with Active Sample Selection","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"baowenxuan/Ramen","path":"src/methods/losses.py","file_url":"https://github.com/baowenxuan/Ramen/blob/HEAD/src/methods/losses.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, baowenxuan/Ramen when it was checked","code_sha256":"4a0cb945bd6d86fa","code_sha256_prefix":"4a0cb945bd6d86fa","mcp_get_code":{"code_sha256":"4a0cb945bd6d86fa"}},{"arxiv_id":"2604.15609","arxiv_id_is_arxiv":true,"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_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"99c9d70a0d3706d9","code_sha256_prefix":"99c9d70a0d3706d9","mcp_get_code":{"code_sha256":"99c9d70a0d3706d9"}},{"arxiv_id":"2604.15494","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-15494","title":"ICLR 2026 Test-Time Updates (TTU) Workshop PROTOTTA: PROTOTYPE-GUIDED TEST-TIME ADAPTATION","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"DeepRCL/ProtoTTA","path":"ProtoPFormer/proto_tta.py","file_url":"https://github.com/DeepRCL/ProtoTTA/blob/HEAD/ProtoPFormer/proto_tta.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, DeepRCL/ProtoTTA when it was checked","code_sha256":"9ccab176a6977060","code_sha256_prefix":"9ccab176a6977060","mcp_get_code":{"code_sha256":"9ccab176a6977060"}},{"arxiv_id":"2603.14254","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-14254","title":"ZOTTA: Test-Time Adaptation with Gradient-Free Zeroth-Order Optimization","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"Zhang-Ronghao/zotta","path":"tta_library/zotta.py","file_url":"https://github.com/Zhang-Ronghao/zotta/blob/HEAD/tta_library/zotta.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1bdb21f20be90a8f","code_sha256_prefix":"1bdb21f20be90a8f","mcp_get_code":{"code_sha256":"1bdb21f20be90a8f"}},{"arxiv_id":"2602.03292","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-03292","title":"A3-TTA: Adaptive Anchor Alignment Test-Time Adaptation for Image Segmentation","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"HiLab-git/A3-TTA","path":"a3_tta.py","file_url":"https://github.com/HiLab-git/A3-TTA/blob/HEAD/a3_tta.py","status":"unverified","verification_level":0,"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, HiLab-git/A3-TTA when it was checked","code_sha256":"3e869ad77e4775a0","code_sha256_prefix":"3e869ad77e4775a0","mcp_get_code":{"code_sha256":"3e869ad77e4775a0"}},{"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/sar.py","file_url":"https://github.com/JiahengDong/SETTA/blob/HEAD/TTAs/sar.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from Feliciaxyao/ICML2024-FSTTA, and GitHub detected no licence in that repository when it was checked","code_sha256":"3078648c75e3e1e3","code_sha256_prefix":"3078648c75e3e1e3","mcp_get_code":{"code_sha256":"3078648c75e3e1e3"}},{"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/foa.py","file_url":"https://github.com/JiahengDong/SETTA/blob/HEAD/TTAs/foa.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from JiahengDong/E-BATS, and GitHub detected no licence in that repository when it was checked","code_sha256":"c549267af6d34f9a","code_sha256_prefix":"c549267af6d34f9a","mcp_get_code":{"code_sha256":"c549267af6d34f9a"}},{"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/cotta.py","file_url":"https://github.com/JiahengDong/SETTA/blob/HEAD/TTAs/cotta.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e589e47d748af885","code_sha256_prefix":"e589e47d748af885","mcp_get_code":{"code_sha256":"e589e47d748af885"}},{"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/eata.py","file_url":"https://github.com/JiahengDong/SETTA/blob/HEAD/TTAs/eata.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7b9d88d29b50aca6","code_sha256_prefix":"7b9d88d29b50aca6","mcp_get_code":{"code_sha256":"7b9d88d29b50aca6"}},{"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":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b6d31fd70bcd9c4b","code_sha256_prefix":"b6d31fd70bcd9c4b","mcp_get_code":{"code_sha256":"b6d31fd70bcd9c4b"}},{"arxiv_id":"2506.07078","arxiv_id_is_arxiv":true,"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":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, JiahengDong/E-BATS when it was checked","code_sha256":"c549267af6d34f9a","code_sha256_prefix":"c549267af6d34f9a","mcp_get_code":{"code_sha256":"c549267af6d34f9a"}},{"arxiv_id":"2503.20354","arxiv_id_is_arxiv":true,"paper":"/paper/surgeon-memory-adaptive-fully-test-time","title":"SURGEON: Memory-Adaptive Fully Test-Time Adaptation via Dynamic Activation Sparsity","date":"2025-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kadmkbl/SURGEON","path":"methods/das.py","file_url":"https://github.com/kadmkbl/SURGEON/blob/HEAD/methods/das.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kadmkbl/SURGEON when it was checked","code_sha256":"db8b634a36fc3530","code_sha256_prefix":"db8b634a36fc3530","mcp_get_code":{"code_sha256":"db8b634a36fc3530"}},{"arxiv_id":"2503.02616","arxiv_id_is_arxiv":true,"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_fixture","verification_level":2,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"311413feee2ab1dd","code_sha256_prefix":"311413feee2ab1dd","mcp_get_code":{"code_sha256":"311413feee2ab1dd"}},{"arxiv_id":"2412.12153","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-weight-averaging-for-model-merging","title":"Revisiting Weight Averaging for Model Merging","date":"2024-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JH-GEECS/CART_public","path":"src/merging.py","file_url":"https://github.com/JH-GEECS/CART_public/blob/HEAD/src/merging.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, JH-GEECS/CART_public when it was checked","code_sha256":"c2df94ca3de67eb0","code_sha256_prefix":"c2df94ca3de67eb0","mcp_get_code":{"code_sha256":"c2df94ca3de67eb0"}},{"arxiv_id":"2410.15430","arxiv_id_is_arxiv":true,"paper":"/paper/boostadapter-improving-test-time-adaptation","title":"BoostAdapter: Improving Vision-Language Test-Time Adaptation via Regional Bootstrapping","date":"2024-10-20","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":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":"c2df94ca3de67eb0","code_sha256_prefix":"c2df94ca3de67eb0","mcp_get_code":{"code_sha256":"c2df94ca3de67eb0"}},{"arxiv_id":"2410.14389","arxiv_id_is_arxiv":true,"paper":"/paper/surgeryv2-bridging-the-gap-between-model","title":"SurgeryV2: Bridging the Gap Between Model Merging and Multi-Task Learning with Deep Representation Surgery","date":"2024-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EnnengYang/SurgeryV2","path":"src/merging_model.py","file_url":"https://github.com/EnnengYang/SurgeryV2/blob/HEAD/src/merging_model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, EnnengYang/SurgeryV2 when it was checked","code_sha256":"0c501eba6aaad5fa","code_sha256_prefix":"0c501eba6aaad5fa","mcp_get_code":{"code_sha256":"0c501eba6aaad5fa"}},{"arxiv_id":"2408.17337","arxiv_id_is_arxiv":true,"paper":"/paper/evaluating-reliability-in-medical-dnns-a","title":"Evaluating Reliability in Medical DNNs: A Critical Analysis of Feature and Confidence-Based OOD Detection","date":"2024-08-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"harryanthony/evaluating_ood_detection","path":"source/methods/entropy.py","file_url":"https://github.com/harryanthony/evaluating_ood_detection/blob/HEAD/source/methods/entropy.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"879067ef117fce51","code_sha256_prefix":"879067ef117fce51","mcp_get_code":{"code_sha256":"879067ef117fce51"}},{"arxiv_id":"2408.13983","arxiv_id_is_arxiv":true,"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":"dct.py","file_url":"https://github.com/yushuntang/dpal/blob/HEAD/dct.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from Feliciaxyao/ICML2024-FSTTA, and GitHub detected no licence in that repository when it was checked","code_sha256":"3078648c75e3e1e3","code_sha256_prefix":"3078648c75e3e1e3","mcp_get_code":{"code_sha256":"3078648c75e3e1e3"}},{"arxiv_id":"2408.07362","arxiv_id_is_arxiv":true,"paper":"/paper/badmerging-backdoor-attacks-against-model","title":"BadMerging: Backdoor Attacks Against Model Merging","date":"2024-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jzhang538/badmerging","path":"src/main_adamerging_badmergingoff.py","file_url":"https://github.com/jzhang538/badmerging/blob/HEAD/src/main_adamerging_badmergingoff.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jzhang538/badmerging when it was checked","code_sha256":"c2df94ca3de67eb0","code_sha256_prefix":"c2df94ca3de67eb0","mcp_get_code":{"code_sha256":"c2df94ca3de67eb0"}},{"arxiv_id":"2407.16193","arxiv_id_is_arxiv":true,"paper":"/paper/cloudfixer-test-time-adaptation-for-3d-point","title":"CloudFixer: Test-Time Adaptation for 3D Point Clouds via Diffusion-Guided Geometric Transformation","date":"2024-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shimazing/CloudFixer","path":"utils/losses.py","file_url":"https://github.com/shimazing/CloudFixer/blob/HEAD/utils/losses.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":"6ae0cdec9fe5f43b","code_sha256_prefix":"6ae0cdec9fe5f43b","mcp_get_code":{"code_sha256":"6ae0cdec9fe5f43b"}},{"arxiv_id":"2407.12128","arxiv_id_is_arxiv":true,"paper":"/paper/distribution-alignment-for-fully-test-time","title":"Distribution Alignment for Fully Test-Time Adaptation with Dynamic Online Data Streams","date":"2024-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WZq975/DA-TTA","path":"methods/datta.py","file_url":"https://github.com/WZq975/DA-TTA/blob/HEAD/methods/datta.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from Feliciaxyao/ICML2024-FSTTA, and GitHub detected no licence in that repository when it was checked","code_sha256":"3078648c75e3e1e3","code_sha256_prefix":"3078648c75e3e1e3","mcp_get_code":{"code_sha256":"3078648c75e3e1e3"}},{"arxiv_id":"2407.12128","arxiv_id_is_arxiv":true,"paper":"/paper/distribution-alignment-for-fully-test-time","title":"Distribution Alignment for Fully Test-Time Adaptation with Dynamic Online Data Streams","date":"2024-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WZq975/DA-TTA","path":"methods/eata.py","file_url":"https://github.com/WZq975/DA-TTA/blob/HEAD/methods/eata.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7b9d88d29b50aca6","code_sha256_prefix":"7b9d88d29b50aca6","mcp_get_code":{"code_sha256":"7b9d88d29b50aca6"}},{"arxiv_id":"2407.07089","arxiv_id_is_arxiv":true,"paper":"/paper/fine-tuning-linear-layers-only-is-a-simple","title":"Fine-Tuning Attention Modules Only: Enhancing Weight Disentanglement in Task Arithmetic","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kyrie-23/task_arithmetic_tangent","path":"src/main_task_wise_adamerging.py","file_url":"https://github.com/kyrie-23/task_arithmetic_tangent/blob/HEAD/src/main_task_wise_adamerging.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c2df94ca3de67eb0","code_sha256_prefix":"c2df94ca3de67eb0","mcp_get_code":{"code_sha256":"c2df94ca3de67eb0"}},{"arxiv_id":"2407.02880","arxiv_id_is_arxiv":true,"paper":"/paper/knowledge-composition-using-task-vectors-with","title":"Knowledge Composition using Task Vectors with Learned Anisotropic Scaling","date":"2024-07-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fredzzhang/atlas","path":"src/learn_few_shots.py","file_url":"https://github.com/fredzzhang/atlas/blob/HEAD/src/learn_few_shots.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, fredzzhang/atlas when it was checked","code_sha256":"60e9cb8fea03027c","code_sha256_prefix":"60e9cb8fea03027c","mcp_get_code":{"code_sha256":"60e9cb8fea03027c"}},{"arxiv_id":"2406.10737","arxiv_id_is_arxiv":true,"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/dpcore.py","file_url":"https://github.com/zybeich/DPCore/blob/HEAD/imagenet/dpcore.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7b9d88d29b50aca6","code_sha256_prefix":"7b9d88d29b50aca6","mcp_get_code":{"code_sha256":"7b9d88d29b50aca6"}},{"arxiv_id":"2405.16486","arxiv_id_is_arxiv":true,"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":"cotta_vit.py","file_url":"https://github.com/royzry98/moase-pytorch/blob/HEAD/cotta_vit.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, royzry98/moase-pytorch when it was checked","code_sha256":"e589e47d748af885","code_sha256_prefix":"e589e47d748af885","mcp_get_code":{"code_sha256":"e589e47d748af885"}},{"arxiv_id":"2405.05012","arxiv_id_is_arxiv":true,"paper":"/paper/the-entropy-enigma-success-and-failure-of","title":"The Entropy Enigma: Success and Failure of Entropy Minimization","date":"2024-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oripress/entropyenigma","path":"rdumb.py","file_url":"https://github.com/oripress/entropyenigma/blob/HEAD/rdumb.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0a744d0bf07e513c","code_sha256_prefix":"0a744d0bf07e513c","mcp_get_code":{"code_sha256":"0a744d0bf07e513c"}},{"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":"models/tent.py","file_url":"https://github.com/dosowiechi/clipartt/blob/HEAD/models/tent.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","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":"3078648c75e3e1e3","code_sha256_prefix":"3078648c75e3e1e3","mcp_get_code":{"code_sha256":"3078648c75e3e1e3"}},{"arxiv_id":"2404.06065","arxiv_id_is_arxiv":true,"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_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from Feliciaxyao/ICML2024-FSTTA, and GitHub detected no licence in that repository when it was checked","code_sha256":"3078648c75e3e1e3","code_sha256_prefix":"3078648c75e3e1e3","mcp_get_code":{"code_sha256":"3078648c75e3e1e3"}},{"arxiv_id":"2404.06065","arxiv_id_is_arxiv":true,"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":"tiny_imagenet/cotta.py","file_url":"https://github.com/gaozhengqing/UniEnt/blob/HEAD/tiny_imagenet/cotta.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e589e47d748af885","code_sha256_prefix":"e589e47d748af885","mcp_get_code":{"code_sha256":"e589e47d748af885"}},{"arxiv_id":"2404.06065","arxiv_id_is_arxiv":true,"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/eata.py","file_url":"https://github.com/gaozhengqing/UniEnt/blob/HEAD/imagenet/eata.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7b9d88d29b50aca6","code_sha256_prefix":"7b9d88d29b50aca6","mcp_get_code":{"code_sha256":"7b9d88d29b50aca6"}},{"arxiv_id":"2404.06065","arxiv_id_is_arxiv":true,"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/cotta.py","file_url":"https://github.com/gaozhengqing/UniEnt/blob/HEAD/imagenet/cotta.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b8ea8e2ae9be86a9","code_sha256_prefix":"b8ea8e2ae9be86a9","mcp_get_code":{"code_sha256":"b8ea8e2ae9be86a9"}},{"arxiv_id":"2404.01650","arxiv_id_is_arxiv":true,"paper":"/paper/test-time-model-adaptation-with-only-forward","title":"Test-Time Model Adaptation with Only Forward Passes","date":"2024-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mr-eggplant/foa","path":"tta_library/foa.py","file_url":"https://github.com/mr-eggplant/foa/blob/HEAD/tta_library/foa.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, mr-eggplant/foa when it was checked","code_sha256":"7b9d88d29b50aca6","code_sha256_prefix":"7b9d88d29b50aca6","mcp_get_code":{"code_sha256":"7b9d88d29b50aca6"}},{"arxiv_id":"2404.01351","arxiv_id_is_arxiv":true,"paper":"/paper/aetta-label-free-accuracy-estimation-for-test","title":"AETTA: Label-Free Accuracy Estimation for Test-Time Adaptation","date":"2024-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taeckyung/AETTA","path":"utils/loss_functions.py","file_url":"https://github.com/taeckyung/AETTA/blob/HEAD/utils/loss_functions.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a9edd84f4eedeec8","code_sha256_prefix":"a9edd84f4eedeec8","mcp_get_code":{"code_sha256":"a9edd84f4eedeec8"}},{"arxiv_id":"2403.07366","arxiv_id_is_arxiv":true,"paper":"/paper/entropy-is-not-enough-for-test-time","title":"Entropy is not Enough for Test-Time Adaptation: From the Perspective of Disentangled Factors","date":"2024-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","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":"3078648c75e3e1e3","code_sha256_prefix":"3078648c75e3e1e3","mcp_get_code":{"code_sha256":"3078648c75e3e1e3"}},{"arxiv_id":"2402.02705","arxiv_id_is_arxiv":true,"paper":"/paper/representation-surgery-for-multi-task-model","title":"Representation Surgery for Multi-Task Model Merging","date":"2024-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ennengyang/representationsurgery","path":"src/merging_model.py","file_url":"https://github.com/ennengyang/representationsurgery/blob/HEAD/src/merging_model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from EnnengYang/SurgeryV2, and GitHub detected no licence in that repository when it was checked","code_sha256":"0c501eba6aaad5fa","code_sha256_prefix":"0c501eba6aaad5fa","mcp_get_code":{"code_sha256":"0c501eba6aaad5fa"}},{"arxiv_id":"2312.06173","arxiv_id_is_arxiv":true,"paper":"/paper/concrete-subspace-learning-based-interference","title":"Concrete Subspace Learning based Interference Elimination for Multi-task Model Fusion","date":"2023-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tanganke/subspace_fusion","path":"src/adamerging.py","file_url":"https://github.com/tanganke/subspace_fusion/blob/HEAD/src/adamerging.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, tanganke/subspace_fusion when it was checked","code_sha256":"d3c4cec689591885","code_sha256_prefix":"d3c4cec689591885","mcp_get_code":{"code_sha256":"d3c4cec689591885"}},{"arxiv_id":"2311.18193","arxiv_id_is_arxiv":true,"paper":"/paper/persistent-test-time-adaptation-in-episodic","title":"Persistent Test-time Adaptation in Recurring Testing Scenarios","date":"2023-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hthieu166/petta","path":"src/adapter/petta.py","file_url":"https://github.com/hthieu166/petta/blob/HEAD/src/adapter/petta.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, hthieu166/petta when it was checked","code_sha256":"8cc4004512e3fa2f","code_sha256_prefix":"8cc4004512e3fa2f","mcp_get_code":{"code_sha256":"8cc4004512e3fa2f"}},{"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/adazoo/sar.py","file_url":"https://github.com/yuanyige/tea/blob/HEAD/core/adazoo/sar.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","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":"3078648c75e3e1e3","code_sha256_prefix":"3078648c75e3e1e3","mcp_get_code":{"code_sha256":"3078648c75e3e1e3"}},{"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/adazoo/eata.py","file_url":"https://github.com/yuanyige/tea/blob/HEAD/core/adazoo/eata.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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":"7b9d88d29b50aca6","code_sha256_prefix":"7b9d88d29b50aca6","mcp_get_code":{"code_sha256":"7b9d88d29b50aca6"}},{"arxiv_id":"2311.13209","arxiv_id_is_arxiv":true,"paper":"/paper/test-time-adaptive-vision-and-language","title":"Fast-Slow Test-Time Adaptation for Online Vision-and-Language Navigation","date":"2023-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Feliciaxyao/ICML2024-FSTTA","path":"map_nav_src/models/FSTTA.py","file_url":"https://github.com/Feliciaxyao/ICML2024-FSTTA/blob/HEAD/map_nav_src/models/FSTTA.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Feliciaxyao/ICML2024-FSTTA when it was checked","code_sha256":"3078648c75e3e1e3","code_sha256_prefix":"3078648c75e3e1e3","mcp_get_code":{"code_sha256":"3078648c75e3e1e3"}},{"arxiv_id":"2310.20199","arxiv_id_is_arxiv":true,"paper":"/paper/in-search-of-lost-online-test-time-adaptation","title":"In Search of Lost Online Test-time Adaptation: A Survey","date":"2023-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jo-wang/otta_vit_survey","path":"classification/methods/conjugatePL.py","file_url":"https://github.com/jo-wang/otta_vit_survey/blob/HEAD/classification/methods/conjugatePL.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from Feliciaxyao/ICML2024-FSTTA, and GitHub detected no licence in that repository when it was checked","code_sha256":"3078648c75e3e1e3","code_sha256_prefix":"3078648c75e3e1e3","mcp_get_code":{"code_sha256":"3078648c75e3e1e3"}},{"arxiv_id":"2310.18562","arxiv_id_is_arxiv":true,"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":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","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":"3078648c75e3e1e3","code_sha256_prefix":"3078648c75e3e1e3","mcp_get_code":{"code_sha256":"3078648c75e3e1e3"}},{"arxiv_id":"2310.10074","arxiv_id_is_arxiv":true,"paper":"/paper/sotta-robust-test-time-adaptation-on-noisy-1","title":"SoTTA: Robust Test-Time Adaptation on Noisy Data Streams","date":"2023-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taeckyung/SoTTA","path":"learner/sotta.py","file_url":"https://github.com/taeckyung/SoTTA/blob/HEAD/learner/sotta.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a9edd84f4eedeec8","code_sha256_prefix":"a9edd84f4eedeec8","mcp_get_code":{"code_sha256":"a9edd84f4eedeec8"}},{"arxiv_id":"2310.02575","arxiv_id_is_arxiv":true,"paper":"/paper/adamerging-adaptive-model-merging-for-multi","title":"AdaMerging: Adaptive Model Merging for Multi-Task Learning","date":"2023-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EnnengYang/AdaMerging","path":"src/main_task_wise_adamerging.py","file_url":"https://github.com/EnnengYang/AdaMerging/blob/HEAD/src/main_task_wise_adamerging.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c2df94ca3de67eb0","code_sha256_prefix":"c2df94ca3de67eb0","mcp_get_code":{"code_sha256":"c2df94ca3de67eb0"}},{"arxiv_id":"2309.14949","arxiv_id_is_arxiv":true,"paper":"/paper/towards-real-world-test-time-adaptation-tri","title":"Towards Real-World Test-Time Adaptation: Tri-Net Self-Training with Balanced Normalization","date":"2023-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gorilla-lab-scut/tribe","path":"core/adapter/base_adapter.py","file_url":"https://github.com/gorilla-lab-scut/tribe/blob/HEAD/core/adapter/base_adapter.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, gorilla-lab-scut/tribe when it was checked","code_sha256":"8cc4004512e3fa2f","code_sha256_prefix":"8cc4004512e3fa2f","mcp_get_code":{"code_sha256":"8cc4004512e3fa2f"}},{"arxiv_id":"2309.14949","arxiv_id_is_arxiv":true,"paper":"/paper/towards-real-world-test-time-adaptation-tri","title":"Towards Real-World Test-Time Adaptation: Tri-Net Self-Training with Balanced Normalization","date":"2023-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gorilla-lab-scut/tribe","path":"core/adapter/cotta.py","file_url":"https://github.com/gorilla-lab-scut/tribe/blob/HEAD/core/adapter/cotta.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, gorilla-lab-scut/tribe when it was checked","code_sha256":"e589e47d748af885","code_sha256_prefix":"e589e47d748af885","mcp_get_code":{"code_sha256":"e589e47d748af885"}},{"arxiv_id":"2306.04344","arxiv_id_is_arxiv":true,"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_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from Feliciaxyao/ICML2024-FSTTA, and GitHub detected no licence in that repository when it was checked","code_sha256":"3078648c75e3e1e3","code_sha256_prefix":"3078648c75e3e1e3","mcp_get_code":{"code_sha256":"3078648c75e3e1e3"}},{"arxiv_id":"2306.04344","arxiv_id_is_arxiv":true,"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":"cifar/vida.py","file_url":"https://github.com/yangsenqiao/vida/blob/HEAD/cifar/vida.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e589e47d748af885","code_sha256_prefix":"e589e47d748af885","mcp_get_code":{"code_sha256":"e589e47d748af885"}},{"arxiv_id":"2306.04344","arxiv_id_is_arxiv":true,"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/vida.py","file_url":"https://github.com/yangsenqiao/vida/blob/HEAD/imagenet/vida.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b8ea8e2ae9be86a9","code_sha256_prefix":"b8ea8e2ae9be86a9","mcp_get_code":{"code_sha256":"b8ea8e2ae9be86a9"}},{"arxiv_id":"2304.12566","arxiv_id_is_arxiv":true,"paper":"/paper/adanpc-exploring-non-parametric-classifier","title":"AdaNPC: Exploring Non-Parametric Classifier for Test-Time Adaptation","date":"2023-04-25","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":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":"e6171e29ed623a12","code_sha256_prefix":"e6171e29ed623a12","mcp_get_code":{"code_sha256":"e6171e29ed623a12"}},{"arxiv_id":"2302.12400","arxiv_id_is_arxiv":true,"paper":"/paper/towards-stable-test-time-adaptation-in","title":"Towards Stable Test-Time Adaptation in Dynamic Wild World","date":"2023-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mr-eggplant/SAR","path":"sar.py","file_url":"https://github.com/mr-eggplant/SAR/blob/HEAD/sar.py","status":"ran_fixture","verification_level":2,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8f4830ebee73f4a1","code_sha256_prefix":"8f4830ebee73f4a1","mcp_get_code":{"code_sha256":"8f4830ebee73f4a1"}},{"arxiv_id":"2207.10792","arxiv_id_is_arxiv":true,"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":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","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":"e6171e29ed623a12","code_sha256_prefix":"e6171e29ed623a12","mcp_get_code":{"code_sha256":"e6171e29ed623a12"}},{"arxiv_id":"2207.10792","arxiv_id_is_arxiv":true,"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":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, mingukjang/tast, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"b5d67732e5b29f2b","code_sha256_prefix":"b5d67732e5b29f2b","mcp_get_code":{"code_sha256":"b5d67732e5b29f2b"}},{"arxiv_id":"2204.02610","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-test-time-model-adaptation-without","title":"Efficient Test-Time Model Adaptation without Forgetting","date":"2022-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mr-eggplant/eata","path":"eata.py","file_url":"https://github.com/mr-eggplant/eata/blob/HEAD/eata.py","status":"ran_fixture","verification_level":2,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, mr-eggplant/eata (NOASSERTION)","code_sha256":"1ddd5315f5202ec9","code_sha256_prefix":"1ddd5315f5202ec9","mcp_get_code":{"code_sha256":"1ddd5315f5202ec9"}},{"arxiv_id":"2203.13591","arxiv_id_is_arxiv":true,"paper":"/paper/continual-test-time-domain-adaptation","title":"Continual Test-Time Domain Adaptation","date":"2022-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qinenergy/cotta","path":"imagenet/cotta.py","file_url":"https://github.com/qinenergy/cotta/blob/HEAD/imagenet/cotta.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, qinenergy/cotta (NOASSERTION)","code_sha256":"867d3ea552eca91a","code_sha256_prefix":"867d3ea552eca91a","mcp_get_code":{"code_sha256":"867d3ea552eca91a"}},{"arxiv_id":"2202.06484","arxiv_id_is_arxiv":true,"paper":"/paper/adeada-adaptive-density-aware-active-domain","title":"D2ADA: Dynamic Density-aware Active Domain Adaptation for Semantic Segmentation","date":"2022-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsunghan-wu/d2ada","path":"active_selection/softmax_uncertainty.py","file_url":"https://github.com/tsunghan-wu/d2ada/blob/HEAD/active_selection/softmax_uncertainty.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":"f5f16065ea0422a4","code_sha256_prefix":"f5f16065ea0422a4","mcp_get_code":{"code_sha256":"f5f16065ea0422a4"}},{"arxiv_id":"2110.14038","arxiv_id_is_arxiv":true,"paper":"/paper/robustness-of-graph-neural-networks-at-scale","title":"Robustness of Graph Neural Networks at Scale","date":"2021-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ventr1c/res-gcl","path":"PRBCD.py","file_url":"https://github.com/ventr1c/res-gcl/blob/HEAD/PRBCD.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from mala-lab/PromptDyG, and GitHub detected no licence in that repository when it was checked","code_sha256":"91c9b17caed9c461","code_sha256_prefix":"91c9b17caed9c461","mcp_get_code":{"code_sha256":"91c9b17caed9c461"}},{"arxiv_id":"2105.08714","arxiv_id_is_arxiv":true,"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":"tent.py","file_url":"https://github.com/DequanWang/dent/blob/HEAD/tent.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from Feliciaxyao/ICML2024-FSTTA, and GitHub detected no licence in that repository when it was checked","code_sha256":"3078648c75e3e1e3","code_sha256_prefix":"3078648c75e3e1e3","mcp_get_code":{"code_sha256":"3078648c75e3e1e3"}},{"arxiv_id":"2105.08714","arxiv_id_is_arxiv":true,"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_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","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":"60e9cb8fea03027c","code_sha256_prefix":"60e9cb8fea03027c","mcp_get_code":{"code_sha256":"60e9cb8fea03027c"}},{"arxiv_id":"2007.01434","arxiv_id_is_arxiv":true,"paper":"/paper/in-search-of-lost-domain-generalization","title":"In Search of Lost Domain Generalization","date":"2020-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"matsuolab/t3a","path":"domainbed/scripts/unsupervised_adaptation.py","file_url":"https://github.com/matsuolab/t3a/blob/HEAD/domainbed/scripts/unsupervised_adaptation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e6171e29ed623a12","code_sha256_prefix":"e6171e29ed623a12","mcp_get_code":{"code_sha256":"e6171e29ed623a12"}},{"arxiv_id":"2006.10726","arxiv_id_is_arxiv":true,"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_fixture","verification_level":2,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5f3e7b3e8f7ad589","code_sha256_prefix":"5f3e7b3e8f7ad589","mcp_get_code":{"code_sha256":"5f3e7b3e8f7ad589"}},{"arxiv_id":"2006.10726","arxiv_id_is_arxiv":true,"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_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, mr-eggplant/eata (NOASSERTION)","code_sha256":"be510b4c74ce8440","code_sha256_prefix":"be510b4c74ce8440","mcp_get_code":{"code_sha256":"be510b4c74ce8440"}},{"arxiv_id":"1408.5882","arxiv_id_is_arxiv":true,"paper":"/paper/convolutional-neural-networks-for-sentence","title":"Convolutional Neural Networks for Sentence Classification","date":"2014-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"piyush2896/CNN-Text-Classifier","path":"nn/losses.py","file_url":"https://github.com/piyush2896/CNN-Text-Classifier/blob/HEAD/nn/losses.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":"bd97236dd26fd34d","code_sha256_prefix":"bd97236dd26fd34d","mcp_get_code":{"code_sha256":"bd97236dd26fd34d"}},{"arxiv_id":"openreview_yMYRr00HFS","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id openreview_yMYRr00HFS","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"XLearning-SCU/2025-ICLR-TCR","path":"losses.py","file_url":"https://github.com/XLearning-SCU/2025-ICLR-TCR/blob/HEAD/losses.py","status":"ran","verification_level":1,"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":"61925d8cd706d85d","code_sha256_prefix":"61925d8cd706d85d","mcp_get_code":{"code_sha256":"61925d8cd706d85d"}},{"arxiv_id":"openreview_QYPKLGyz7K","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id openreview_QYPKLGyz7K","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"scienceliuc/SaTeen","path":"deyo.py","file_url":"https://github.com/scienceliuc/SaTeen/blob/HEAD/deyo.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (BSD-3-Clause), but get_code serves the stored copy, first harvested from Feliciaxyao/ICML2024-FSTTA, and GitHub detected no licence in that repository when it was checked","code_sha256":"3078648c75e3e1e3","code_sha256_prefix":"3078648c75e3e1e3","mcp_get_code":{"code_sha256":"3078648c75e3e1e3"}},{"arxiv_id":"openreview_QYPKLGyz7K","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id openreview_QYPKLGyz7K","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"scienceliuc/SaTeen","path":"eata.py","file_url":"https://github.com/scienceliuc/SaTeen/blob/HEAD/eata.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7b9d88d29b50aca6","code_sha256_prefix":"7b9d88d29b50aca6","mcp_get_code":{"code_sha256":"7b9d88d29b50aca6"}},{"arxiv_id":"openreview_QYPKLGyz7K","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id openreview_QYPKLGyz7K","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"scienceliuc/SaTeen","path":"sateen.py","file_url":"https://github.com/scienceliuc/SaTeen/blob/HEAD/sateen.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0a744d0bf07e513c","code_sha256_prefix":"0a744d0bf07e513c","mcp_get_code":{"code_sha256":"0a744d0bf07e513c"}},{"arxiv_id":"ijcai2025_0115","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2025_0115","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Gwxer/Hierarchical-Adapter","path":"tda_help.py","file_url":"https://github.com/Gwxer/Hierarchical-Adapter/blob/HEAD/tda_help.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c2df94ca3de67eb0","code_sha256_prefix":"c2df94ca3de67eb0","mcp_get_code":{"code_sha256":"c2df94ca3de67eb0"}}],"record_sha256":"ad1a17d549357382c482c92ee1eab492f5e962e63d1c63476872d2c176897695","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}