{"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/learning-robust-representations-by-projecting-1","title":"Learning Robust Representations by Projecting Superficial Statistics Out","arxiv_id":"1903.06256","date":"2019-03-02","proceeding":"ICLR 2019 5","authors":["Haohan Wang","Zexue He","Zachary C. Lipton","Eric P. Xing"],"abstract":"Despite impressive performance as evaluated on i.i.d. holdout data, deep\nneural networks depend heavily on superficial statistics of the training data\nand are liable to break under distribution shift. For example, subtle changes\nto the background or texture of an image can break a seemingly powerful\nclassifier. Building on previous work on domain generalization, we hope to\nproduce a classifier that will generalize to previously unseen domains, even\nwhen domain identifiers are not available during training. This setting is\nchallenging because the model may extract many distribution-specific\n(superficial) signals together with distribution-agnostic (semantic) signals.\nTo overcome this challenge, we incorporate the gray-level co-occurrence matrix\n(GLCM) to extract patterns that our prior knowledge suggests are superficial:\nthey are sensitive to the texture but unable to capture the gestalt of an\nimage. Then we introduce two techniques for improving our networks'\nout-of-sample performance. The first method is built on the reverse gradient\nmethod that pushes our model to learn representations from which the GLCM\nrepresentation is not predictable. The second method is built on the\nindependence introduced by projecting the model's representation onto the\nsubspace orthogonal to GLCM representation's. We test our method on the battery\nof standard domain generalization data sets and, interestingly, achieve\ncomparable or better performance as compared to other domain generalization\nmethods that explicitly require samples from the target distribution for\ntraining.","url_abs":"http://arxiv.org/abs/1903.06256v1","url_pdf":"http://arxiv.org/pdf/1903.06256v1.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":"Hex (Alexnet)","rank_in_archive_order":123,"of":133,"metrics":{"Average Accuracy":"70.20"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1903.06256","atlas_url":"https://app.syntology.ai/?focus=1903.06256","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":"1903.06256"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1903.06256\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1903.06256"},"call":"get_concepts_for_paper(arxiv_id=\"1903.06256\")"}],"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":"2b06348d57afe4a54c124ce392dface12dfcce2242766b88121028a3b43ea68a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}