Learning sufficient low-dimensional structures through conditional optimal transport

Kaiqiang Alan Zeng, Efstathia Bura

Abstract

Sufficient dimension reduction seeks a low-dimensional covariate representation that preserves the conditional law of a response. We introduce SDR-COT, which represents that law by conditional optimal transport from an independent reference response. On separable Hilbert spaces, sufficiency forces the response component of the optimal triangular map to factor through the reduction. For quadratic cost, the induced interpolation has a Borel current-state velocity on every truncated time interval, without global injectivity of the terminal map, and this velocity has the same factorisation. These results motivate a conditional-flow-matching criterion. For linear reductions, we prove consistency using a suitably tuned relaxed empirical coupling. Euclidean responses are treated through slicewise Caffarelli bounds; Hilbert-valued responses are treated through Gaussian Sobolev regularity, interpolation compression and uniqueness of a Gaussian continuity equation. Numerical studies with Euclidean and functional data show competitive performance, especially when sufficient information is not solely contained in the conditional mean.

Disclosure

“Acknowledgements The authors used ChatGPT and Claude to assist in checking the internal consistency of the mathematical proofs and in reviewing and improving the accompanying implementation code. All AI-generated suggestions were independently evaluated by the authors. The authors”

PDF page 43
Classification
Proof ideas or individual proof-step assistance
Multiplier
8
Verified

Structural counts

Pages 53 pdf
Theorems 4 source
Lemmas 8 source
Propositions 15 source
Corollaries 1 source
Definitions 17 source
Displayed equations 321 source
Bibliography entries 182 source
Appendix pages 22 estimated

Count notes

  • Source counts use the expanded primary TeX file main.tex.
  • Appendix pages include the first PDF page with an explicit Appendix heading through the final page.