all AI news
On the Complexity of a Practical Primal-Dual Coordinate Method. (arXiv:2201.07684v1 [math.OC])
Jan. 20, 2022, 2:10 a.m. | Ahmet Alacaoglu, Volkan Cevher, Stephen J. Wright
cs.LG updates on arXiv.org arxiv.org
We prove complexity bounds for the primal-dual algorithm with random
extrapolation and coordinate descent (PURE-CD), which has been shown to obtain
good practical performance for solving convex-concave min-max problems with
bilinear coupling. Our complexity bounds either match or improve the best-known
results in the literature for both dense and sparse
(strongly)-convex-(strongly)-concave problems.
More from arxiv.org / cs.LG updates on arXiv.org
Jobs in AI, ML, Big Data
Data Architect
@ University of Texas at Austin | Austin, TX
Data ETL Engineer
@ University of Texas at Austin | Austin, TX
Lead GNSS Data Scientist
@ Lurra Systems | Melbourne
Senior Machine Learning Engineer (MLOps)
@ Promaton | Remote, Europe
Data Management Assistant
@ World Vision | Amman Office, Jordan
Cloud Data Engineer, Global Services Delivery, Google Cloud
@ Google | Buenos Aires, Argentina