mlsanityData to 14 Oct 2026

Establishing Boundary KKT Convergence of Mirror Descent through Reparameterization

arXiv 2608.07248 ↗First posted 7 Aug 2026math.OC cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Sequence convergence to a boundary Karush--Kuhn--Tucker (KKT) point has long remained unclear for nonconvex mirror descent with Legendre kernels. The difficulty arises from the blow-up of the gradient of the Legendre kernel at the boundary. Recent work~citedingtoh2026nonkkt shows that mirror descent can accumulate at non-KKT boundary points despite decreasing objective values, precluding a convergence guarantee to KKT points in general. Despite this negative result, mirror descent remains effective in many real applications. Motivated by this contrast, we address the boundary difficulty directly and establish KKT convergence of mirror descent for a broad class of structured nonconvex problems. We analyze mirror descent in reparameterized variables, where the Hessian metric is flattened and remains nondegenerate as the boundary is approached. Under extension and definability conditions jointly coupling the objective, the Legendre kernel, and the feasible region, the reparameterized sequence has finite length and converges, thereby recovering convergence to a KKT point of the original sequence. Our general framework applies to some concrete instances: Shannon entropy, Fermi--Dirac entropy, and power kernels on polyhedron.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 24 of its 39 references that are in the map. First posted on arXiv 7 Aug 2026.

Builds on

24 of 39 references.

References · 24

  1. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
  2. 2018Computational Optimal Transportcited by 780
  3. 2016Relatively-Smooth Convex Optimization by First-Order Methods, and Applicationscited by 108
  4. 2021Linear-Time Gromov Wasserstein Distances using Low Rank Couplings and Costscited by 61
  5. 2022Implicit Bias of Gradient Descent on Reparametrized Models: On Equivalence to Mirror Descentcited by 39
  6. 2017First Order Methods beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problemscited by 37
  7. 2013On the Convergence Properties of Non-Euclidean Extragradient Methods for Variational Inequalities with Generalized Monotone Operatorscited by 29
  8. 2018Hessian Riemannian gradient flows in convex programmingcited by 26
  9. 2018On the Convergence Rate of Stochastic Mirror Descent for Nonsmooth Nonconvex Optimizationcited by 18
  10. 2023A Convergent Single-Loop Algorithm for Relaxation of Gromov-Wasserstein in Graph Datacited by 11
  11. 2018Convergence of the Iterates in Mirror Descent Methodscited by 8
  12. 2018Hessian barrier algorithms for linearly constrained optimization problemscited by 8
12 more
  1. 2017Convergence of the Exponentiated Gradient Method with Armijo Line Searchcited by 7
  2. 2020Curiosities and counterexamples in smooth convex optimizationcited by 7
  3. 2023Nonconvex Stochastic Bregman Proximal Gradient Method with Application to Deep Learningcited by 7
  4. 2024Stochastic Bregman Subgradient Methods for Nonsmooth Nonconvex Optimization Problemscited by 5
  5. 2024Spurious Stationarity and Hardness Results for Bregman Proximal-Type Algorithmscited by 3
  6. 2025On exploration of an interior mirror descent flow for stochastic nonconvex constrained problemcited by 3
  7. 2025A Bregman ADMM for Bethe variational problemcited by 2
  8. 2020Global Convergence of Model Function Based Bregman Proximal Minimization Algorithmscited by 1
  9. 2026Shuffling the Stochastic Mirror Descent via Dual Lipschitz Continuity and Kernel Conditioningcited by 1
  10. 2026Non-KKT Accumulation in Entropic Mirror Descentcited by 1
  11. 2026On the Iterate Convergence of Bregman Projected Gradient Methodcited by 1
  12. 2026A Unified Framework for Iterate Convergence of Bregman Proximal Methodscited by 1

Built on by

Not cited yet.