lightning talk

UAI 2021

July 28, 2021

United States

The Complexity of Nonconvex-Strongly-Concave Minimax Optimization

Please log in to leave a comment


SlidesTranscript English (automatic)

Next from UAI 2021

lightning talk

Graph Reparametrizations for Enabling 1000+ Monte Carlo Iterations In Bayesian Deep Neural Networks

UAI 2021

Vishnu Suresh Lokhande and 3 other authors

28 July 2021

Similar lecture


Decentralized Riemannian Algorithm for Nonconvex Minimax Problems

AAAI 2023

Xidong Wu and 2 other authors

11 February 2023

Stay up to date with the latest Underline news!


  • All Lectures
  • For Librarians
  • Resource Center
  • Free Trial
Underline Science, Inc.
1216 Broadway, 2nd Floor, New York, NY 10001, USA

© 2023 Underline - All rights reserved