Lower Bounds on the Error Probability for Invariant Causal Prediction

06/29/2022
by   Austin Goddard, et al.
0

It is common practice to collect observations of feature and response pairs from different environments. A natural question is how to identify features that have consistent prediction power across environments. The invariant causal prediction framework proposes to approach this problem through invariance, assuming a linear model that is invariant under different environments. In this work, we make an attempt to shed light on this framework by connecting it to the Gaussian multiple access channel problem. Specifically, we incorporate optimal code constructions and decoding methods to provide lower bounds on the error probability. We illustrate our findings by various simulation settings.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/19/2023

Error Probability Bounds for Invariant Causal Prediction via Multiple Access Channels

We consider the problem of lower bounding the error probability under th...
research
08/22/2022

Learning Invariant Representations under General Interventions on the Response

It has become increasingly common nowadays to collect observations of fe...
research
02/02/2022

Invariant Ancestry Search

Recently, methods have been proposed that exploit the invariance of pred...
research
01/29/2021

Lower Bounds on Information Requirements for Causal Network Inference

Recovery of the causal structure of dynamic networks from noisy measurem...
research
12/17/2021

Balancing Fairness and Robustness via Partial Invariance

The Invariant Risk Minimization (IRM) framework aims to learn invariant ...
research
03/12/2020

Invariant Causal Prediction for Block MDPs

Generalization across environments is critical to the successful applica...
research
01/14/2023

Generalized Invariant Matching Property via LASSO

Learning under distribution shifts is a challenging task. One principled...

Please sign up or login with your details

Forgot password? Click here to reset