On the Complexity of Nonconvex-Strongly-Concave Smooth Minimax Optimization Using First-Order Methods
The problem of minimax optimization arises in a wide range of applications. When the objective function is convex-concave, almost the full picture is known. However, the general nonconvex-concave setting is less understood. In this work, we study the complexity of nonconvex-strongly-concave minimax...
| 1. autor: | |
|---|---|
| Kolejni autorzy: | |
| Format: | Praca dyplomowa |
| Wydane: |
Massachusetts Institute of Technology
2022
|
| Dostęp online: | https://hdl.handle.net/1721.1/138938 |