Searcharxiv⌕ Search

arXiv subjects

Venkatkrishna Karumanchi

Publications and source records attributed to Venkatkrishna Karumanchi.

2 recordsLinked to original sources

Probabilistic Representation and Convergence of Gromov-Wasserstein Gradient Flows

Wasserstein gradient flows are intimately connected with evolution partial differential equations and diffusion processes. We take the first step in developing such connections for inner product Gromov--Wasserstein (IGW) gradient flows by studying the IGW gradient flow of the relative entropy $\mathsf{H}(\cdot\|γ)$ with respect to the standard Gaussian measure $γ$. We first show that $\mathsf{H}(\cdot\|γ)$ fails to be $λ$-convex along generalized or modified generalized IGW geodesics for any $λ\in \mathbb{R}$, and therefore falls outside the scope of the existing IGW gradient flow theory from Zhang et al. (2026). We bridge this gap by establishing a suitable \emph{local} convexity estimate that enables the construction of the gradient flow and its extension to the infinite time horizon. We then obtain increasingly explicit representations of the resulting dynamics. Starting from a partial integro-differential equation, we derive a nonlinear Fokker--Planck equation and show that its second-moment dynamics decouple from the law as they satisfy an autonomous matrix ODE. This reduces the IGW dynamics to a linear, time-inhomogeneous Fokker--Planck equation, yielding a probabilistic representation as the time-marginal flow of a linear stochastic differential equation resembling the Ornstein--Uhlenbeck process. Finally, we study its asymptotic behavior by establishing exponential convergence of the flow to $γ$ in relative entropy.

math.PR↗

Approximation Analysis of the Entropic Penalty in Quadratic Programming

Quadratic assignment problems are a fundamental class of combinatorial optimization problems which are ubiquitous in applications, yet their exact resolution is NP-hard. To circumvent this impasse, it was proposed to regularize such problems via an entropic penalty, leading to computationally tractable proxies. Indeed, this enabled efficient algorithms, notably in the context of Gromov-Wasserstein (GW) problems, but it is unknown how well solutions of the regularized problem approximate those of the original one for small regularization parameters. Treating the broader framework of general quadratic programs (QPs), we establish that the approximation gap decays exponentially quickly for concave QPs, while the rate for general indefinite or convex QPs can be as slow as linear. Our analysis builds on the study of the entropic penalty in linear programming by leveraging a new representation for concave QPs, which connects them to a family of linear programs with varying costs. Building on these results, we design an algorithm which, given a local solution of the entropic QP, returns a candidate minimizer of the original QP and certifies it. We apply these findings to a general class of discrete GW problems, yielding new variational forms and the first exponentially vanishing entropic approximation bound in the GW literature.

math.OC↗