Fast computation of optimal transport via entropy-regularized extragradient methods
From MaRDI portal
Cites work
- A distance metric for multidimensional histograms
- A note on overrelaxation in the Sinkhorn algorithm
- Accelerated Bregman Primal-Dual Methods Applied to Optimal Transport and Wasserstein Barycenter Problems
- Algebraic inequalities
- Algorithms for the Assignment and Transportation Problems
- Approximating optimal transport with linear programs
- Area-convexity, _ regularization, and undirected multicommodity flow
- Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling
- Bipartite matching in nearly-linear time on moderately dense graphs
- Computational optimal transport. With applications to data sciences
- Convergence rate of \(\mathcal{O}(1/k)\) for optimistic gradient and extragradient methods in smooth convex-concave saddle point problems
- Cycles in adversarial regularized learning
- Diagonal Equivalence to Matrices with Prescribed Row and Column Sums
- Dual extrapolation and its applications to solving variational inequalities and related problems
- Fast global convergence of natural policy gradient methods with entropy regularization
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- scientific article; zbMATH DE number 3534286 (Why is no real title available?)
- scientific article; zbMATH DE number 3231693 (Why is no real title available?)
- Introduction to nonparametric estimation
- Last-iterate convergence: zero-sum games and constrained min-max optimization
- Learning in games via reinforcement and regularization
- Much faster algorithms for matrix scaling
- Nearly-linear time positive LP solver with faster convergence rate
- On linear convergence of iterative methods for the variational inequality problem
- On the complexity of general matrix scaling and entropy minimization via the RAS algorithm
- On the linear convergence of the multimarginal Sinkhorn algorithm
- Optimal Transport
- Path finding methods for linear programming: solving linear programs in \(\widetilde{O}(\sqrt{rank})\) iterations and faster algorithms for maximum flow
- Policy Mirror Descent for Regularized Reinforcement Learning: A Generalized Framework with Linear Convergence
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Quantal response equilibria for normal form games
- The Sinkhorn–Knopp Algorithm: Convergence and Applications
- Towards optimal running timesfor optimal transport
- Zur Theorie der Gesellschaftsspiele.
This page was built for publication: Fast computation of optimal transport via entropy-regularized extragradient methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6967874)
