SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2201.02263 · CVPR · 2022

ITSA: An Information-Theoretic Approach to Automatic Shortcut Avoidance and Domain Generalization in Stereo Matching Networks

David Suter, Ruwan Tennakoon, Reza Hoseinnezhad, Alireza Bab-Hadiashar, WeiQin Chuah

arXiv · PDF · Open in the Atlas

Code that ran

None of the 4 samples (functions and classes) lifted from this paper's linked repositories has a recorded run on a synthesized input (4 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2201.02263.json · badge: /api/ran/2201.02263.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
waychin-weiqin/ITSA community
Papers with Code archive
0 ran · 4 no recorded run
FunctionStatusWhere it lives
cfnet Not yet run
unverified (harvested, no recorded run)
waychin-weiqin/ITSA/models/CFNet/stackhourglass.py
code served (permissive licence) · get_code("efa35e1f9f5549f0")
How it ran

no invocation recorded.

feature_extraction Not yet run
unverified (harvested, no recorded run)
waychin-weiqin/ITSA/models/CFNet/stackhourglass.py
code served (permissive licence) · get_code("ecbfc6e3f99073d6")
How it ran

no invocation recorded.

hourglass Not yet run
unverified (harvested, no recorded run)
waychin-weiqin/ITSA/models/CFNet/stackhourglass.py
code served (permissive licence) · get_code("acda6ac790578411")
How it ran

no invocation recorded.

hourglassup Not yet run
unverified (harvested, no recorded run)
waychin-weiqin/ITSA/models/CFNet/stackhourglass.py
code served (permissive licence) · get_code("d6dfd4b2f83b0d43")
How it ran

no invocation recorded.

Also present in other papers' code

Of 4 samples lifted from this paper's linked repositories, 4 carry a function identity and 0 do not. Of the 4 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 4 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

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 shortcutrelated 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, stateof-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 finetuned counterparts (on real data) for challenging out-ofdomain stereo datasets.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2201.02263")
get_code_for_paper("2201.02263")
have("2201.02263")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2201.02263.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2201.02263.svg)](https://syntology.ai/paper/2201.02263)

Connect an agent — have() is free.