atlas

Research map / Probabilistic and scientific modeling / Treatment effects

Learning Representations of Instruments for Partial Identification of Treatment Effects

ICML 2025 · Probabilistic and scientific modeling › Treatment effects · approach: Meta-learners and partial identification · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Learns a neural discrete partitioning of complex (high-dimensional, continuous) instruments to yield valid and tight partial-identification bounds on the CATE with binary treatments, avoiding adversarial training.

Problem

Estimating valid and informative bounds on the conditional average treatment effect from observational data with unobserved confounding, when instruments are complex (continuous, high-dimensional, e.g. genetic data) rather than discrete or binary.

Approach

Map instruments to a discrete latent representation via a Gumbel-softmax neural partitioner, then compute closed-form discrete-instrument CATE bounds on top of it; the representation is trained end-to-end to minimize bound width while a regularizer keeps partition probabilities above a threshold to control finite-sample variance.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Learn the instrument representation to tighten bounds rather than use k-means discretizationCATE bounds method · Dataset 2width: 1.34 ± 0.19 -> 1.13 ± 0.19 (k=2); 1.28 ± 0.20 -> 1.15 ± 0.31 (k=3)Helped
Learn the instrument representation to tighten bounds rather than use k-means discretizationCATE bounds method · Dataset 3width: 1.96 ± 0.05 -> 1.87 ± 0.05 (k=2); 1.91 ± 0.03 -> 1.87 ± 0.08 (k=4); 1.74 ± 0.26 -> 1.85 ± 0.06 (k=6)Helped
Learn the instrument representation to tighten bounds rather than use k-means discretizationCATE bounds method · Dataset 1width: 1.62 ± 0.06 -> 1.01 ± 0.05 (k=2); 0.83 ± 0.16 -> 1.09 ± 0.04 (k=3)Mixed
Learn representations with the proposed method rather than k-means discretizationCATE bounds method · Dataset 1MSD(k): 0.28 ± 0.06 -> 0.03 ± 0.03Helped
Learn representations with the proposed method rather than k-means discretizationCATE bounds method · Dataset 2MSD(k): 0.09 ± 0.06 -> 0.06 ± 0.06Helped
Learn representations with the proposed method rather than k-means discretizationCATE bounds method · Dataset 3MSD(k): 0.10 ± 0.10 -> 0.03 ± 0.02Helped
Vary the number of discretizations from k=2 to k=3 (ablation)Naïve CATE bounds · Dataset 1width: 1.62 ± 0.06 -> 0.83 ± 0.16Helped
Vary the number of discretizations from k=2 to k=3 (ablation)Ours CATE bounds · Dataset 1width: 1.01 ± 0.05 -> 1.09 ± 0.04Hurt
Vary the number of discretizations from k=2 to k=3 (ablation)Naïve CATE bounds · Dataset 2width: 1.34 ± 0.19 -> 1.28 ± 0.20Helped
Vary the number of discretizations from k=2 to k=3 (ablation)Ours CATE bounds · Dataset 2width: 1.13 ± 0.19 -> 1.15 ± 0.31Hurt
Add the auxiliary guidance lossRepresentation network · Training stabilitytraining stabilityHelped

Surprising findings

Limitations

Experimental setup

Datasets: Simulated Dataset 1 (1D continuous polygenic-risk-style instrument) Simulated Dataset 2 (complex propensity score) Simulated Dataset 3 (20 binary SNP-like instruments)

Benchmarks: Simulated Datasets 1-3

Metrics: coverage average bound width mean squared difference across k (MSD) MSE vs oracle bounds

Baselines: Naive k-means discretization followed by discrete-IV bounds

Builds on: closed-form partial identification bounds for discrete instruments (Balke-Pearl Gumbel-softmax

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy