# Dimension-Free Brenier Transport Layer

- ID: 2378
- Canonical URL: https://synthcore.org/idea/2378/dimension-free-brenier-transport-layer
- API JSON: https://synthcore.org/api/idea/2378.json
- API Markdown: https://synthcore.org/api/idea/2378.md
- Verification status: mech_ok_no_baseline
- Source: [arXiv:2608.15906](https://arxiv.org/abs/2608.15906)
- Category: architecture
- Solves: stability, accuracy, sample-efficiency
- ML areas: vae, normalization, diffusion
- Math tags: optimal-transport, convex-analysis, geometry
- Ratings: usefulness 7/10; difficulty 6/10; novelty 7/10

## Idea description

Build a neural transport layer by parameterizing a convex potential whose gradient maps a semi-log-concave latent distribution into a compact convex data domain. Use the paper's dimension-free Lipschitz certificate to set the layer's Jacobian scale, initialize the potential, and reject or regularize parameter updates that create excessive curvature. The goal is a bounded-output transport module that is less sensitive to latent dimension than diameter-based spectral heuristics.

## Mathematical statement

Let the source probability measure be d\mu(x)=Z_\mu^{-1}e^{-V(x)}dx on \mathbb{R}^d, where V is finite and Z_\mu=\int e^{-V(x)}dx. Let Q\succ0 be symmetric positive definite and assume x\mapsto \frac12\langle Qx,x\rangle-V(x) is convex; in the smooth case this means 
abla^2V(x)\preceq Q. Let 
u be a compactly supported log-concave probability measure with support K, and let \Phi be the convex Brenier potential transporting \mu to 
u via T(x)=
abla\Phi(x). For a direction v, define the support width w_K(v)=\sup_{y\in K}\langle y,v\rangle-\inf_{y\in K}\langle y,v\rangle. The theorem gives the distributional directional Hessian bound \partial_{vv}\Phi\le 0.587\sqrt{\langle Qv,v\rangle}\,w_K(v). Consequently, T has a globally Lipschitz representative with \operatorname{Lip}(T)\le0.587\sqrt{\|Q\|_{op}}\operatorname{diam}(K), where \|Q\|_{op} is the largest eigenvalue of Q and \operatorname{diam}(K)=\sup_{y,z\in K}|y-z|. The neural adaptation uses this as a target upper bound for the Jacobian operator norm.

## Key formulas

- $$x\longmapsto\frac{1}{2}\langle Qx,x\rangle-V(x)\ \text{is convex}$$
- $$w_K(v):=\sup_{y\in K}\langle y,v\rangle-\inf_{y\in K}\langle y,v\rangle$$
- $$\partial_{vv}\Phi\leq 0.587\sqrt{\langle Qv,v\rangle}\,w_K(v)$$
- $$\operatorname{Lip}(\nabla\Phi)\leq 0.587\sqrt{\|Q\|_{\mathrm{op}}}\,\operatorname{diam}(K)$$

## Implementation notes

(1) Integration point: use this as the final latent-to-data map in a convex-potential normalizing flow or VAE decoder. Parameterize \Phi_    heta(x)=\frac12|x|^2+f_    heta(x) with an input-convex neural network, so T_    heta(x)=
abla\Phi_    heta(x) is monotone. Assume a latent Gaussian with covariance \Sigma; set Q=\Sigma^{-1}, or estimate a conservative Q from the latent density. Choose a known compact convex output domain K, such as [-1,1]^d or a data bounding box. (2) Pseudocode: sample latent x; compute T=grad_x(Phi_theta(x)); estimate J=jacobian(T,x) on a small probe batch; set L*=0.587*sqrt(lambda_max(Q))*diam(K); optimize the task or transport loss plus lambda*relu(||J||_2-L*)^2. For tighter anisotropic control, sample unit directions v and penalize relu(v^T J v-0.587*sqrt(v^T Q v)*width_K(v))^2. Optionally rescale the final map by L*/max(estimated Jacobian norm,L*) during initialization. (3) The theorem supplies the constant 0.587 and the target bound; Jacobian norms, empirical widths for non-box K, and approximation errors are estimated numerically. (4) First experiment: train a 2D/8D convex-potential OT map from Gaussian latents to a uniform distribution on a box or convex polygon, comparing an unconstrained ICNN, spectral-normalized ICNN, and this curvature-capped version. Measure transport cost, maximum Jacobian norm, exploding-gradient frequency, and held-out likelihood or reconstruction error. Success is lower worst-case Jacobian and fewer unstable runs at equal transport cost, without dimension-dependent degradation as d increases.

## Verification

- Status: mech_ok_no_baseline
- Mechanism evidence: yes
- Mechanism confirmed: yes
- Practical verdict: no_effect
- Verdict: Built a reproducible certificate check and a small PyTorch projected-update transport experiment. The analytic product Brenier map had supremum Jacobian 0.797885, below the directional certificate 1.174 in d=1,2,8; projected optimization maintained zero post-update cap violations while the uncapped baseline reached Jacobian 3.92. Final MSE was effectively unchanged between methods (about 0.00123 in d=1, 0.00125 in d=2, and 0.001245 in d=8), so the observed effect is real stability control without toy-task accuracy loss, but not an accuracy improvement.

### Mechanism check

- Verdict: Built a reproducible certificate check and a small PyTorch projected-update transport experiment. The analytic product Brenier map had supremum Jacobian 0.797885, below the directional certificate 1.174 in d=1,2,8; projected optimization maintained zero post-update cap violations while the uncapped baseline reached Jacobian 3.92. Final MSE was effectively unchanged between methods (about 0.00123 in d=1, 0.00125 in d=2, and 0.001245 in d=8), so the observed effect is real stability control without toy-task accuracy loss, but not an accuracy improvement.
- Confidence: 7/10
- Limitations: The neural map is only a one-parameter diagonal tanh surrogate, not a trained input-convex neural network or a general Brenier approximation. The global certificate used diam([-1,1]^d), which grows as sqrt(d), so dimension-free directional behavior was checked analytically but not demonstrated as a learned high-dimensional advantage. No spectral-normalized ICNN, likelihood, reconstruction metric, FLOP comparison, or multi-seed robustness study was run.

### Practical benchmark

- Paired seeds: 8
- Baseline mean: 0
- Idea mean: 0
- p-value: 1
- Paired wins: 0/8
- Benchmark verdict: no measurable effect

## Artifacts

- [bench_experiment.py](https://synthcore.org/code/933/bench_experiment.py)
- [bench_report.json](https://synthcore.org/code/933/bench_report.json)
- [experiment.py](https://synthcore.org/code/933/experiment.py)
- [report.md](https://synthcore.org/code/933/report.md)
- [report_bench_2026-09-02T164110.md](https://synthcore.org/code/933/report_bench_2026-09-02T164110.md)
- [results.json](https://synthcore.org/code/933/results.json)
- [Download all files as ZIP](https://synthcore.org/download/933)

## Disclaimer

AI-generated research hypothesis, automatically tested. Not peer-reviewed.