Skip to content

Chaos Is a LADDER: Domain Generalization Beyond Invariance via Reweighting

Jul 2026 · arXiv.org · Vol abs/2607.26458 · 0 citations
Mathematics Computer Science

Abstract

Domain generalization (DG) aims to learn from multiple source domains and generalize to unseen target domains. Most DG methods pursue invariance: they seek a causal representation whose prediction rule is invariant across domains. This principle is effective when the causal mechanism is stable, but becomes restrictive when the domain itself modulates how causal content maps to the response. In this case, directly feeding domain style into the predictor can create misleading shortcuts, since style does not by itself cause the response. Yet the apparent chaos of multiple styles can become a ladder: style can locate the unseen target domain among source domains and guide which domain-dependent prediction rules should be trusted. We propose \emph{Latent Adaptive Domain Disentanglement and Environment Reweighting} (LADDER), a fixed-model DG pipeline that learns causal/style representations, freezes the encoders, fits source-specific classifiers, and uses an unlabeled target-domain covariate set only at inference to compute weights over these fixed classifiers, with no target labels or model-state updates. We establish theoretical guarantees for source reweighting and validate LADDER on simulations, FMoW, and a location-grouped iWildCam protocol, with gains in overall and group-averaged accuracy.

View source

Similar papers

Sep 2026

Enhancing Practical Domain Generalization via Partially Shared Features.

A new DG framework is introduced that focuses on learning partially shared features (PSFs)-features shared among subsets of source domains, which contain and generalize ESFs, which contain and generalize ESFs.

Zeng-Mao Wang, Qi-Zhou Wang, Chao-Yang Zhou et al. · 0 citations
Book Open access Aug 2026

Causal Structure-guided Distributionally Robust Optimization under Domain Shifts

Causal Structure-guided DRO (CS-DRO) is proposed, which estimates a directed acyclic graph (DAG) that encodes the predictive relationships between representations and labels, serving as a proxy for causal structure shared across source domains.

Seonggyeom Kim, Eunjung Choi, Dong-Kyu Chae · 0 citations
#artificial intelligence Preprint Sep 2026

Which Tasks Survive Self-Supervised Learning?

Same-instance self-supervised learning (SSL) learns representations by enforcing consistency across two views of the same underlying instance. This principle alone, however, does not determine which downstream tasks remain recoverable from the learned representation. We study this question through \emph{semantic recove...

Achleshwar Luthra, Lucas Bryant, T. Zhu et al. · 0 citations
#natural language process... Preprint Sep 2026

Lingtai: What Concept Geometry Reveals--and Does Not Reveal--About LLM Inference

Observing what a large language model computes during autoregressive inference--online and without training probes--remains difficult. We introduce Lingtai, a training-free concept telemetry layer: at each generation step, residual states are projected onto a domain-specific bank of named concept anchors, constructed w...

Jian-Gang Chen · 0 citations
#artificial intelligence Preprint Oct 2026

Structure-agnostic Causal Representation Learning

SaCRL is introduced, a framework that jointly identifies the causal structure and learns the corresponding invariant representation without prior structural knowledge, and provides theoretical guarantees for structure identification, including under random-feature approximation, invariance satisfaction, and out-of-dist...

Arman Behnam, Bing-Hui Wang · 2 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.