1. Home
2. Premium
3. IEEE ICASSP 2020 Virtual Conference May 2020
4. Solving Non-Convex Non-Differentiable Min-Max Games Using Proximal Gradient Method

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

Collection:

IEEE ICASSP 2020 Virtual Conference May 2020

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

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

Purchase

Videos in this product

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

00:11:40

0 views

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