Annealed Sinkhorn for Optimal Transport: convergence, regularization path and debiasing
Fuente:
arXiv
Saved in:
| Main Author: | Chizat, Lénaïc |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Sharper Exponential Convergence Rates for Sinkhorn's Algorithm in Continuous Settings
by: Chizat, Lénaïc, et al.
Published: (2024)
by: Chizat, Lénaïc, et al.
Published: (2024)
An Exponentially Converging Particle Method for the Mixed Nash Equilibrium of Continuous Games
by: Wang, Guillaume, et al.
Published: (2022)
by: Wang, Guillaume, et al.
Published: (2022)
Mean-Field Langevin Dynamics for Signed Measures via a Bilevel Approach
by: Wang, Guillaume, et al.
Published: (2024)
by: Wang, Guillaume, et al.
Published: (2024)
Doubly Regularized Entropic Wasserstein Barycenters
by: Chizat, Lénaïc
Published: (2023)
by: Chizat, Lénaïc
Published: (2023)
Local convergence of mean-field Langevin dynamics: from gradient flows to linearly monotone games
by: Wang, Guillaume, et al.
Published: (2026)
by: Wang, Guillaume, et al.
Published: (2026)
A Sinkhorn-type Algorithm for Constrained Optimal Transport
by: Tang, Xun, et al.
Published: (2024)
by: Tang, Xun, et al.
Published: (2024)
PINS: Proximal Iterations with Sparse Newton and Sinkhorn for Optimal Transport
by: Wu, Di, et al.
Published: (2025)
by: Wu, Di, et al.
Published: (2025)
Hilbert's projective metric for functions of bounded growth and exponential convergence of Sinkhorn's algorithm
by: Eckstein, Stephan
Published: (2023)
by: Eckstein, Stephan
Published: (2023)
Sinkhorn Distributionally Robust Optimization
by: Wang, Jie, et al.
Published: (2021)
by: Wang, Jie, et al.
Published: (2021)
Deep linear networks for regression are implicitly regularized towards flat minima
by: Marion, Pierre, et al.
Published: (2024)
by: Marion, Pierre, et al.
Published: (2024)
Accelerating Sinkhorn Algorithm with Sparse Newton Iterations
by: Tang, Xun, et al.
Published: (2024)
by: Tang, Xun, et al.
Published: (2024)
On Sinkhorn's Algorithm and Choice Modeling
by: Qu, Zhaonan, et al.
Published: (2023)
by: Qu, Zhaonan, et al.
Published: (2023)
Quantitative Convergence of Wasserstein Gradient Flows of Kernel Mean Discrepancies
by: Chizat, Lénaïc, et al.
Published: (2026)
by: Chizat, Lénaïc, et al.
Published: (2026)
Quantitative Local Convergence of Mean-Field Stein Variational Gradient Flow
by: Chizat, Lénaïc, et al.
Published: (2026)
by: Chizat, Lénaïc, et al.
Published: (2026)
Non-Convex Robust Hypothesis Testing using Sinkhorn Uncertainty Sets
by: Wang, Jie, et al.
Published: (2024)
by: Wang, Jie, et al.
Published: (2024)
Sinkhorn algorithms and linear programming solvers for optimal partial transport problems
by: Bai, Yikun
Published: (2024)
by: Bai, Yikun
Published: (2024)
Nested Stochastic Algorithm for Generalized Sinkhorn distance-Regularized Distributionally Robust Optimization
by: Yang, Yufeng, et al.
Published: (2025)
by: Yang, Yufeng, et al.
Published: (2025)
Decentralized and Equitable Optimal Transport
by: Lau, Ivan, et al.
Published: (2024)
by: Lau, Ivan, et al.
Published: (2024)
Slicing Unbalanced Optimal Transport
by: Bonet, Clément, et al.
Published: (2023)
by: Bonet, Clément, et al.
Published: (2023)
Riemannian Neural Optimal Transport
by: Micheli, Alessandro, et al.
Published: (2026)
by: Micheli, Alessandro, et al.
Published: (2026)
Accelerating Sinkhorn for Entropy-Regularized Optimal Transport
by: Xu, Zeyi, et al.
Published: (2026)
by: Xu, Zeyi, et al.
Published: (2026)
An Optimal Transport Approach for Network Regression
by: Zalles, Alex G., et al.
Published: (2024)
by: Zalles, Alex G., et al.
Published: (2024)
Heuristic Optimal Transport in Branching Networks
by: Andrecut, M.
Published: (2023)
by: Andrecut, M.
Published: (2023)
Optimal Transport with Tempered Exponential Measures
by: Amid, Ehsan, et al.
Published: (2023)
by: Amid, Ehsan, et al.
Published: (2023)
MMD-Regularized Unbalanced Optimal Transport
by: Manupriya, Piyushi, et al.
Published: (2020)
by: Manupriya, Piyushi, et al.
Published: (2020)
Linear Optimal Partial Transport Embedding
by: Bai, Yikun, et al.
Published: (2023)
by: Bai, Yikun, et al.
Published: (2023)
Neural Simulated Annealing
by: Correia, Alvaro H. C., et al.
Published: (2022)
by: Correia, Alvaro H. C., et al.
Published: (2022)
Importance Sparsification for Sinkhorn Algorithm
by: Li, Mengyu, et al.
Published: (2023)
by: Li, Mengyu, et al.
Published: (2023)
The Hidden Width of Deep ResNets: Tight Error Bounds and Phase Diagram
by: Chizat, Lénaïc
Published: (2025)
by: Chizat, Lénaïc
Published: (2025)
Nonlinear Filtering with Brenier Optimal Transport Maps
by: Al-Jarrah, Mohammad, et al.
Published: (2023)
by: Al-Jarrah, Mohammad, et al.
Published: (2023)
Sinkhorn doubly stochastic attention rank decay analysis
by: Lapenna, Michela, et al.
Published: (2026)
by: Lapenna, Michela, et al.
Published: (2026)
The Ground Cost for Optimal Transport of Angular Velocity
by: Elamvazhuthi, Karthik, et al.
Published: (2025)
by: Elamvazhuthi, Karthik, et al.
Published: (2025)
Displacement smoothness of entropic optimal transport
by: Carlier, Guillaume, et al.
Published: (2022)
by: Carlier, Guillaume, et al.
Published: (2022)
A Generalized Sinkhorn Algorithm for Mean-Field Schrödinger Bridge
by: Eldesoukey, Asmaa, et al.
Published: (2026)
by: Eldesoukey, Asmaa, et al.
Published: (2026)
Multiscale Supervised Unbalanced Optimal Transport Flow Matching
by: Peng, Qiangwei, et al.
Published: (2026)
by: Peng, Qiangwei, et al.
Published: (2026)
Stability of the Monge Map in Semi-Dual Optimal Transport
by: Selitskiy, Anton, et al.
Published: (2026)
by: Selitskiy, Anton, et al.
Published: (2026)
Take It or Leave It: Intent-Controlled Partial Optimal Transport
by: Tripathi, Salil Parth, et al.
Published: (2026)
by: Tripathi, Salil Parth, et al.
Published: (2026)
Scalable Approximate Algorithms for Optimal Transport Linear Models
by: Kacprzak, Tomasz, et al.
Published: (2025)
by: Kacprzak, Tomasz, et al.
Published: (2025)
A Unified Kantorovich Duality for Multimarginal Optimal Transport
by: Cheryala, Yehya, et al.
Published: (2026)
by: Cheryala, Yehya, et al.
Published: (2026)
Bisimulation Metrics are Optimal Transport Distances, and Can be Computed Efficiently
by: Calo, Sergio, et al.
Published: (2024)
by: Calo, Sergio, et al.
Published: (2024)
Similar Items
-
Sharper Exponential Convergence Rates for Sinkhorn's Algorithm in Continuous Settings
by: Chizat, Lénaïc, et al.
Published: (2024) -
An Exponentially Converging Particle Method for the Mixed Nash Equilibrium of Continuous Games
by: Wang, Guillaume, et al.
Published: (2022) -
Mean-Field Langevin Dynamics for Signed Measures via a Bilevel Approach
by: Wang, Guillaume, et al.
Published: (2024) -
Doubly Regularized Entropic Wasserstein Barycenters
by: Chizat, Lénaïc
Published: (2023) -
Local convergence of mean-field Langevin dynamics: from gradient flows to linearly monotone games
by: Wang, Guillaume, et al.
Published: (2026)