atlas

Research map / Optimization / Nonconvex and smooth optimization

Generative Adversarial Imitation Learning with Neural Network Parameterization: Global Optimality and Convergence Rate

ICML 2020 · Optimization › Nonconvex and smooth optimization · approach: Gradient descent ascent for minimax · 6 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
Regularizer lambda (psi, convex L-Lipschitz) added to GAIL objective with regularization parameter lambdaGAIL with two-layer neural networks · theoretical bound (Theorem 4.5)expected R-distance optimality gapNo clear effect
Step size eta set to 1/sqrt(T) and batch size N grown with T (N = Omega(B^2 T sigma^2))GAIL alternating natural policy gradient + gradient ascent with neural networks · theoretical convergence rateexpected R-distance optimality gapHelped
Overparameterized width m increased (m = Omega(B^10 T^6)) and TD iterations T_TD = Omega(m) in neural TD criticNeural TD critic in GAIL · theoretical error bound (Proposition 4.4)Q-function estimation errorHelped
Random initialization symmetric variant (W0 duplicated with sign-flipped b) so u0 = 0Neural network initialization in GAIL · theoretical analysisapproximation error termHelped

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