Error Probability Bounds for Invariant Causal Prediction via Multiple Access Channels

08/19/2023
by   Austin Goddard, et al.
0

We consider the problem of lower bounding the error probability under the invariant causal prediction (ICP) framework. To this end, we examine and draw connections between ICP and the zero-rate Gaussian multiple access channel by first proposing a variant of the original invariant prediction assumption, and then considering a special case of the Gaussian multiple access channel where a codebook is shared between an unknown number of senders. This connection allows us to develop three types of lower bounds on the error probability, each with different assumptions and constraints, leveraging techniques for multiple access channels. The proposed bounds are evaluated with respect to existing causal discovery methods as well as a proposed heuristic method based on minimum distance decoding.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/29/2022

Lower Bounds on the Error Probability for Invariant Causal Prediction

It is common practice to collect observations of feature and response pa...
research
12/17/2020

Trellis Code Error Exponent From Results for Asynchronous Multiple Access Channels

An asynchronous multiple access error exponent result implicates a new r...
research
07/30/2020

A Second-Order Converse Bound for the Multiple-Access Channel via Wringing Dependence

A new converse bound is presented for the two-user multiple-access chann...
research
06/22/2022

Beating the Sum-Rate Capacity of the Binary Adder Channel with Non-Signaling Correlations

We address the problem of coding for multiple-access channels (MACs) wit...
research
02/20/2018

Achievability Bounds for T-Fold Irregular Repetition Slotted ALOHA Scheme in the Gaussian Multiple Access Channel

We address the problem of massive random access for an uncoordinated Gau...
research
07/11/2019

Error Exponents for Asynchronous Multiple Access Channels. Controlled Asynchronism may Outperform Synchronism

Exponential error bounds are derived for frame-asynchronous discrete mem...
research
09/25/2019

Power-Imbalanced Low-Density Signatures (LDS) From Eisenstein Numbers

As a special case of sparse code multiple access (SCMA), low-density sig...

Please sign up or login with your details

Forgot password? Click here to reset