Configurable Mirror Descent: Towards a Unification of Decision Making
Pengdeng Li, Shuxin Li, Chang Yang, Xinrun Wang, Shuyue Hu, Xiao, Huang, Hau Chan, Bo An

TL;DR
This paper introduces a unified algorithm, configurable mirror descent, capable of addressing various decision-making problems across different categories, and presents a comprehensive benchmark for evaluation.
Contribution
It proposes the generalized mirror descent and a meta-controlled configurable version, unifying decision-making algorithms across multiple categories.
Findings
CMD achieves competitive or superior results compared to baselines.
The approach enables exploration of diverse decision-making dimensions.
Constructed the GameBench benchmark with 15 varied decision-making games.
Abstract
Decision-making problems, categorized as single-agent, e.g., Atari, cooperative multi-agent, e.g., Hanabi, competitive multi-agent, e.g., Hold'em poker, and mixed cooperative and competitive, e.g., football, are ubiquitous in the real world. Various methods are proposed to address the specific decision-making problems. Despite the successes in specific categories, these methods typically evolve independently and cannot generalize to other categories. Therefore, a fundamental question for decision-making is: \emph{Can we develop \textbf{a single algorithm} to tackle \textbf{ALL} categories of decision-making problems?} There are several main challenges to address this question: i) different decision-making categories involve different numbers of agents and different relationships between agents, ii) different categories have different solution concepts and evaluation measures, and iii)…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Systems and Decision Making
