High-probability complexity guarantees for nonconvex minimax problems

From MaRDI portal

MaRDI QIDQ6729751arXivFDO

Authors Yassine Laguel, Yasa Syed, N. S. Aybat, Mert Gürbüzbalaban

Publication date 2024

Published in arXiv


arXiv classification

math.OC















This page was built for publication: High-probability complexity guarantees for nonconvex minimax problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6729751)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=High-probability_complexity_guarantees_for_nonconvex_minimax_problems&oldid=105830051"
Powered by MediaWiki