{"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/best-sources-forward-domain-generalization","title":"Best sources forward: domain generalization through source-specific nets","arxiv_id":"1806.05810","date":"2018-06-15","proceeding":null,"authors":["Massimiliano Mancini","Samuel Rota Bulò","Barbara Caputo","Elisa Ricci"],"abstract":"A long standing problem in visual object categorization is the ability of\nalgorithms to generalize across different testing conditions. The problem has\nbeen formalized as a covariate shift among the probability distributions\ngenerating the training data (source) and the test data (target) and several\ndomain adaptation methods have been proposed to address this issue. While these\napproaches have considered the single source-single target scenario, it is\nplausible to have multiple sources and require adaptation to any possible\ntarget domain. This last scenario, named Domain Generalization (DG), is the\nfocus of our work. Differently from previous DG methods which learn domain\ninvariant representations from source data, we design a deep network with\nmultiple domain-specific classifiers, each associated to a source domain. At\ntest time we estimate the probabilities that a target sample belongs to each\nsource domain and exploit them to optimally fuse the classifiers predictions.\nTo further improve the generalization ability of our model, we also introduced\na domain agnostic component supporting the final classifier. Experiments on two\npublic benchmarks demonstrate the power of our approach.","url_abs":"http://arxiv.org/abs/1806.05810v1","url_pdf":"http://arxiv.org/pdf/1806.05810v1.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":[],"tasks":[{"task_slug":"domain-adaptation","task_name":"Domain Adaptation"},{"task_slug":"domain-generalization","task_name":"Domain Generalization"},{"task_slug":"object-categorization","task_name":"Object Categorization"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/domain-generalization-on-pacs-2","task":"Domain Generalization","dataset":"PACS","model":"BestSources (Alexnet)","rank_in_archive_order":122,"of":133,"metrics":{"Average Accuracy":"70.30"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1806.05810","atlas_url":"https://app.syntology.ai/?focus=1806.05810","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":"1806.05810"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1806.05810\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1806.05810"},"call":"get_concepts_for_paper(arxiv_id=\"1806.05810\")"}],"by_repo":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"02fe9bba3bb7692acc1ade5faa2abacb2cd91924a88b8ad4dd7ec0f596732494","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}