{"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/image-classification-test","entry":"image_classification_test","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":11,"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":12,"n_samples_ran":3,"n_samples_fingerprinted":0,"n_places":14,"n_places_pointer_only":9,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":2,"ran":1,"unverified":9},"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/train_image.py","file_url":"https://github.com/zhangyl660/LERM/blob/HEAD/UDA/DA/CDAN-LERM/train_image.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"16f4eb1e884b4253","mcp_get_code":{"code_sha256":"16f4eb1e884b4253"}},{"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/train_image.py","file_url":"https://github.com/thuml/CDAN/blob/HEAD/pytorch/train_image.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"dd5b0e1fe8cd7d78","mcp_get_code":{"code_sha256":"dd5b0e1fe8cd7d78"}},{"arxiv_id":"2205.06549","paper":"/paper/unsupervised-structure-texture-separation","title":"Unsupervised Structure-Texture Separation Network for Oracle Character Recognition","date":"2022-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wm-bupt/STSN","path":"train_base.py","file_url":"https://github.com/wm-bupt/STSN/blob/HEAD/train_base.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":"b83ec8e72956e6e5","mcp_get_code":{"code_sha256":"b83ec8e72956e6e5"}},{"arxiv_id":"2107.06154","paper":"/paper/fast-batch-nuclear-norm-maximization-and","title":"Fast Batch Nuclear-norm Maximization and Minimization for Robust Domain Adaptation","date":"2021-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"ffe52a5a2d8c2a02","mcp_get_code":{"code_sha256":"ffe52a5a2d8c2a02"}},{"arxiv_id":"2103.03606","paper":"/paper/unbalanced-minibatch-optimal-transport","title":"Unbalanced minibatch Optimal Transport; applications to Domain Adaptation","date":"2021-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kilianFatras/JUMBOT","path":"Domain_Adaptation/train_jumbot.py","file_url":"https://github.com/kilianFatras/JUMBOT/blob/HEAD/Domain_Adaptation/train_jumbot.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b1fd9ef2c839bac2","mcp_get_code":{"code_sha256":"b1fd9ef2c839bac2"}},{"arxiv_id":"2004.12615","paper":"/paper/maximum-density-divergence-for-domain","title":"Maximum Density Divergence for Domain Adaptation","date":"2020-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lijin118/ATM","path":"train_image.py","file_url":"https://github.com/lijin118/ATM/blob/HEAD/train_image.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"dd5b0e1fe8cd7d78","mcp_get_code":{"code_sha256":"dd5b0e1fe8cd7d78"}},{"arxiv_id":"2003.13183","paper":"/paper/gradually-vanishing-bridge-for-adversarial","title":"Gradually Vanishing Bridge for Adversarial Domain Adaptation","date":"2020-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cuishuhao/GVB","path":"GVB-GD/train_image.py","file_url":"https://github.com/cuishuhao/GVB/blob/HEAD/GVB-GD/train_image.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"db70d563ababdeb8","mcp_get_code":{"code_sha256":"db70d563ababdeb8"}},{"arxiv_id":"2003.13183","paper":"/paper/gradually-vanishing-bridge-for-adversarial","title":"Gradually Vanishing Bridge for Adversarial Domain Adaptation","date":"2020-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cuishuhao/GVB","path":"CDAN-GD/train_image.py","file_url":"https://github.com/cuishuhao/GVB/blob/HEAD/CDAN-GD/train_image.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b83705aef1d57116","mcp_get_code":{"code_sha256":"b83705aef1d57116"}},{"arxiv_id":"2003.12237","paper":"/paper/towards-discriminability-and-diversity-batch","title":"Towards Discriminability and Diversity: Batch Nuclear-norm Maximization under Label Insufficient Situations","date":"2020-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cuishuhao/BNM","path":"DA/BNM/train_image.py","file_url":"https://github.com/cuishuhao/BNM/blob/HEAD/DA/BNM/train_image.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ffe52a5a2d8c2a02","mcp_get_code":{"code_sha256":"ffe52a5a2d8c2a02"}},{"arxiv_id":"2003.05636","paper":"/paper/fisher-deep-domain-adaptation","title":"Fisher Deep Domain Adaptation","date":"2020-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HKUST-KnowComp/FisherDA","path":"src/train_ada.py","file_url":"https://github.com/HKUST-KnowComp/FisherDA/blob/HEAD/src/train_ada.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5af9c39e75ddeebd","mcp_get_code":{"code_sha256":"5af9c39e75ddeebd"}},{"arxiv_id":"2003.05636","paper":"/paper/fisher-deep-domain-adaptation","title":"Fisher Deep Domain Adaptation","date":"2020-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HKUST-KnowComp/FisherDA","path":"src/eval_da.py","file_url":"https://github.com/HKUST-KnowComp/FisherDA/blob/HEAD/src/eval_da.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fdbce7356b772ec7","mcp_get_code":{"code_sha256":"fdbce7356b772ec7"}},{"arxiv_id":"1912.03699","paper":"/paper/less-confusion-more-transferable-minimum","title":"Minimum Class Confusion for Versatile Domain Adaptation","date":"2019-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thuml/Versatile-Domain-Adaptation","path":"pytorch/train_image_office.py","file_url":"https://github.com/thuml/Versatile-Domain-Adaptation/blob/HEAD/pytorch/train_image_office.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3a55299001ec8870","mcp_get_code":{"code_sha256":"3a55299001ec8870"}},{"arxiv_id":"1912.03699","paper":"/paper/less-confusion-more-transferable-minimum","title":"Minimum Class Confusion for Versatile Domain Adaptation","date":"2019-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thuml/Versatile-Domain-Adaptation","path":"pytorch/train_image_visda.py","file_url":"https://github.com/thuml/Versatile-Domain-Adaptation/blob/HEAD/pytorch/train_image_visda.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6fbf1ba21421577f","mcp_get_code":{"code_sha256":"6fbf1ba21421577f"}},{"arxiv_id":"1808.04205","paper":"/paper/partial-adversarial-domain-adaptation","title":"Partial Adversarial Domain Adaptation","date":"2018-08-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thuml/PADA","path":"pytorch/src/train_pada.py","file_url":"https://github.com/thuml/PADA/blob/HEAD/pytorch/src/train_pada.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f876454bcd479a54","mcp_get_code":{"code_sha256":"f876454bcd479a54"}}]}