Copertina

Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Li, Gen, Chen, Yanxi, Huang, Yu, Chi, Yuejie, Poor, H. Vincent, Chen, Yuxin
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Machine Learning Data Structures and Algorithms Information Theory Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Entropy Regularization and Faster Decremental Matching in General Graphs
di: Chen, Jiale, et al.
Pubblicazione: (2023)

Deriving the Gradients of Some Popular Optimal Transport Algorithms
di: Xie, Fangzhou
Pubblicazione: (2025)

An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies
di: Chen, Yike, et al.
Pubblicazione: (2024)

Near-Optimal Sample Complexity for MDPs via Anchoring
di: Lee, Jongmin, et al.
Pubblicazione: (2025)

Stay or Switch: Competitive Online Algorithms for Energy Plan Selection in Energy Markets with Retail Choice
di: Zhai, Jianing, et al.
Pubblicazione: (2019)

Recent Advances in Maximum-Entropy Sampling
di: Fampa, Marcia, et al.
Pubblicazione: (2025)

Optimal Micro-Transit Zoning via Clique Generation and Integer Programming
di: Hu, Hins, et al.
Pubblicazione: (2025)

Radial Isotropic Position via an Implicit Newton's Method
di: Jambulapati, Arun, et al.
Pubblicazione: (2025)

Solving Linear Programs with Fast Online Learning Algorithms
di: Gao, Wenzhi, et al.
Pubblicazione: (2021)

Bayesian Optimal Stopping with Maximum Value Knowledge
di: Kleer, Pieter, et al.
Pubblicazione: (2025)

Fast and Flexible Flow Decompositions in General Graphs via Dominators
di: Sena, Francisco, et al.
Pubblicazione: (2025)

A Multi-Token Coordinate Descent Method for Semi-Decentralized Vertical Federated Learning
di: Valdeira, Pedro, et al.
Pubblicazione: (2023)

(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
di: Hunkenschröder, Christoph, et al.
Pubblicazione: (2025)

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

Labeling Methods for Partially Ordered Paths
di: Euler, Ricardo, et al.
Pubblicazione: (2023)

Optimizing for Fairness in Generalized Kidney Exchange: Theory and Computations
di: Chang, Claire, et al.
Pubblicazione: (2026)

Dynamic Curing and Network Design in SIS Epidemic Processes
di: Yi, Yuhao, et al.
Pubblicazione: (2022)

The Restricted Inverse Optimal Value Problem under Weighted Bottle-neck Hamming distance on trees
di: Zhang, Qiao, et al.
Pubblicazione: (2024)

Beyond Smoothed Analysis: Analyzing the Simplex Method by the Book
di: Bach, Eleon, et al.
Pubblicazione: (2025)

Computational complexity of the recoverable robust shortest path problem in acyclic digraphs
di: Kasperski, Adam, et al.
Pubblicazione: (2024)

Gap-Free Clustering: Sensitivity and Robustness of SDP
di: Zurek, Matthew, et al.
Pubblicazione: (2023)

A First Order Method for Linear Programming Parameterized by Circuit Imbalance
di: Cole, Richard, et al.
Pubblicazione: (2023)

Communication-efficient Vertical Federated Learning via Compressed Error Feedback
di: Valdeira, Pedro, et al.
Pubblicazione: (2024)

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

Fair Assortment Planning
di: Chen, Qinyi, et al.
Pubblicazione: (2022)

Accelerated Approximate Optimization of Multi-Commodity Flows on Directed Graphs
di: Chen, Li, et al.
Pubblicazione: (2025)

Vertical Federated Learning with Missing Features During Training and Inference
di: Valdeira, Pedro, et al.
Pubblicazione: (2024)

Online Decision Making with Fairness over Time
di: Chen, Rui, et al.
Pubblicazione: (2022)

Improved Speed via Regional Fulfillment
di: Hathcock, Daniel, et al.
Pubblicazione: (2026)

Continuous Non-monotone DR-submodular Maximization with Down-closed Convex Constraint
di: Chen, Shengminjie, et al.
Pubblicazione: (2023)

Extracting Dual Solutions via Primal Optimizers
di: Carmon, Yair, et al.
Pubblicazione: (2024)

The Lovász Theta Function for Recovering Planted Clique Covers and Graph Colorings
di: Hou, Jiaxin, et al.
Pubblicazione: (2023)

Polyamorous Scheduling
di: Gąsieniec, Leszek, et al.
Pubblicazione: (2024)

Accelerating Proximal Gradient Descent via Silver Stepsizes
di: Bok, Jinho, et al.
Pubblicazione: (2024)

3.415-Approximation for Coflow Scheduling via Iterated Rounding
di: Rohwedder, Lars, et al.
Pubblicazione: (2025)

Improved $\ell_{p}$ Regression via Iteratively Reweighted Least Squares
di: Ene, Alina, et al.
Pubblicazione: (2025)

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

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

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

Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
di: Su, Yuexin, et al.
Pubblicazione: (2026)