cs.LGMay 9, 2026

The Wristband Gaussian Loss: Deterministic, Composable Latents via a Sphere-Interval Decomposition

Authors: Mikhail ParakhinAndré M. CarvalhoPatrick Haluptzok

Abstract

We present the Wristband Gaussian Loss, a deterministic batch loss for Gaussianizing point embeddings without sampling, KL terms, or iterative transport. Each xRdx \in \mathbb{R}^d is mapped to a direction u=x/xu = x/\|x\| and a CDF-transformed radius t=Fχd2(x2)t = F_{χ^2_d}(\|x\|^2) on the wristband Sd1×[0,1]S^{d-1} \times [0,1]. We prove (and machine-verify in Lean~4) that for d2d \ge 2 the pushforward wristband map equals σd1Unif[0,1]σ_{d-1} \otimes \mathrm{Unif}[0,1] iff the source is N(0,Id)\mathcal{N}(0, I_d), and that the Neumann-reflected wristband repulsion energy is uniquely minimized at the uniform target. We compute this reflected-kernel objective in two ways: a nearest three-image pairwise truncation at O(N2d)O(N^2 d), and a spectral Neumann path joining angular and radial Mercer modes (spherical-harmonic and cosine) at O(NdK)O(N d K), with empirically matched gradients. A 1D Wasserstein radial term and a moment penalty serve as finite-sample accelerators with the same optimum, and Monte-Carlo null calibration turns the components into a single standardized statistic. We evaluate direct point-cloud Gaussianization with a calibrated barycentric W2W_2 score: a deterministic Gaussian reference batch is built by recursive Hungarian averaging, with each method reported as a zz-score against same-size Gaussian batches. On the axis-uniform X benchmark, Wristband is competitive in 2D and gives the best 10D score. On a harder radial--angular-copula impostor whose Gaussian radial and angular marginals are correct but dependent, Wristband gives the best 10D and 128D scores. Coupled with learnable-key Euclidean attention and exact invertible flows, the resulting Deterministic Gaussian Autoencoder delivers a Gaussian-latent interface for counterfactual sampling with independent factors and a context/residual construction for dependent factors.

Explore similar work

Jan 29, 2026cs.LG

Relative Wasserstein Angle and the Problem of the W2W_2-Nearest Gaussian Distribution

Understanding the distributional structure of high-dimensional datasets has become an important topic, yet direct visual characterization is difficult. In this work, we develop a geometric framework for characterizing the distributional structure of empirical datasets by quantifying their deviation from the Gaussian family under the geometry induced by optimal transport theory. Building on the cone structure of the relative translation invariant quadratic Wasserstein (RW2)(RW_2) space, we define two geometric quantities---the \emph{relative Wasserstein angle} and the \emph{orthogonal projection distance}---and show that they are well-defined because of the flat geometry of the filling cone between distributional rays. This formulation recasts the problem of measuring deviation from the Gaussian family as an orthogonal projection problem onto the Gaussian cone and reveals that the commonly used moment-matching Gaussian is, in general, not the W2W_2-nearest Gaussian to a non-Gaussian distribution. In one dimension, we derive closed-form expressions for the proposed quantities and extend closed-form expressions to several other location--scale families, including uniform, Laplace, and logistic distributions. In higher dimensions, we develop a numerical approximation method for the proposed quantities based on empirical optimal transport and covariance-shape optimization. Our experimental results show the empirical convergence and stability of the proposed methods and reveal that the RW2RW_2 angle provides a robust and consistent measure of distributional non-Gaussianity. Moreover, these results provide empirical support for its potential use as an indicator of distributional heterogeneity.
Binshuai Wang, Peng Wei
Sep 15, 2026cs.LG

Online Gradient Computation for Warping Gaussian Process Transformations

Warped Gaussian processes (GPs) handle non-Gaussian observations by mapping them into a latent standard GP via a parametric transformation called warping. Existing streaming variants, however, either optimize the warping parameters periodically or sacrifice analytical tractability for a higher model capacity. To bridge this gap, we show that the gradient of the instantaneous negative log-likelihood of a warped GP admits an exact recursive computation. Based on this result, we propose a novel online method for warped GPs that jointly updates the latent GP moments and optimizes the warping parameters.
Emilio Ruiz-Moreno, Konstantinos Slavakis, Baltasar Beferull-Lozano
Jun 6, 2026math.PR

Pointwise Complexity for Gaussian Fields: Upper Envelopes, Algorithmic Lower Bounds, and Separation

We prove a variance-aware pointwise majorizing-measure theorem for centered Gaussian processes. Classical generic chaining characterizes the scalar quantity EsupxTXx\mathbb E\sup_{x\in T}X_x; the theorem here gives a simultaneous high-probability envelope for the entire field. For an ambient prior μμ, the envelope at xx is governed by a pointwise Fernique-Talagrand functional Φμ(x):=04σ(x)log1μ(Bd(x,ε))dε,Φ_μ(x):=\int_0^{4σ(x)}\sqrt{\log\frac{1}{μ(B_d(x,\varepsilon))}}\,d\varepsilon, together with the corresponding Gaussian tail term. The theorem provides a reusable field-level refinement of classical generic chaining and a Gaussian-process counterpart of pointwise empirical-process bounds for deep neural networks. We also record a Bayesian algorithmic lower envelope from the interactive Fano/data-processing principle. For a known prior ππ, an observation channel, and a concrete estimator t^(Y)\widehat t(Y), the lower bound is expressed through the exact ghost small-ball mass EYQπ(Bd(t^(Y),Δ))\mathbb E_{Y\sim Q}π(B_d(\widehat t(Y),Δ)), rather than a worst-case covering number. In Gaussian location experiments, comparison decoders convert Bayes location error into lower bounds on decision-aligned Gaussian ranges. We then construct an elementary example separating the usual Fano relaxation, the Bayesian algorithmic lower envelope, the pointwise Gaussian envelope, and the full-class minimax risk. Together, these results show that algorithmic lower bounds provide local-geometric validations of pointwise complexity for fixed estimators in overparameterized ambient classes, precisely in regimes where classical minimax theory becomes either too coarse or oracle-dependent. This separation can also be recast in minimax language as penalty-range information relaxation, highlighting an important question of algorithmic robustness for classical high-dimensional models and regularized algorithms.
Yunbei Xu