{"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/boosting-domain-adaptation-by-discovering","title":"Boosting Domain Adaptation by Discovering Latent Domains","arxiv_id":"1805.01386","date":"2018-05-03","proceeding":"CVPR 2018 6","authors":["Massimiliano Mancini","Lorenzo Porzi","Samuel Rota Bulò","Barbara Caputo","Elisa Ricci"],"abstract":"Current Domain Adaptation (DA) methods based on deep architectures assume\nthat the source samples arise from a single distribution. However, in practice,\nmost datasets can be regarded as mixtures of multiple domains. In these cases\nexploiting single-source DA methods for learning target classifiers may lead to\nsub-optimal, if not poor, results. In addition, in many applications it is\ndifficult to manually provide the domain labels for all source data points,\ni.e. latent domains should be automatically discovered. This paper introduces a\nnovel Convolutional Neural Network (CNN) architecture which (i) automatically\ndiscovers latent domains in visual datasets and (ii) exploits this information\nto learn robust target classifiers. Our approach is based on the introduction\nof two main components, which can be embedded into any existing CNN\narchitecture: (i) a side branch that automatically computes the assignment of a\nsource sample to a latent domain and (ii) novel layers that exploit domain\nmembership information to appropriately align the distribution of the CNN\ninternal feature representations to a reference distribution. We test our\napproach on publicly-available datasets, showing that it outperforms\nstate-of-the-art multi-source DA methods by a large margin.","url_abs":"http://arxiv.org/abs/1805.01386v1","url_pdf":"http://arxiv.org/pdf/1805.01386v1.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":"boosting-domain-adaptation-by-discovering","repo_url":"https://github.com/mancinimassimiliano/latent_domains_DA","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"boosting-domain-adaptation-by-discovering","repo_url":"https://github.com/mancinimassimiliano/pytorch_wbn","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"domain-adaptation","task_name":"Domain Adaptation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1805.01386","atlas_url":"https://app.syntology.ai/?focus=1805.01386","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":"1805.01386"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1805.01386\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1805.01386"},"call":"get_concepts_for_paper(arxiv_id=\"1805.01386\")"}],"by_repo":[{"repo":"mancinimassimiliano/latent_domains_DA","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"mancinimassimiliano/pytorch_wbn","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":"f6403de1264e254e244409c1f6eaf4b49e4ce242a694dda2f243ac1a0bc05ce8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}