{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/itsa-an-information-theoretic-approach-to","title":"ITSA: An Information-Theoretic Approach to Automatic Shortcut Avoidance and Domain Generalization in Stereo Matching Networks","arxiv_id":"2201.02263","date":"2022-01-06","proceeding":"CVPR 2022 1","authors":["WeiQin Chuah","Ruwan Tennakoon","Reza Hoseinnezhad","Alireza Bab-Hadiashar","David Suter"],"abstract":"State-of-the-art stereo matching networks trained only on synthetic data often fail to generalize to more challenging real data domains. In this paper, we attempt to unfold an important factor that hinders the networks from generalizing across domains: through the lens of shortcut learning. We demonstrate that the learning of feature representations in stereo matching networks is heavily influenced by synthetic data artefacts (shortcut attributes). To mitigate this issue, we propose an Information-Theoretic Shortcut Avoidance~(ITSA) approach to automatically restrict shortcut-related information from being encoded into the feature representations. As a result, our proposed method learns robust and shortcut-invariant features by minimizing the sensitivity of latent features to input variations. To avoid the prohibitive computational cost of direct input sensitivity optimization, we propose an effective yet feasible algorithm to achieve robustness. We show that using this method, state-of-the-art stereo matching networks that are trained purely on synthetic data can effectively generalize to challenging and previously unseen real data scenarios. Importantly, the proposed method enhances the robustness of the synthetic trained networks to the point that they outperform their fine-tuned counterparts (on real data) for challenging out-of-domain stereo datasets.","url_abs":"https://arxiv.org/abs/2201.02263v2","url_pdf":"https://arxiv.org/pdf/2201.02263v2.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":"itsa-an-information-theoretic-approach-to","repo_url":"https://github.com/waychin-weiqin/itsa","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"domain-generalization","task_name":"Domain Generalization"},{"task_slug":"sensitivity","task_name":"Sensitivity"},{"task_slug":"stereo-matching-1","task_name":"Stereo Matching"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":"https://app.syntology.ai/?focus=2201.02263","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.02263"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/waychin-weiqin/itsa","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"deterministic:regex_extraction","url":"https://github.com/waychin-weiqin/ITSA","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":4},"by_repo_kind":{"listed":{"samples":4,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"efa35e1f9f5549f0","entry":"cfnet","repo":"waychin-weiqin/ITSA","repo_kind":"listed","path":"models/CFNet/stackhourglass.py","file_url":"https://github.com/waychin-weiqin/ITSA/blob/HEAD/models/CFNet/stackhourglass.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"efa35e1f9f5549f0"}},{"code_sha256_prefix":"ecbfc6e3f99073d6","entry":"feature_extraction","repo":"waychin-weiqin/ITSA","repo_kind":"listed","path":"models/CFNet/stackhourglass.py","file_url":"https://github.com/waychin-weiqin/ITSA/blob/HEAD/models/CFNet/stackhourglass.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"ecbfc6e3f99073d6"}},{"code_sha256_prefix":"acda6ac790578411","entry":"hourglass","repo":"waychin-weiqin/ITSA","repo_kind":"listed","path":"models/CFNet/stackhourglass.py","file_url":"https://github.com/waychin-weiqin/ITSA/blob/HEAD/models/CFNet/stackhourglass.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"acda6ac790578411"}},{"code_sha256_prefix":"d6dfd4b2f83b0d43","entry":"hourglassup","repo":"waychin-weiqin/ITSA","repo_kind":"listed","path":"models/CFNet/stackhourglass.py","file_url":"https://github.com/waychin-weiqin/ITSA/blob/HEAD/models/CFNet/stackhourglass.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"d6dfd4b2f83b0d43"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}