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
  5. Solving Non-Convex Non-Differentiable Min-Max Games Using Proximal Gradient Method
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

Next Up

00:10:00
Anti-Jamming Routing For Internet Of Satellites: A Reinforcement Learning Approach
>
00:10:00
TEST
>
00:10:00
TEST #2
>
00:11:17
Article Production Process: Author Gateway and POPP - PoE 2020
>
00:05:01
Article Production Process: Service Levels & Workflow Options - PoE 2020
>
00:28:33
AWS Partner Solution Showcase presented by Scott Francis IoT Partner Solutions Architect at Amazon Web Services
>