Cover Image

A semiconcavity approach to stability of entropic plans and exponential convergence of Sinkhorn's algorithm

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chiarini, Alberto, Conforti, Giovanni, Greco, Giacomo, Tamanini, Luca
Format:	Preprint
Published:	2024
Subjects:	Probability Optimization and Control Machine Learning 49Q22, 68Q87, 68W40, 60E15, 90C25
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Hessian stability and convergence rates for entropic and Sinkhorn potentials via semiconcavity
by: Greco, Giacomo, et al.
Published: (2025)

Analysis of multivariate symbol statistics in primitive rational models
by: Goldwurm, Massimiliano, et al.
Published: (2026)

Stochastic Mirror Descent for Convex Optimization with Consensus Constraints
by: Borovykh, Anastasia, et al.
Published: (2022)

Non-asymptotic convergence bounds for Sinkhorn iterates and their gradients: a coupling approach
by: Greco, Giacomo, et al.
Published: (2023)

Quantitative contraction rates for Sinkhorn's algorithm: beyond bounded costs and compact marginals
by: Conforti, Giovanni, et al.
Published: (2023)

On the power of linear programming for K-means clustering
by: De Rosa, Antonio, et al.
Published: (2024)

Sharp threshold for network recovery from voter model dynamics
by: Du, Hang, et al.
Published: (2025)

Optimal phase change for a generalized Grover's algorithm
by: Cardullo, Christopher, et al.
Published: (2025)

Dimension-free estimators of gradients of functions with(out) non-independent variables
by: Lamboni, Matieyendou
Published: (2025)

Computing the probability of intersection
by: Barvinok, Alexander
Published: (2025)

The ratio-cut polytope and K-means clustering
by: De Rosa, Antonio, et al.
Published: (2020)

Runtime Analyses of NSGA-III on Many-Objective Problems
by: Opris, Andre, et al.
Published: (2024)

Achieving Tight $O(4^k)$ Runtime Bounds on Jump$_k$ by Proving that Genetic Algorithms Evolve Near-Maximal Population Diversity
by: Opris, Andre, et al.
Published: (2024)

A First Runtime Analysis of the PAES-25: An Enhanced Variant of the Pareto Archived Evolution Strategy
by: Opris, Andre
Published: (2025)

Optimal Hardness of Online Algorithms for Large Independent Sets
by: Gamarnik, David, et al.
Published: (2025)

On Approximating the Potts Model with Contracting Glauber Dynamics
by: He, Roxanne, et al.
Published: (2024)

Planting and MCMC Sampling from the Potts model
by: Galanis, Andreas, et al.
Published: (2024)

Low-temperature Sampling on Sparse Random Graphs
by: Galanis, Andreas, et al.
Published: (2025)

Algorithms for Generating Small Random Samples
by: Cicirello, Vincent A.
Published: (2024)

The Algorithmic Phase Transition in Correlated Spiked Models
by: Li, Zhangsong
Published: (2025)

A non-iterative polynomial algorithm for linear programming
by: Jing-Yuan, Wei
Published: (2013)

Generating DDPM-based Samples from Tilted Distributions
by: Mandal, Himadri, et al.
Published: (2026)

The random $k$-SAT Gibbs uniqueness threshold revisited
by: Chatterjee, Arnab, et al.
Published: (2025)

A study of the Antlion Random Walk
by: Narimatsu, Akihiro, et al.
Published: (2025)

Near-Optimal Bootstrapping of Hitting Sets for Algebraic Models
by: Kumar, Mrinal, et al.
Published: (2018)

Improved Computational Lower Bound of Estimation for Multi-Frequency Group Synchronization
by: Li, Zhangsong
Published: (2026)

Approximation and generalization properties of the random projection classification method
by: Boutin, Mireille, et al.
Published: (2021)

General Signature Kernels
by: Cass, Thomas, et al.
Published: (2021)

Formal Foundations for Controlled Stochastic Activity Networks
by: Movaghar, Ali
Published: (2025)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
by: Chen, Zongchen, et al.
Published: (2022)

Visualizing Shape Functionals via Sinkhorn Multidimensional Scaling
by: Yachimura, Toshiaki, et al.
Published: (2024)

Resident fitness computation in linear time and other algorithmic aspects of interacting trajectories
by: Friedl, Katalin, et al.
Published: (2025)

Polynomial Identity Testing via Evaluation of Rational Functions
by: Hu, Ivan, et al.
Published: (2022)

A new lower bound for deterministic pop-stack-sorting
by: Bauer, Morgan, et al.
Published: (2023)

Random $2$-SAT: The set of atoms of the limiting empirical marginal distribution
by: Müller, Noela, et al.
Published: (2024)

Parameterized Complexity of Stationarity Testing for Piecewise-Affine Functions and Shallow CNN Losses
by: Ye, Yuhan
Published: (2026)

CompressedScaffnew: The First Theoretical Double Acceleration of Communication from Local Training and Compression in Distributed Optimization
by: Condat, Laurent, et al.
Published: (2022)

Topological structure and a polynomial-time solution of linear programming over the real numbers
by: Wei, Jing-Yuan
Published: (2018)

The discrete Laplace asymptotic method and its application to the 3XOR satisfiability problem
by: Hughes, Jared A., et al.
Published: (2025)

Exactness and Effective Degree Bound of Lasserre's Relaxation for Polynomial Optimization over Finite Variety
by: Hua, Zheng, et al.
Published: (2021)