AI RESEARCH
A first-order method for nonconvex-nonconcave minimax problems under a local Kurdyka-Lojasiewicz condition
arXiv CS.LG
•
ArXi:2507.01932v2 Announce Type: replace-cross We study a class of nonconvex-nonconcave minimax problems in which the inner maximization problem satisfies a local Kurdyka-Lojasiewicz (KL) condition that may vary with the outer minimization variable. In contrast to the global KL or Polyak-Lojasiewicz (PL) conditions commonly assumed in the literature -- which are significantly stronger and often too restrictive in practice -- this local KL condition accommodates a broader range of practical scenarios. However, it also