Feb. 13, 2024, 5:44 a.m. | Junhyung Lyle Kim Gauthier Gidel Anastasios Kyrillidis Fabian Pedregosa

cs.LG updates on arXiv.org arxiv.org

The extragradient method has gained popularity due to its robust convergence properties for differentiable games. Unlike single-objective optimization, game dynamics involve complex interactions reflected by the eigenvalues of the game vector field's Jacobian scattered across the complex plane. This complexity can cause the simple gradient method to diverge, even for bilinear games, while the extragradient method achieves convergence. Building on the recently proven accelerated convergence of the momentum extragradient method for bilinear games \citep{azizian2020accelerating}, we use a polynomial-based analysis to …

analysis complexity convergence cs.lg differentiable dynamics game games gradient interactions math.oc optimization plane polynomial robust simple stat.ml vector

Research Scholar (Technical Research)

@ Centre for the Governance of AI | Hybrid; Oxford, UK

HPC Engineer (x/f/m) - DACH

@ Meshcapade GmbH | Remote, Germany

Business Consultant-AI/ML

@ Bosch Group | Bengaluru, India

Senior Network Defense Analyst (AI/ML) - Hybrid

@ Noblis | Linthicum, MD, United States

Senior Data Analyst

@ Peloton | New York City

SC2024-003425 Data Scientist (NS) - WED 6 Mar

@ EMW, Inc. | Brussels, Brussels, Belgium