atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

Meta-Learning in Games

ICLR 2023 · Learning theory and algorithms › Submodular and game algorithms · approach: Opponent modeling and subgame solving · 3 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
Meta-learn the OGD initialization from previous gamesOGD · Libratus poker endgames, Endgame A and Endgame Btask-averaged Nash equilibrium gap: up to an order of magnitudeHelped
Initialize each game with the last iterate of the previous game instead of the vanilla OGD initialization (ablation)OGD · Libratus poker endgames, sorted stackstask-averaged Nash equilibrium gapHelped
Initialize according to the meta-learning method instead of using the previous game's last iterate (ablation)OGD · Libratus poker endgames, alternating and random stackstask-averaged Nash equilibrium gapHelped
Use the vanilla OGD initialization and solve each game separately rather than meta-learning initialization (ablation)OGD · Libratus poker endgames, all task sequencing setupstask-averaged Nash equilibrium gap: up to an order of magnitudeHurt

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