atlas

Research map / Bandits and online learning / Online convex optimization and games

Model-Free Online Learning in Unknown Sequential Decision Making Problems and Games

AAAI 2021 · Bandits and online learning › Online convex optimization and games · approach: Counterfactual regret minimization · 8 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 the proposed interactive bandit algorithm instead of NFSP, policy gradient, or online MCCFRApproximate Nash equilibrium learning · Kuhn pokerexploitabilityHelped
Use the proposed interactive bandit algorithm instead of NFSP, policy gradient, or online MCCFRApproximate Nash equilibrium learning · Leduc pokerexploitabilityHelped
Use the upfront-flipping rollout instead of on-path-flipping (ablation)Interactive bandit algorithm · Kuhn poker and Leduc pokerexploitabilityHurt
Use the uniform exploration function instead of the terminal-node-count exploration function (ablation)Interactive bandit algorithm · Kuhn poker and Leduc pokerexploitabilityNo clear effect
Set the exploration parameter k to 10 rather than the other tested values (ablation)Interactive bandit algorithm · Kuhn poker and Leduc pokerexploitabilityHelped

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