Know a great AI tool or AI news source? Submit it to AiByts
Nonconvex-PL2 min read

Stochastic Gradient Descent Ascent is Suboptimal for Nonconvex-PL Min-Max Games

How far can stochastic gradient descent ascent (SGDA) go by tuning its timescale ratio and step sizes in nonconvex min-max games? We answer this question for nonconvex-PL (NC-PL) games by establishing the first tight complexity of two-timescale SGDA with a fixed timescale ratio and non-increasing…

By Junsoo HaarXiv - stat.ML

Read the full story

Originally published by arXiv - stat.ML on Oct 7, 2026.

Read on arXiv - stat.ML(opens in a new tab)

Comments

Sign in to join the discussion.

No comments yet — be the first to share your thoughts.