{"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/domain-generalization-with-domain-specific","title":"Domain Generalization with Domain-Specific Aggregation Modules","arxiv_id":"1809.10966","date":"2018-09-28","proceeding":null,"authors":["Antonio D'Innocente","Barbara Caputo"],"abstract":"Visual recognition systems are meant to work in the real world. For this to\nhappen, they must work robustly in any visual domain, and not only on the data\nused during training. Within this context, a very realistic scenario deals with\ndomain generalization, i.e. the ability to build visual recognition algorithms\nable to work robustly in several visual domains, without having access to any\ninformation about target data statistic. This paper contributes to this\nresearch thread, proposing a deep architecture that maintains separated the\ninformation about the available source domains data while at the same time\nleveraging over generic perceptual information. We achieve this by introducing\ndomain-specific aggregation modules that through an aggregation layer strategy\nare able to merge generic and specific information in an effective manner.\nExperiments on two different benchmark databases show the power of our\napproach, reaching the new state of the art in domain generalization.","url_abs":"http://arxiv.org/abs/1809.10966v1","url_pdf":"http://arxiv.org/pdf/1809.10966v1.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-generalization","task_name":"Domain Generalization"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/domain-generalization-on-pacs-2","task":"Domain Generalization","dataset":"PACS","model":"D-SAM-Λ  (Resnet-18)","rank_in_archive_order":91,"of":133,"metrics":{"Average Accuracy":"80.72"},"uses_additional_data":false},{"leaderboard":"/sota/domain-generalization-on-pacs-2","task":"Domain Generalization","dataset":"PACS","model":"D-SAM (Alexnet)","rank_in_archive_order":118,"of":133,"metrics":{"Average Accuracy":"71.20"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1809.10966","atlas_url":"https://app.syntology.ai/?focus=1809.10966","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":"1809.10966"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1809.10966\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1809.10966"},"call":"get_concepts_for_paper(arxiv_id=\"1809.10966\")"}],"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":"b9c4190ca99ed383ee39925908eef83fc8103cd08bc918a6cb55f7522d68f984","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}