Solving Non-Convex Non-Differentiable Min-Max Games Using Proximal Gradient Method

This video program is a part of the Premium package:

Solving Non-Convex Non-Differentiable Min-Max Games Using Proximal Gradient Method


  • IEEE MemberUS $11.00
  • Society MemberUS $0.00
  • IEEE Student MemberUS $11.00
  • Non-IEEE MemberUS $15.00
Purchase

Solving Non-Convex Non-Differentiable Min-Max Games Using Proximal Gradient Method

0 views
  • Share
Create Account or Sign In to post comments
Min-max saddle point games appear in a wide range of applications in machine leaning and signal processing. Despite their wide applicability, theoretical studies are mostly limited to the special convex-concave structure. While some recent works generaliz
Min-max saddle point games appear in a wide range of applications in machine leaning and signal processing. Despite their wide applicability, theoretical studies are mostly limited to the special convex-concave structure. While some recent works generaliz