Imagen de Portada

Sinkhorn Algorithm for Sequentially Composed Optimal Transports

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Watanabe, Kazuki, Isobe, Noboru
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Machine Learning Numerical Analysis
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On the Robustness of the Successive Projection Algorithm
por: Barbarino, Giovanni, et al.
Publicado: (2024)

Optimal Embedding Dimension for Sparse Subspace Embeddings
por: Chenakkod, Shabarish, et al.
Publicado: (2023)

Optimal Oblivious Subspace Embeddings with Near-optimal Sparsity
por: Chenakkod, Shabarish, et al.
Publicado: (2024)

Optimal Subspace Embeddings: Resolving Nelson-Nguyen Conjecture Up to Sub-Polylogarithmic Factors
por: Chenakkod, Shabarish, et al.
Publicado: (2025)

On the Efficiency of Sinkhorn-Knopp for Entropically Regularized Optimal Transport
por: He, Kun
Publicado: (2026)

Distributed Least Squares in Small Space via Sketching and Bias Reduction
por: Garg, Sachin, et al.
Publicado: (2024)

Black-Box $k$-to-$1$-PCA Reductions: Theory and Applications
por: Jambulapati, Arun, et al.
Publicado: (2024)

Accelerating Power Method with Fast Sketching for Stronger Low-Rank Approximation
por: Chenakkod, Shabarish, et al.
Publicado: (2026)

Query Efficient Structured Matrix Learning
por: Amsel, Noah, et al.
Publicado: (2025)

Arithmetical Binary Decision Tree Traversals
por: Zhang, Jinxiong
Publicado: (2022)

Algorithmic warm starts for Hamiltonian Monte Carlo
por: Zhang, Matthew S., et al.
Publicado: (2026)

Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure
por: Dereziński, Michał, et al.
Publicado: (2025)

Algorithms and data structures for automatic precision estimation of neural networks
por: Netay, Igor V.
Publicado: (2025)

Fine-grained Analysis and Faster Algorithms for Iteratively Solving Linear Systems
por: Dereziński, Michał, et al.
Publicado: (2024)

Convergence of a L2 regularized Policy Gradient Algorithm for the Multi Armed Bandit
por: Anita, Stefana, et al.
Publicado: (2024)

Well-Conditioned Oblivious Perturbations in Linear Space
por: Chenakkod, Shabarish, et al.
Publicado: (2026)

Analysis of Different Algorithmic Design Techniques for Seam Carving
por: Aijaz, Owais, et al.
Publicado: (2024)

Algorithms and data structures for numerical computations with automatic precision estimation
por: Netay, Igor V.
Publicado: (2024)

Structural Optimal Jacobian Accumulation and Minimum Edge Count are NP-Complete Under Vertex Elimination
por: Bentert, Matthias, et al.
Publicado: (2025)

Probability Tools for Sequential Random Projection
por: Li, Yingru
Publicado: (2024)

Faster Linear Systems and Matrix Norm Approximation via Multi-level Sketched Preconditioning
por: Dereziński, Michał, et al.
Publicado: (2024)

Shifted Composition III: Local Error Framework for KL Divergence
por: Altschuler, Jason M., et al.
Publicado: (2024)

Randomized Kaczmarz Methods with Beyond-Krylov Convergence
por: Dereziński, Michał, et al.
Publicado: (2025)

Towards Universal Convergence of Backward Error in Linear System Solvers
por: Dereziński, Michał, et al.
Publicado: (2026)

Solving Dense Linear Systems Faster Than via Preconditioning
por: Dereziński, Michał, et al.
Publicado: (2023)

Iterative Refinement for $\ell_p$-norm Regression
por: Adil, Deeksha, et al.
Publicado: (2019)

On computing and the complexity of computing higher-order $U$-statistics, exactly
por: Chen, Xingyu, et al.
Publicado: (2025)

Lower bounds for trace estimation via Block Krylov and other methods
por: Yu, Shi Jie
Publicado: (2025)

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

Private Low-Rank Approximation for Covariance Matrices, Dyson Brownian Motion, and Eigenvalue-Gap Bounds for Gaussian Perturbations
por: Mangoubi, Oren, et al.
Publicado: (2025)

Phase transition of the Sinkhorn-Knopp algorithm
por: He, Kun
Publicado: (2025)

Stochastic Rounding 2.0, with a View towards Complexity Analysis
por: Drineas, Petros, et al.
Publicado: (2024)

The Lanczos algorithm for matrix functions: a handbook for scientists
por: Chen, Tyler
Publicado: (2024)

Near-optimal hierarchical matrix approximation from matrix-vector products
por: Chen, Tyler, et al.
Publicado: (2024)

Fixed-sparsity matrix approximation from matrix-vector products
por: Amsel, Noah, et al.
Publicado: (2024)

Sublinear Time Low-Rank Approximation of Toeplitz Matrices
por: Musco, Cameron, et al.
Publicado: (2024)

Finer-Grained Hardness of Kernel Density Estimation
por: Alman, Josh, et al.
Publicado: (2024)

Complex Mean and Variance of Linear Regression Model for High-Noised Systems by Kriging
por: Suslo, Tomasz
Publicado: (2005)

Stability of the Lanczos Method for Matrix Function Approximation
por: Musco, Cameron, et al.
Publicado: (2017)

Linear Systems and Eigenvalue Problems: Open Questions from a Simons Workshop
por: Amsel, Noah, et al.
Publicado: (2026)