On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,932 papers · 148 categories

Trend · papers per month

count % of corpus

2 results for “APDAMD”

On the Efficiency of Entropic Regularized Algorithms for Optimal Transportcs.DS

Improved algorithms for optimal transport with better complexity bounds.

problem Efficiency of algorithms for solving optimal transport problems.

method Greenkhorn, APDAMD, and accelerated Sinkhorn algorithms with improved complexity bounds.

result Improved complexity bounds for Greenkhorn, APDAMD, and accelerated Sinkhorn algorithms.

Optimal Transport Greenkhorn APDAMD Sinkhorn Complexity

2019-06-01abs ↗pdf ↗

Fast Algorithms for Computational Optimal Transport and Wasserstein Barycentercs.DS

New algorithms improve computation of optimal transport and Wasserstein barycenter.

problem Computing optimal transport and Wasserstein barycenter for multiple probability distributions.

method Introduced APDRCD and APDGCD algorithms for efficient computation, demonstrating better performance than existing methods.

result New algorithms match or exceed the best known complexities for OT problems and improve practical performance.

optimal transport Wasserstein barycenter coordinate descent distributed algorithms complexity analysis

2019-05-23abs ↗pdf ↗