Image de couverture de livre

On the Efficiency of Sinkhorn-Knopp for Entropically Regularized Optimal Transport

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	He, Kun
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Phase transition of the Sinkhorn-Knopp algorithm
par: He, Kun
Publié: (2025)

Sinkhorn Algorithm for Sequentially Composed Optimal Transports
par: Watanabe, Kazuki, et autres
Publié: (2024)

Optimal Dimension-Free Sampling for Regularized Classification
par: Alishahi, Meysam, et autres
Publié: (2026)

Importance Sparsification for Sinkhorn Algorithm
par: Li, Mengyu, et autres
Publié: (2023)

Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods
par: Li, Gen, et autres
Publié: (2023)

Robust Learning with Optimal Error
par: Blanc, Guy
Publié: (2026)

Near-Optimal Algorithms for Omniprediction
par: Okoroafor, Princewill, et autres
Publié: (2025)

On Computing Optimal Tree Ensembles
par: Komusiewicz, Christian, et autres
Publié: (2023)

Instance-Optimal Uniformity Testing and Tracking
par: Blanc, Guy, et autres
Publié: (2025)

Towards Optimal Robustness in Learning-Augmented Paging
par: Chen, Peng, et autres
Publié: (2026)

Optimal Clustering with Dependent Costs in Bayesian Networks
par: Wu, Paul Pao-Yen, et autres
Publié: (2023)

Optimal Algorithms for Augmented Testing of Discrete Distributions
par: Aliakbarpour, Maryam, et autres
Publié: (2024)

Optimal Kernel Orchestration for Tensor Programs with Korch
par: Hu, Muyan, et autres
Publié: (2024)

The Many Faces of Optimal Weak-to-Strong Learning
par: Høgsgaard, Mikael Møller, et autres
Publié: (2024)

Optimal hypersurface decision trees
par: He, Xi
Publié: (2025)

Optimal Prediction-Augmented Algorithms for Testing Independence of Distributions
par: Aliakbarpour, Maryam, et autres
Publié: (2026)

Dynamic Consistent $k$-Center Clustering with Optimal Recourse
par: Forster, Sebastian, et autres
Publié: (2024)

Optimal Approximate Matrix Multiplication over Sliding Windows
par: Yao, Ziqi, et autres
Publié: (2025)

Overcoming Brittleness in Pareto-Optimal Learning-Augmented Algorithms
par: Angelopoulos, Spyros, et autres
Publié: (2024)

A Simple Approximation Algorithm for Optimal Decision Tree
par: Zhuo, Zhengjia, et autres
Publié: (2025)

Optimal Approximation -- Smoothness Tradeoffs for Soft-Max Functions
par: Epasto, Alessandro, et autres
Publié: (2020)

Towards Optimal Differentially Private Regret Bounds in Linear MDPs
par: Sahu, Sharan
Publié: (2025)

Optimal Sketching for Residual Error Estimation for Matrix and Vector Norms
par: Li, Yi, et autres
Publié: (2024)

Near-Optimal Regret for Efficient Stochastic Combinatorial Semi-Bandits
par: Ye, Zichun, et autres
Publié: (2025)

Online Algorithms for Repeated Optimal Stopping: Balancing Baseline Guarantees and Regret
par: Harada, Tsubasa, et autres
Publié: (2025)

Private Edge Density Estimation for Random Graphs: Optimal, Efficient and Robust
par: Chen, Hongjie, et autres
Publié: (2024)

Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel
par: Chen, Yixin, et autres
Publié: (2021)

Optimal bounds for $\ell_p$ sensitivity sampling via $\ell_2$ augmentation
par: Munteanu, Alexander, et autres
Publié: (2024)

Ads that Stick: Near-Optimal Ad Optimization through Psychological Behavior Models
par: Darmasubramanian, Kailash Gopal, et autres
Publié: (2025)

Optimal Variance and Covariance Estimation under Differential Privacy in the Add-Remove Model and Beyond
par: Takakura, Shokichi, et autres
Publié: (2025)

Improved Robust Estimation for Erdős-Rényi Graphs: The Sparse Regime and Optimal Breakdown Point
par: Chen, Hongjie, et autres
Publié: (2025)

Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap
par: Karpov, Nikolai, et autres
Publié: (2025)

Dynamic Spectral Clustering with Provable Approximation Guarantee
par: Laenen, Steinar, et autres
Publié: (2024)

On the query complexity of sampling from non-log-concave distributions
par: He, Yuchen, et autres
Publié: (2025)

An efficient, provably optimal algorithm for the 0-1 loss linear classification problem
par: He, Xi, et autres
Publié: (2023)

Proper decision trees: An axiomatic framework for solving optimal decision tree problems with arbitrary splitting rules
par: He, Xi, et autres
Publié: (2025)

Dynamic Similarity Graph Construction with Kernel Density Estimation
par: Laenen, Steinar, et autres
Publié: (2025)

Understanding Memory-Regret Trade-Off for Streaming Stochastic Multi-Armed Bandits
par: He, Yuchen, et autres
Publié: (2024)

Online Sparsification of Bipartite-Like Clusters in Graphs
par: Das, Joyentanuj, et autres
Publié: (2025)

Structure-Aware Spectral Sparsification via Uniform Edge Sampling
par: He, Kaiwen, et autres
Publié: (2025)