PAC Generalization via Invariant Representations
Advait Parulekar, Karthikeyan Shanmugam, Sanjay Shakkottai

TL;DR
This paper develops PAC-based theoretical guarantees for invariant representations in linear SEMs, ensuring out-of-distribution robustness with finite samples and approximate invariance, even with latent variables.
Contribution
It introduces a PAC learning framework for approximate invariance in linear SEMs, providing probabilistic out-of-distribution guarantees without faithfulness assumptions.
Findings
Finite-sample OOD guarantees for approximate invariance.
Bounds independent of ambient dimension with restricted intervention sites.
Extension to models with latent variables.
Abstract
One method for obtaining generalizable solutions to machine learning tasks when presented with diverse training environments is to find \textit{invariant representations} of the data. These are representations of the covariates such that the best model on top of the representation is invariant across training environments. In the context of linear Structural Equation Models (SEMs), invariant representations might allow us to learn models with out-of-distribution guarantees, i.e., models that are robust to interventions in the SEM. To address the invariant representation problem in a {\em finite sample} setting, we consider the notion of -approximate invariance. We study the following question: If a representation is approximately invariant with respect to a given number of training interventions, will it continue to be approximately invariant on a larger collection of unseen…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsMachine Learning and Data Classification · Machine Learning and Algorithms · Neural Networks and Applications
