"The complexity of nonconvex-strongly-concave minimax optimization."

Siqi Zhang et al. (2021)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2021-12-17

- view
  - electronic edition @ mlr.press (open access)
- export record
  dblp key:
  - conf/uai/ZhangYGKH21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/uai/ZhangYGKH21
Siqi Zhang, Junchi Yang, Cristóbal Guzmán, Negar Kiyavash, Niao He:
The complexity of nonconvex-strongly-concave minimax optimization. UAI 2021: 482-492

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.