atlas

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

Dynamic Thresholding and Pruning for Regret Minimization

AAAI 2017 · Bandits and online learning › Online convex optimization and games · approach: Fast no-regret dynamics in games · 39 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
add dynamic thresholding to EGTExcessive Gap Technique · Leduc-5nodes touched to converge: factor of 2Helped
add dynamic thresholding and RBP to CFR with HedgeCFR with Hedge · Leduc-5nodes touched to converge: factor of 7Helped
add dynamic thresholding to regret matchingCFR with RM · Leducnodes touched to convergeNo clear effect
vary Hedge threshold parameter d (ablation)CFR with Hedge · LeducperformanceNo clear effect
use EGT threshold c of 0.05 instead of 0.001 to 0.01 (ablation)EGT with dynamic thresholding · LeducperformanceHurt
use EGT threshold c of 0.001, 0.005 or 0.01 (ablation)EGT · LeducperformanceHelped
use Hedge with thresholding and RBP instead of RM with RBPCFR · Leduc vs Leduc-5nodes touched to convergeMixed

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