Median-Normalized Weak Pushforward Potential Training
Implementation & benchmark of arXiv:2608.00649 — Empirical optimal transport potentials: fast rates and a functional central limit theorem
Source paper: Empirical optimal transport potentials: fast rates and a functional central limit theorem arXiv:2608.00649 ⓘ · analyzed Aug 31, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Represent the quadratic OT potential with a strongly convex input-convex neural network and train it by matching the distribution of its gradient pushforward to the target distribution in a weak dual metric. Median-center the potential on every minibatch so that optimization does not waste capacity or suffer instability from the additive constant ambiguity. The paper's stability inequality predicts that this can produce a more stable potential estimate than directly optimizing a transport-map loss, especially in low dimensions.
Formulas
Mathematical statement
The central result is the stability inequality from Theorem 2.1: for a strongly convex C^{3,\alpha} potential \varphi and any lower-semicontinuous convex candidate \widetilde{\varphi}, \|\varphi-\widetilde{\varphi}-\operatorname{med}(\varphi-\widetilde{\varphi})\|_{L^1(\mu)}\le C\,\mathfrak{d}(\widetilde{
u},
u), where \mu is the fixed absolutely continuous source distribution,
u=(
abla\varphi)_{\#}\mu is the target distribution, \widetilde{
u}=(
abla\widetilde{\varphi})_{\#}\mu is the candidate pushforward, \operatorname{med}(f) is any median of f under \mu, and C depends on the regularity and strong-convexity constants. The discrepancy \mathfrak{d} is a weak dual norm of the signed measure \widetilde{
u}-
u; for an implementable adaptation use the empirical IPM d_H(P,Q)=\sup_{\|h\|_H\le1}|\mathbb{E}_{P}h-\mathbb{E}_{Q}h|, with H an RKHS or a bounded Sobolev test-function class. Strong convexity is enforced by writing \widetilde{\varphi}_{ heta}(x)=\frac{m}{2}\|x\|^2+g_{ heta}(x), with m>0 and g_ heta convex, so
abla^2\widetilde{\varphi}_{ heta}\succeq mI. The transferable property is control of the potential modulo constants by a weak distribution discrepancy, not the slower direct bound by W_2(\widetilde{
u},
u).
Implementation notes
1. Integration point: replace the usual OT map or critic parameterization with an input-convex neural network (ICNN) potential. For source minibatch X={x_i} sampled from μ, compute p_i=∇_x φ_θ(x_i); these are the generated target samples. Use target minibatch Y={y_i} from ν. The training loss is an MMD or Sobolev-IPM between {p_i} and {y_i}, with the potential evaluated only for median normalization and diagnostics. A simple RKHS choice is a mixture of Gaussian kernels k_σ, giving MMD²(P,Q)=mean k(p_i,p_j)+mean k(y_i,y_j)-2 mean k(p_i,y_j). 2. Pseudocode: initialize φ_θ(x)=m||x||²/2+g_θ(x), where g_θ is an ICNN; for each step sample X,Y; compute p=grad_x φ_θ(X); compute median c=median_i φ_θ(x_i); optionally use centered values φ_θ(X)-c; compute MMD²(p,Y); backpropagate through the input gradient and update θ with AdamW. Keep m fixed initially, then optionally learn m through m=softplus(a)+m_min. 3. The paper supplies the median-invariant L1 stability target and the requirement of strong convexity. The weak metric, kernel bandwidths, and minibatch estimator are engineering choices; estimate bandwidth by the median pairwise distance in the target batch and use several bandwidths to avoid scale sensitivity. Monitor the smallest Hessian eigenvalue only on a validation grid or estimate strong monotonicity from gradient pairs: min_{i
e j}(p_i-p_j)^T(x_i-x_j)/||x_i-x_j||². 4. First experiment: use μ=N(0,I_d), ν generated by a known smooth strongly convex potential in d=2 and d=4, and compare against an unconstrained MLP map trained with W2-style pair matching and an ICNN trained with ordinary MMD. At equal parameter count and gradient evaluations, measure centered L1 potential error, pushforward MMD, map W2 error, and loss variance over seeds. Success means lower centered potential error and smoother convergence at equal target-sample budget, with no increase in pushforward discrepancy; test whether the advantage weakens as d grows, consistent with the paper's dimension-dependent rates.
Verification
This idea has not been verified yet.
Verification happens in two stages: Stage 1 — a mechanism check on a toy system confirms the claimed mathematical phenomenon reproduces; Stage 2 — a benchmark implements the idea on a real (small) neural network task and compares it against a tuned baseline over 8 paired seeds with a permutation test.
Artifacts
Artifacts unavailable.