Author of the publication

On Efficient Optimal Transport: An Analysis of Greedy and Accelerated Mirror Descent Algorithms.

, , and . ICML, volume 97 of Proceedings of Machine Learning Research, page 3982-3991. PMLR, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

On Projection Robust Optimal Transport: Sample Complexity and Model Misspecification, , , , and . (2020)cite arxiv:2006.12301Comment: Correct some typos; 46 Pages, 41 figures.Sparsemax and Relaxed Wasserstein for Topic Sparsity., , and . CoRR, (2018)A Specialized Semismooth Newton Method for Kernel-Based Optimal Transport., , and . CoRR, (2023)On Efficient Optimal Transport: An Analysis of Greedy and Accelerated Mirror Descent Algorithms., , and . ICML, volume 97 of Proceedings of Machine Learning Research, page 3982-3991. PMLR, (2019)PPO-Based Energy-Efficient Power Control and Spectrum Allocation in In-Vehicle HetNets., , , , and . GLOBECOM, page 6334-6339. IEEE, (2023)On the Complexity of Deterministic Nonsmooth and Nonconvex Optimization., , and . CoRR, (2022)Sparsemax and Relaxed Wasserstein for Topic Sparsity., , and . WSDM, page 141-149. ACM, (2019)Revisiting Fixed Support Wasserstein Barycenter: Computational Hardness and Efficient Algorithms., , , , and . CoRR, (2020)Collaborative Filtering Incorporating Review Text and Co-clusters of Hidden User Communities and Item Groups., , and . CIKM, page 251-260. ACM, (2014)Fixed-Support Wasserstein Barycenters: Computational Hardness and Fast Algorithm., , , , and . NeurIPS, (2020)