Imagen de Portada

PINS: Proximal Iterations with Sparse Newton and Sinkhorn for Optimal Transport

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Wu, Di, Liang, Ling, Yang, Haizhao
Formato:	Preprint
Publicado:	2025
Materias:	Machine Learning Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Accelerating Sinkhorn Algorithm with Sparse Newton Iterations
por: Tang, Xun, et al.
Publicado: (2024)

On the Stochastic (Variance-Reduced) Proximal Gradient Method for Regularized Expected Reward Optimization
por: Liang, Ling, et al.
Publicado: (2024)

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

PNOD: An Efficient Projected Newton Framework for Exact Optimal Experimental Designs
por: Liang, Ling, et al.
Publicado: (2024)

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

Accelerating Multi-Block Constrained Optimization Through Learning to Optimize
por: Liang, Ling, et al.
Publicado: (2024)

A Provably Convergent and Practical Algorithm for Gromov--Wasserstein Optimal Transport
por: Liang, Ling, et al.
Publicado: (2026)

Stochastic Newton Proximal Extragradient Method
por: Jiang, Ruichen, et al.
Publicado: (2024)

Efficient Graph Laplacian Estimation by Proximal Newton
por: Medvedovsky, Yakov, et al.
Publicado: (2023)

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

Curse of Dimensionality in Neural Network Optimization
por: Na, Sanghoon, et al.
Publicado: (2025)

NewVEM: A Newton Vertex Exchange Method for a Class of Constrained Self-Concordant Minimization Problems
por: Liang, Ling, et al.
Publicado: (2024)

Locally Regularized Sparse Graph by Fast Proximal Gradient Descent
por: Sun, Dongfang, et al.
Publicado: (2024)

Sinkhorn Distributionally Robust Optimization
por: Wang, Jie, et al.
Publicado: (2021)

A Proximal Modified Quasi-Newton Method for Nonsmooth Regularized Optimization
por: Diouane, Youssef, et al.
Publicado: (2024)

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

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

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

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

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

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

Proximal Oracles for Optimization and Sampling
por: Liang, Jiaming, et al.
Publicado: (2024)

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

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

Sparse Transformer Architectures via Regularized Wasserstein Proximal Operator with $L_1$ Prior
por: Han, Fuqun, et al.
Publicado: (2025)

Slicing Unbalanced Optimal Transport
por: Bonet, Clément, et al.
Publicado: (2023)

Riemannian Neural Optimal Transport
por: Micheli, Alessandro, et al.
Publicado: (2026)

Decentralized and Equitable Optimal Transport
por: Lau, Ivan, et al.
Publicado: (2024)

Accelerating Sinkhorn for Entropy-Regularized Optimal Transport
por: Xu, Zeyi, et al.
Publicado: (2026)

Heuristic Optimal Transport in Branching Networks
por: Andrecut, M.
Publicado: (2023)

An Optimal Transport Approach for Network Regression
por: Zalles, Alex G., et al.
Publicado: (2024)

Optimal Transport with Tempered Exponential Measures
por: Amid, Ehsan, et al.
Publicado: (2023)

MMD-Regularized Unbalanced Optimal Transport
por: Manupriya, Piyushi, et al.
Publicado: (2020)

Linear Optimal Partial Transport Embedding
por: Bai, Yikun, et al.
Publicado: (2023)

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

Importance Sparsification for Sinkhorn Algorithm
por: Li, Mengyu, et al.
Publicado: (2023)

Variance Reduction and Low Sample Complexity in Stochastic Optimization via Proximal Point Method
por: Liang, Jiaming
Publicado: (2024)

A Sparse Smoothing Newton Method for Solving Discrete Optimal Transport Problems
por: Hou, Di, et al.
Publicado: (2023)

Nonlinear Filtering with Brenier Optimal Transport Maps
por: Al-Jarrah, Mohammad, et al.
Publicado: (2023)

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