{"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":"/paper/entropy-minimization-vs-diversity","title":"Entropy Minimization vs. Diversity Maximization for Domain Adaptation","arxiv_id":"2002.01690","date":"2020-02-05","proceeding":null,"authors":["Xiaofu Wu","Suofei hang","Quan Zhou","Zhen Yang","Chunming Zhao","Longin Jan Latecki"],"abstract":"Entropy minimization has been widely used in unsupervised domain adaptation (UDA). However, existing works reveal that entropy minimization only may result into collapsed trivial solutions. In this paper, we propose to avoid trivial solutions by further introducing diversity maximization. In order to achieve the possible minimum target risk for UDA, we show that diversity maximization should be elaborately balanced with entropy minimization, the degree of which can be finely controlled with the use of deep embedded validation in an unsupervised manner. The proposed minimal-entropy diversity maximization (MEDM) can be directly implemented by stochastic gradient descent without use of adversarial learning. Empirical evidence demonstrates that MEDM outperforms the state-of-the-art methods on four popular domain adaptation datasets.","url_abs":"https://arxiv.org/abs/2002.01690v1","url_pdf":"https://arxiv.org/pdf/2002.01690v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"entropy-minimization-vs-diversity","repo_url":"https://github.com/AI-NERC-NUPT/MEDM","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"diversity","task_name":"Diversity"},{"task_slug":"domain-adaptation","task_name":"Domain Adaptation"},{"task_slug":"unsupervised-domain-adaptation","task_name":"Unsupervised Domain Adaptation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/domain-adaptation-on-imageclef-da","task":"Domain Adaptation","dataset":"ImageCLEF-DA","model":"MEDM","rank_in_archive_order":8,"of":17,"metrics":{"Accuracy":"88.9"},"uses_additional_data":false},{"leaderboard":"/sota/domain-adaptation-on-office-31","task":"Domain Adaptation","dataset":"Office-31","model":"MEDM","rank_in_archive_order":20,"of":40,"metrics":{"Average Accuracy":"89.2"},"uses_additional_data":false},{"leaderboard":"/sota/domain-adaptation-on-office-home","task":"Domain Adaptation","dataset":"Office-Home","model":"MEDM","rank_in_archive_order":25,"of":29,"metrics":{"Accuracy":"69.5"},"uses_additional_data":false}],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2002.01690","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.01690"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/AI-NERC-NUPT/MEDM","reach":null}],"summary":{"ran_fixture":1,"unverified":2},"by_repo_kind":{"official":{"samples":3,"ran":1,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":3,"samples":[{"code_sha256_prefix":"a50f333caba99b0a","entry":"one_hot","repo":"AI-NERC-NUPT/MEDM","repo_kind":"official","path":"MEDM_VisDA_Res50.py","file_url":"https://github.com/AI-NERC-NUPT/MEDM/blob/HEAD/MEDM_VisDA_Res50.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"a50f333caba99b0a"}},{"code_sha256_prefix":"c4b6347d684b8725","entry":"load_pretrain","repo":"AI-NERC-NUPT/MEDM","repo_kind":"official","path":"MEDM_VisDA_Res50.py","file_url":"https://github.com/AI-NERC-NUPT/MEDM/blob/HEAD/MEDM_VisDA_Res50.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"c4b6347d684b8725"}},{"code_sha256_prefix":"d799243b9af18d37","entry":"load_pretrain","repo":"AI-NERC-NUPT/MEDM","repo_kind":"official","path":"MEDM_VisDA_Res101.py","file_url":"https://github.com/AI-NERC-NUPT/MEDM/blob/HEAD/MEDM_VisDA_Res101.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"d799243b9af18d37"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}