atlas

Research map / Optimization / Nonconvex and smooth optimization

Policy Optimization Provably Converges to Nash Equilibria in Zero-Sum Linear Quadratic Games

NeurIPS 2019 · Optimization › Nonconvex and smooth optimization · approach: Equilibrium learning in zero-sum games · 72 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use nested-gradient policy updates (Gauss-Newton, natural, vanilla) for the maximizerzero-sum LQ game policy optimization · Case 1 simulationconvergence to Nash equilibrium costHelped
run the methods without Assumption 2.1 ii) (no saddle-point guarantee)nested-gradient, alternating-gradient, GDA · Case 2 simulationconvergence to NENo clear effect
remove the projection onto Omega (ablation)projected nested-gradient · Cases 1 and 2 simulationconvergence to NENo clear effect
replace outer-loop exact inner solution (nested) by finite inner iterations (alternating) or simultaneous updates (GDA) (ablation)policy optimization for LQ games · Case 2 simulationconvergence to NENo clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy