The complexity of nonconvex-strongly-concave minimax optimization

Siqi Zhang; Junchi Yang; Cristóbal Guzmán; Negar Kiyavash; Niao He

The complexity of nonconvex-strongly-concave minimax optimization

Siqi Zhang, Junchi Yang, Cristóbal Guzmán, Negar Kiyavash, Niao He

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

52 Downloads (Pure)

Original language	English
Title of host publication	Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence (UAI 2021)
Subtitle of host publication	UAI
Publisher	MLResearchPress
Publication status	Published - 2021
Event	37th Conference on Uncertainty in Artificial Intelligence, UAI 2021 - Online Conference Duration: 26 Jul 2021 → 30 Jul 2021 Conference number: 37

Publication series

Name	Proceedings of Machine Learning Research
Volume	161

Conference

Conference	37th Conference on Uncertainty in Artificial Intelligence, UAI 2021
Abbreviated title	UAI 2021
City	Online Conference
Period	26/07/21 → 30/07/21

Access to Document

zhang21cFinal published version, 366 KB

https://proceedings.mlr.press/v161/zhang21c.html

Cite this

@inproceedings{4c03dd13588d4a05849ff0e591c7dfca,

title = "The complexity of nonconvex-strongly-concave minimax optimization",

author = "Siqi Zhang and Junchi Yang and Crist{\'o}bal Guzm{\'a}n and Negar Kiyavash and Niao He",

year = "2021",

language = "English",

series = "Proceedings of Machine Learning Research",

publisher = "MLResearchPress",

booktitle = "Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence (UAI 2021)",

note = "37th Conference on Uncertainty in Artificial Intelligence, UAI 2021, UAI 2021 ; Conference date: 26-07-2021 Through 30-07-2021",

}

Zhang, S, Yang, J, Guzmán, C, Kiyavash, N & He, N 2021, The complexity of nonconvex-strongly-concave minimax optimization. in Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence (UAI 2021): UAI. Proceedings of Machine Learning Research, vol. 161, MLResearchPress, 37th Conference on Uncertainty in Artificial Intelligence, UAI 2021, Online Conference, 26/07/21. <https://proceedings.mlr.press/v161/zhang21c.html>

The complexity of nonconvex-strongly-concave minimax optimization. / Zhang, Siqi; Yang, Junchi; Guzmán, Cristóbal et al.
Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence (UAI 2021): UAI. MLResearchPress, 2021. (Proceedings of Machine Learning Research; Vol. 161).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - The complexity of nonconvex-strongly-concave minimax optimization

AU - Zhang, Siqi

AU - Yang, Junchi

AU - Guzmán, Cristóbal

AU - Kiyavash, Negar

AU - He, Niao

N1 - Conference code: 37

PY - 2021

Y1 - 2021

M3 - Conference contribution

T3 - Proceedings of Machine Learning Research

BT - Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence (UAI 2021)

PB - MLResearchPress

T2 - 37th Conference on Uncertainty in Artificial Intelligence, UAI 2021

Y2 - 26 July 2021 through 30 July 2021

ER -