{"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":"/paper/on-minimum-discrepancy-estimation-for-deep","title":"On Minimum Discrepancy Estimation for Deep Domain Adaptation","arxiv_id":"1901.00282","date":"2019-01-02","proceeding":null,"authors":["Mohammad Mahfujur Rahman","Clinton Fookes","Mahsa Baktashmotlagh","Sridha Sridharan"],"abstract":"In the presence of large sets of labeled data, Deep Learning (DL) has\naccomplished extraordinary triumphs in the avenue of computer vision,\nparticularly in object classification and recognition tasks. However, DL cannot\nalways perform well when the training and testing images come from different\ndistributions or in the presence of domain shift between training and testing\nimages. They also suffer in the absence of labeled input data. Domain\nadaptation (DA) methods have been proposed to make up the poor performance due\nto domain shift. In this paper, we present a new unsupervised deep domain\nadaptation method based on the alignment of second order statistics\n(covariances) as well as maximum mean discrepancy of the source and target data\nwith a two stream Convolutional Neural Network (CNN). We demonstrate the\nability of the proposed approach to achieve state-of the-art performance for\nimage classification on three benchmark domain adaptation datasets: Office-31\n[27], Office-Home [37] and Office-Caltech [8].","url_abs":"http://arxiv.org/abs/1901.00282v1","url_pdf":"http://arxiv.org/pdf/1901.00282v1.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":"on-minimum-discrepancy-estimation-for-deep","repo_url":"https://github.com/oezyurty/cluda","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"domain-adaptation","task_name":"Domain Adaptation"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"image-classification","task_name":"Image Classification"},{"task_slug":"image-classification","task_name":"image-classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1901.00282","atlas_url":"https://app.syntology.ai/?focus=1901.00282","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1901.00282"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1901.00282\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1901.00282"},"call":"get_concepts_for_paper(arxiv_id=\"1901.00282\")"}],"by_repo":[{"repo":"oezyurty/cluda","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"0ffa3f5e2f406cec14f6d753b6d81b6cc7bc01775a14e89580c2f6789b2b080e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}