Sinkhorn Linearization and the Spectral Proxy: Unifying the Statistical and Algorithmic Theory of Feature-Parameterized Inverse Optimal Transport via a Single Spectral Sandwich
- URL: http://arxiv.org/abs/2608.13201v1
- Date: Thu, 13 Aug 2026 13:03:55 GMT
- Title: Sinkhorn Linearization and the Spectral Proxy: Unifying the Statistical and Algorithmic Theory of Feature-Parameterized Inverse Optimal Transport via a Single Spectral Sandwich
- Abstract summary: We develop the statistical and algorithmic theory of inverse optimal transport (IOT)<n>The Sinkhorn linearization -- the implicit sensitivity-function of the entropic OT plan to the cost -- is the core technical contribution.
- Score: 10.786420126901485
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We develop the statistical and algorithmic theory of inverse optimal transport (IOT) under the feature-parameterized cost C_theta(i,j) = -theta^T phi(i,j). The core technical contribution is the Sinkhorn linearization -- the implicit-function sensitivity of the entropic OT plan to the cost -- together with its spectral proxy, a formula that is spectrally exact yet geometrically transparent. The restricted Hessian on the tangent space satisfies the spectral sandwich (pi_min/epsilon) I <= H_T^{-1} <= (pi_max/epsilon) I, yielding the single core bound sigma_min >= (pi_min/(a_max epsilon)) sqrt(lambda_min(Sigma)) that drives the entire theory. On this core we establish four theorems and one observation. T1 (identifiability): theta is globally injective on the quotient of the gauge kernel, with dimension bound F <= (K-1)^2. T2 (sparsistency): the l1-penalized estimator recovers the true support under irrepresentability and score concentration, with exponential failure probability. T3 (well-posedness): the feature-moment map M(theta) = Phi^T x_theta is strongly monotone, and the inverse is Lipschitz with constant L <= epsilon ||Phi^T S_a||_op / (pi_min lambda_min(Sigma)). T4 (convergence): local strong convexity with mu >= pi_min^2 lambda_min(Sigma) / epsilon^2 guarantees monotone gradient descent convergence. O5 (misspecification): the estimator converges to the OT-model projection of the truth; the Holder continuity of the projection map is assessed numerically, yielding setting-dependent empirical exponents alpha_eff in (0,1).
Related papers
- Uniformly Stable Minimal Weyl--Heisenberg Measurements Approaching the SIC Benchmark [2.5735476569508995]
Informational completeness (IC) guarantees that an inverse exists, not that it is statistically well conditioned.<n>For minimal rank-one Weyl--Heisenberg measurements, covariance makes the nonidentity projector-Gram spectrum proportional to the fiducial's ambiguity intensities.<n>A balanced one-coordinate perturbation repairs the zero ambiguity axis of a cubic Alltop state, gives an attained floor uniformly bounded below by a positive constant, and confines the entire nonidentity spectrum to ([L_q,U_q]) with (U_q/L_qto1
arXiv Detail & Related papers (2026-08-12T09:41:26Z) - Ancilla-Depth Phase Diagrams for Quantum Reference-Frame Comparison [0.0]
For finite-dimensional channels A and B with invertible A, we show that exact simulation of all measurements assisted by an r-dimensional ancilla is equivalent to r-positivity of the unique factor Gamma = BA-1.<n>Results quantify the distinction between ancilla-restricted statistical simulation and implementation by a single quantum channel.
arXiv Detail & Related papers (2026-07-14T16:35:26Z) - Spectral Kernel Dynamics via Maximum Caliber: Fixed Points, Geodesics, and Phase Transitions [0.0]
We derive a closed-form geometric functional for kernel dynamics on finite graphs by applying the Maximum Caliber (MaxCal) variational principle.<n>The framework is grounded in a structural analogy with Einstein's field equations, used as a guiding template rather than an established equivalence.
arXiv Detail & Related papers (2026-04-10T06:22:17Z) - Conservation Law Breaking at the Edge of Stability: A Spectral Theory of Non-Convex Neural Network Optimization [0.0]
We show that gradient descent reliably finds good solutions in non-dimensional network optimization.<n>We identify two regimes separated by a width-dependent dynamical transition.<n>All predictions are validated across 23 experiments.
arXiv Detail & Related papers (2026-04-08T10:41:24Z) - Tripartite information of free fermions: a universal entanglement coefficient from the sine kernel [51.56484100374058]
We study the tripartite information I_3 of free fermions on two-dimensional lattices partitioned into three adjacent strips of width w.<n>We find that g(z) has a unique zero at z* = 1.329 +/- 0.001: modes with k_F w z* violate monogamy of mutual information.<n>Two exact cancellations -- of the z ln z area-law terms and of the z2 terms -- are intrinsic to the I_3 combination.
arXiv Detail & Related papers (2026-03-03T15:39:35Z) - Kernel-based off-policy estimation without overlap: Instance optimality
beyond semiparametric efficiency [53.90687548731265]
We study optimal procedures for estimating a linear functional based on observational data.
For any convex and symmetric function class $mathcalF$, we derive a non-asymptotic local minimax bound on the mean-squared error.
arXiv Detail & Related papers (2023-01-16T02:57:37Z) - Convergence rate of the (1+1)-evolution strategy on locally strongly convex functions with lipschitz continuous gradient [10.31411804947731]
Evolution strategy (ES) is one of the promising classes of algorithms for black-box continuous optimization.<n>In this study, an upper bound and a lower bound of the rate of linear convergence of the (1+1)-ES on locally $L$-strongly convex functions with $U$-Lipschitz continuous gradient are derived.
arXiv Detail & Related papers (2022-09-26T07:16:50Z) - On parametric resonance in the laser action [91.3755431537592]
We consider the selfconsistent semiclassical Maxwell--Schr"odinger system for the solid state laser.
We introduce the corresponding Poincar'e map $P$ and consider the differential $DP(Y0)$ at suitable stationary state $Y0$.
arXiv Detail & Related papers (2022-08-22T09:43:57Z) - Optimal policy evaluation using kernel-based temporal difference methods [78.83926562536791]
We use kernel Hilbert spaces for estimating the value function of an infinite-horizon discounted Markov reward process.
We derive a non-asymptotic upper bound on the error with explicit dependence on the eigenvalues of the associated kernel operator.
We prove minimax lower bounds over sub-classes of MRPs.
arXiv Detail & Related papers (2021-09-24T14:48:20Z) - The Convergence Indicator: Improved and completely characterized
parameter bounds for actual convergence of Particle Swarm Optimization [68.8204255655161]
We introduce a new convergence indicator that can be used to calculate whether the particles will finally converge to a single point or diverge.
Using this convergence indicator we provide the actual bounds completely characterizing parameter regions that lead to a converging swarm.
arXiv Detail & Related papers (2020-06-06T19:08:05Z) - Spectral density estimation with the Gaussian Integral Transform [91.3755431537592]
spectral density operator $hatrho(omega)=delta(omega-hatH)$ plays a central role in linear response theory.
We describe a near optimal quantum algorithm providing an approximation to the spectral density.
arXiv Detail & Related papers (2020-04-10T03:14:38Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.