Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 57 min ago
PreprintCC BY-NC-ND 4.0arXiv

Sliced Lp Distributional Balancing

Abstract

A popular class of causal inference methods addresses confounding through weighting, which reweights treated and control groups to balance their covariate distributions without using outcome information, thereby preserving a design-based perspective. In this paper, we propose sliced Lp distributional balancing (SLDB), a family indexed by p∈[1,∞) that measures imbalance by averaging squared Lp distances between the cumulative distribution functions of one-dimensional linear projections. The Cramér--Wold device ensures that this criterion identifies equality of multivariate distributions, while projection reduces its computation to sorting-based one-dimensional operations. Because our method lies outside the maximum mean discrepancy (MMD) framework underlying many existing distributional balancing methods, their theoretical and computational tools do not directly apply. We therefore develop a computationally efficient projected subgradient descent algorithm for estimating balancing weights, offering improved computational complexity over MMD-based methods. Furthermore, we establish a novel theoretical framework for SLDB-based causal effect estimation and prove, under suitable conditions, root-n consistency and asymptotic normality, with the asymptotic variance attaining the semiparametric efficiency bound. Finally, we develop inferential procedures that do not require augmentation with an outcome model, thereby retaining the design-based principle. Simulation studies and a real-world application demonstrate that SLDB performs competitively with existing methods.

Related

  1. Weighted Spline-Expanded Networks with Distributional Balancing for Continuous Treatment Effects
    Shucheng Liu, Chan Park, Guanhua Chen
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  2. Distributional Balancing with Machine Learning for Clinical Trial Augmentation Using Real-World Data
    Zern Ke, Mingshi Cui, Gemma Moran +1
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  3. λ-geodesic convexity of the squared sliced-Wasserstein distance
    Giacomo Cozzi, Filippo Santambrogio
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsOptimisation & controlarXiv
  4. Spherical Harmonic Sliced Wasserstein Displacement Interpolation for Acoustic Source and Reflection Density Modeling
    Yuancheng Luo
    arXivPreprintCC BY 4.0Full textOptimisation & controlProbabilityarXiv
  5. Fast rigid rotational alignment of voxelized 3-D density maps in sliced Wasserstein distance
    Oscar Mickelin, Yunpeng Shi, Amit Singer +1
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
BibTeX
@misc{zhang2026sliced,
  title = {{Sliced $L^p$ Distributional Balancing}},
  author = {Haoran Zhang and Guanhua Chen and Chan Park},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.09600},
  eprint = {2609.09600},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.09600},
  note = {CC BY-NC-ND 4.0},
}
RIS
TY  - UNPB
TI  - Sliced L^p Distributional Balancing
AU  - Haoran Zhang
AU  - Guanhua Chen
AU  - Chan Park
PY  - 2026
DA  - 2026/09/27
PB  - arXiv
DO  - 10.48550/arxiv.2609.09600
UR  - https://arxiv.org/abs/2609.09600
AB  - A popular class of causal inference methods addresses confounding through weighting, which reweights treated and control groups to balance their covariate distributions without using outcome information, thereby preserving a design-based perspective. In this paper, we propose sliced L^p distributional balancing (SLDB), a family indexed by p∈[1,∞) that measures imbalance by averaging squared L^p distances between the cumulative distribution functions of one-dimensional linear projections. The Cramér--Wold device ensures that this criterion identifies equality of multivariate distributions, while projection reduces its computation to sorting-based one-dimensional operations. Because our method lies outside the maximum mean discrepancy (MMD) framework underlying many existing distributional balancing methods, their theoretical and computational tools do not directly apply. We therefore develop a computationally efficient projected subgradient descent algorithm for estimating balancing weights, offering improved computational complexity over MMD-based methods. Furthermore, we establish a novel theoretical framework for SLDB-based causal effect estimation and prove, under suitable conditions, root-n consistency and asymptotic normality, with the asymptotic variance attaining the semiparametric efficiency bound. Finally, we develop inferential procedures that do not require augmentation with an outcome model, thereby retaining the design-based principle. Simulation studies and a real-world application demonstrate that SLDB performs competitively with existing methods.
ER  -