Kristal Curtis

On The Convergence of ADAM-Type Algorithms for Solving Structured Single Node and Decentralized Min-Max Saddle Point Games

Many modern machine learning problems require solving min-max saddle point games, whose computational complexity is NP-hard in general. To overcome this issue, most available algorithms aim for finding a first-order Nash equilibrium solution that always exists under mild assumptions. However, the pr…