Image de couverture de livre

Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Li, Gen, Chen, Yanxi, Huang, Yu, Chi, Yuejie, Poor, H. Vincent, Chen, Yuxin
Format:	Preprint
Publié:	2023
Sujets:	Machine Learning Data Structures and Algorithms Information Theory Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Entropy Regularization and Faster Decremental Matching in General Graphs
par: Chen, Jiale, et autres
Publié: (2023)

Deriving the Gradients of Some Popular Optimal Transport Algorithms
par: Xie, Fangzhou
Publié: (2025)

An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies
par: Chen, Yike, et autres
Publié: (2024)

Near-Optimal Sample Complexity for MDPs via Anchoring
par: Lee, Jongmin, et autres
Publié: (2025)

Stay or Switch: Competitive Online Algorithms for Energy Plan Selection in Energy Markets with Retail Choice
par: Zhai, Jianing, et autres
Publié: (2019)

Recent Advances in Maximum-Entropy Sampling
par: Fampa, Marcia, et autres
Publié: (2025)

Optimal Micro-Transit Zoning via Clique Generation and Integer Programming
par: Hu, Hins, et autres
Publié: (2025)

Radial Isotropic Position via an Implicit Newton's Method
par: Jambulapati, Arun, et autres
Publié: (2025)

Solving Linear Programs with Fast Online Learning Algorithms
par: Gao, Wenzhi, et autres
Publié: (2021)

Bayesian Optimal Stopping with Maximum Value Knowledge
par: Kleer, Pieter, et autres
Publié: (2025)

Fast and Flexible Flow Decompositions in General Graphs via Dominators
par: Sena, Francisco, et autres
Publié: (2025)

A Multi-Token Coordinate Descent Method for Semi-Decentralized Vertical Federated Learning
par: Valdeira, Pedro, et autres
Publié: (2023)

(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
par: Hunkenschröder, Christoph, et autres
Publié: (2025)

Near-Optimal Dynamic Policies for Joint Replenishment in Continuous/Discrete Time
par: Segev, Danny
Publié: (2025)

Labeling Methods for Partially Ordered Paths
par: Euler, Ricardo, et autres
Publié: (2023)

Optimizing for Fairness in Generalized Kidney Exchange: Theory and Computations
par: Chang, Claire, et autres
Publié: (2026)

Dynamic Curing and Network Design in SIS Epidemic Processes
par: Yi, Yuhao, et autres
Publié: (2022)

The Restricted Inverse Optimal Value Problem under Weighted Bottle-neck Hamming distance on trees
par: Zhang, Qiao, et autres
Publié: (2024)

Beyond Smoothed Analysis: Analyzing the Simplex Method by the Book
par: Bach, Eleon, et autres
Publié: (2025)

Computational complexity of the recoverable robust shortest path problem in acyclic digraphs
par: Kasperski, Adam, et autres
Publié: (2024)

Gap-Free Clustering: Sensitivity and Robustness of SDP
par: Zurek, Matthew, et autres
Publié: (2023)

A First Order Method for Linear Programming Parameterized by Circuit Imbalance
par: Cole, Richard, et autres
Publié: (2023)

Communication-efficient Vertical Federated Learning via Compressed Error Feedback
par: Valdeira, Pedro, et autres
Publié: (2024)

Breaking the Barrier of Self-Concordant Barriers: Faster Interior Point Methods for M-Matrices
par: Vladu, Adrian
Publié: (2025)

Fair Assortment Planning
par: Chen, Qinyi, et autres
Publié: (2022)

Accelerated Approximate Optimization of Multi-Commodity Flows on Directed Graphs
par: Chen, Li, et autres
Publié: (2025)

Vertical Federated Learning with Missing Features During Training and Inference
par: Valdeira, Pedro, et autres
Publié: (2024)

Online Decision Making with Fairness over Time
par: Chen, Rui, et autres
Publié: (2022)

Improved Speed via Regional Fulfillment
par: Hathcock, Daniel, et autres
Publié: (2026)

Continuous Non-monotone DR-submodular Maximization with Down-closed Convex Constraint
par: Chen, Shengminjie, et autres
Publié: (2023)

Extracting Dual Solutions via Primal Optimizers
par: Carmon, Yair, et autres
Publié: (2024)

The Lovász Theta Function for Recovering Planted Clique Covers and Graph Colorings
par: Hou, Jiaxin, et autres
Publié: (2023)

Polyamorous Scheduling
par: Gąsieniec, Leszek, et autres
Publié: (2024)

Accelerating Proximal Gradient Descent via Silver Stepsizes
par: Bok, Jinho, et autres
Publié: (2024)

3.415-Approximation for Coflow Scheduling via Iterated Rounding
par: Rohwedder, Lars, et autres
Publié: (2025)

Improved $\ell_{p}$ Regression via Iteratively Reweighted Least Squares
par: Ene, Alina, et autres
Publié: (2025)

Resource-Constrained Joint Replenishment via Power-of-$m^{1/k}$ Policies
par: Segev, Danny
Publié: (2026)

Economic Warehouse Lot Scheduling: Approximation Schemes via Efficiently-Representable DP-Encoded Policies
par: Segev, Danny
Publié: (2026)

TSP integrality gap via 2-edge-connected multisubgraph problem under coincident IP optima
par: Yamanaka, Toshiaki
Publié: (2025)

Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
par: Su, Yuexin, et autres
Publié: (2026)