English

Causal Representation Learning with Optimal Compression under Complex Treatments

Machine Learning 2026-05-05 v2 Methodology

Abstract

Estimating Individual Treatment Effects (ITE) in multi-treatment scenarios faces two critical challenges: the Hyperparameter Selection Dilemma for balancing weights and the Curse of Dimensionality in computational scalability. This paper derives a novel multi-treatment generalization bound and proposes a theoretical estimator for the optimal balancing weight α\alpha, eliminating expensive heuristic tuning. We investigate three balancing strategies: Pairwise, One-vs-All (OVA), and Treatment Aggregation. While OVA achieves superior precision in low-dimensional settings, our proposed Treatment Aggregation ensures both accuracy and O(1) scalability as the treatment space expands. Furthermore, we extend our framework to a generative architecture, Multi-Treatment CausalEGM, which preserves the Wasserstein geodesic structure of the treatment manifold. Experiments on semi-synthetic and image datasets demonstrate that our approach significantly outperforms traditional models in estimation accuracy and efficiency, particularly in large-scale intervention scenarios.

Keywords

Cite

@article{arxiv.2603.11907,
  title  = {Causal Representation Learning with Optimal Compression under Complex Treatments},
  author = {Wanting Liang and Haoang Chi and Zhiheng Zhang},
  journal= {arXiv preprint arXiv:2603.11907},
  year   = {2026}
}
R2 v1 2026-07-01T11:16:41.459Z