{"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/cdan","entry":"CDAN","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":8,"n_papers_ran":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":5,"n_samples_ran":4,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":5,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":3,"unverified":1},"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":"2406.02862","paper":"/paper/rethinking-guidance-information-to-utilize","title":"Rethinking Guidance Information to Utilize Unlabeled Samples:A Label Encoding Perspective","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangyl660/LERM","path":"UDA/DA/CDAN-LERM/loss.py","file_url":"https://github.com/zhangyl660/LERM/blob/HEAD/UDA/DA/CDAN-LERM/loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0372087a25c2c415","mcp_get_code":{"code_sha256":"0372087a25c2c415"}},{"arxiv_id":"2402.01887","paper":"/paper/on-f-divergence-principled-domain-adaptation","title":"On $f$-Divergence Principled Domain Adaptation: An Improved Framework","date":"2024-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thuml/CDAN","path":"pytorch/loss.py","file_url":"https://github.com/thuml/CDAN/blob/HEAD/pytorch/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"385d1e010dfb76a9","mcp_get_code":{"code_sha256":"385d1e010dfb76a9"}},{"arxiv_id":"2310.17594","paper":"/paper/spa-a-graph-spectral-alignment-perspective","title":"SPA: A Graph Spectral Alignment Perspective for Domain Adaptation","date":"2023-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CrownX/SPA","path":"code/loss.py","file_url":"https://github.com/CrownX/SPA/blob/HEAD/code/loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ca7dc4d6c6b6402c","mcp_get_code":{"code_sha256":"ca7dc4d6c6b6402c"}},{"arxiv_id":"2208.07591","paper":"/paper/uncertainty-guided-source-free-domain","title":"Uncertainty-guided Source-free Domain Adaptation","date":"2022-08-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"roysubhankar/uncertainty-sfda","path":"cifar/loss.py","file_url":"https://github.com/roysubhankar/uncertainty-sfda/blob/HEAD/cifar/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"385d1e010dfb76a9","mcp_get_code":{"code_sha256":"385d1e010dfb76a9"}},{"arxiv_id":"2107.12585","paper":"/paper/nearest-neighborhood-based-deep-clustering","title":"Nearest Neighborhood-Based Deep Clustering for Source Data-absent Unsupervised Domain Adaptation","date":"2021-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tntek/N2DCX","path":"object/loss.py","file_url":"https://github.com/tntek/N2DCX/blob/HEAD/object/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"385d1e010dfb76a9","mcp_get_code":{"code_sha256":"385d1e010dfb76a9"}},{"arxiv_id":"2104.01539","paper":"/paper/distill-and-fine-tune-effective-adaptation","title":"DINE: Domain Adaptation from Single and Multiple Black-box Predictors","date":"2021-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tim-learn/SHOT","path":"object/loss.py","file_url":"https://github.com/tim-learn/SHOT/blob/HEAD/object/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"385d1e010dfb76a9","mcp_get_code":{"code_sha256":"385d1e010dfb76a9"}},{"arxiv_id":"2104.00808","paper":"/paper/curriculum-graph-co-teaching-for-multi-target","title":"Curriculum Graph Co-Teaching for Multi-Target Domain Adaptation","date":"2021-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Evgeneus/Graph-Domain-Adaptaion","path":"src/trainer.py","file_url":"https://github.com/Evgeneus/Graph-Domain-Adaptaion/blob/HEAD/src/trainer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"721c625a769522c5","mcp_get_code":{"code_sha256":"721c625a769522c5"}},{"arxiv_id":"2007.14612","paper":"/paper/clarinet-a-one-step-approach-towards-budget","title":"Clarinet: A One-step Approach Towards Budget-friendly Unsupervised Domain Adaptation","date":"2020-07-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yiyang98/BFUDA","path":"ours/train_mu_et.py","file_url":"https://github.com/Yiyang98/BFUDA/blob/HEAD/ours/train_mu_et.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":"266bec9da50e3ba1","mcp_get_code":{"code_sha256":"266bec9da50e3ba1"}}]}