Cover Image

Accelerating Sinkhorn Algorithm with Sparse Newton Iterations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Tang, Xun, Shavlovsky, Michael, Rahmanian, Holakou, Tardini, Elisa, Thekumparampil, Kiran Koshy, Xiao, Tesi, Ying, Lexing
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Sinkhorn-type Algorithm for Constrained Optimal Transport
by: Tang, Xun, et al.
Published: (2024)

COS-DPO: Conditioned One-Shot Multi-Objective Fine-Tuning Framework
by: Ren, Yinuo, et al.
Published: (2024)

An efficient algorithm for entropic optimal transport under martingale-type constraints
by: Tang, Xun, et al.
Published: (2025)

Multi-Objective Optimization via Wasserstein-Fisher-Rao Gradient Flow
by: Ren, Yinuo, et al.
Published: (2023)

PINS: Proximal Iterations with Sparse Newton and Sinkhorn for Optimal Transport
by: Wu, Di, et al.
Published: (2025)

ConMeZO: Adaptive Descent-Direction Sampling for Gradient-Free Finetuning of Large Language Models
by: Behric, Lejs Deen, et al.
Published: (2025)

DPZero: Private Fine-Tuning of Language Models without Backpropagation
by: Zhang, Liang, et al.
Published: (2023)

Zeroth-Order Optimization Finds Flat Minima
by: Zhang, Liang, et al.
Published: (2025)

Comparing Few to Rank Many: Active Human Preference Learning using Randomized Frank-Wolfe
by: Thekumparampil, Kiran Koshy, et al.
Published: (2024)

A note on continuous-time online learning
by: Ying, Lexing
Published: (2024)

On Sinkhorn's Algorithm and Choice Modeling
by: Qu, Zhaonan, et al.
Published: (2023)

Importance Sparsification for Sinkhorn Algorithm
by: Li, Mengyu, et al.
Published: (2023)

Nested Stochastic Algorithm for Generalized Sinkhorn distance-Regularized Distributionally Robust Optimization
by: Yang, Yufeng, et al.
Published: (2025)

Sinkhorn Distributionally Robust Optimization
by: Wang, Jie, et al.
Published: (2021)

Higher-Order Newton Methods with Polynomial Work per Iteration
by: Ahmadi, Amir Ali, et al.
Published: (2023)

A Generalized Sinkhorn Algorithm for Mean-Field Schrödinger Bridge
by: Eldesoukey, Asmaa, et al.
Published: (2026)

Probabilistic Iterative Hard Thresholding for Sparse Learning
by: Bergamaschi, Matteo, et al.
Published: (2024)

Convergence Rate of the Last Iterate of Stochastic Proximal Algorithms
by: Vaidyan, Kevin Kurian Thomas, et al.
Published: (2026)

Sparse-ProxSkip: Accelerated Sparse-to-Sparse Training in Federated Learning
by: Meinhardt, Georg, et al.
Published: (2024)

Inertial Newton Algorithms Avoiding Strict Saddle Points
by: Castera, Camille
Published: (2021)

Annealed Sinkhorn for Optimal Transport: convergence, regularization path and debiasing
by: Chizat, Lénaïc
Published: (2024)

Non-Convex Robust Hypothesis Testing using Sinkhorn Uncertainty Sets
by: Wang, Jie, et al.
Published: (2024)

Sinkhorn algorithms and linear programming solvers for optimal partial transport problems
by: Bai, Yikun
Published: (2024)

Stochastic Variance-Reduced Newton: Accelerating Finite-Sum Minimization with Large Batches
by: Dereziński, Michał
Published: (2022)

Inference of Online Newton Methods with Nesterov's Accelerated Sketching
by: Wang, Haoxuan, et al.
Published: (2026)

A Multi-objective Newton Optimization Algorithm for Hyper-Parameter Search
by: Xu, Qinwu
Published: (2024)

An Iteratively Reweighted Method for Sparse Optimization on Nonconvex $\ell_{p}$ Ball
by: Wang, Hao, et al.
Published: (2021)

Pretrained deep models outperform GBDTs in Learning-To-Rank under label scarcity
by: Hou, Charlie, et al.
Published: (2023)

An Adaptive Stochastic Gradient Method with Non-negative Gauss-Newton Stepsizes
by: Orvieto, Antonio, et al.
Published: (2024)

RewardRank: Optimizing True Learning-to-Rank Utility
by: Bhatt, Gaurav, et al.
Published: (2025)

Iterative Regularization with k-support Norm: An Important Complement to Sparse Recovery
by: de Vazelhes, William, et al.
Published: (2023)

Error whitening: Why Gauss-Newton outperforms Newton
by: McKay, Maricela Best, et al.
Published: (2026)

Nonconvex Optimization Framework for Group-Sparse Feedback Linear-Quadratic Optimal Control: Penalty Approach
by: Feng, Lechen, et al.
Published: (2025)

Alternating Iteratively Reweighted $\ell_1$ and Subspace Newton Algorithms for Nonconvex Sparse Optimization
by: Wang, Hao, et al.
Published: (2024)

Nonconvex Optimization Framework for Group-Sparse Feedback Linear-Quadratic Optimal Control: Non-Penalty Approach
by: Feng, Lechen, et al.
Published: (2025)

Distributionally Robust Optimization via Iterative Algorithms in Continuous Probability Spaces
by: Zhu, Linglingzhi, et al.
Published: (2024)

Sinkhorn doubly stochastic attention rank decay analysis
by: Lapenna, Michela, et al.
Published: (2026)

Efficient Low-rank Identification via Accelerated Iteratively Reweighted Nuclear Norm Minimization
by: Wang, Hao, et al.
Published: (2024)

Hilbert's projective metric for functions of bounded growth and exponential convergence of Sinkhorn's algorithm
by: Eckstein, Stephan
Published: (2023)

A Specialized Semismooth Newton Method for Kernel-Based Optimal Transport
by: Lin, Tianyi, et al.
Published: (2023)