Sharp Poincaré Interpolation Along Wasserstein Geodesics
arXiv:2607.10769
2026
Regularization
1 ideas extracted · analyzed Aug 30, 2026
What the math gives to ML
The paper provides an endpoint-to-interpolation principle: strong log-concavity at two endpoint distributions yields a sharp Poincare bound for every intermediate Wasserstein distribution, without requiring curvature control of the intermediate density. The transferable asset is the linear interpolation of the Poincare scale, rather than the Poincare constant itself, together with a guarantee for arbitrary test functions. A practical neural-network use is to train on coupled Wasserstein interpolants and penalize violations of the resulting variance-versus-input-Jacobian inequality, producing a path-wise stability regularizer whose coefficient is determined only from endpoint concentration estimates.
Ideas from this paper
Unverified
2026
Construct intermediate training examples along an optimal-transport coupling between two strongly log-concave endpoint distributions, and regularize the network so that its output variance on each intermediate distribution is no larger than the sharp endpoint-interpolated Poincare scale times its expected input-Jacobian energy. This converts the paper's distributional inequality into a path-wise smoothness constraint for logits, embeddings, or scalar losses.
Useful6/10
Difficulty5/10
Novelty7/10