AIGTLGMAMay 20, 2024

Configurable Mirror Descent: Towards a Unification of Decision Making

arXiv:2405.11746v11 citationsh-index: 24ICML
Originality Incremental advance
AI Analysis

This addresses the fundamental challenge of unifying decision-making algorithms across diverse problem categories, though it appears to be a preliminary attempt with incremental methodological contributions.

The authors tackled the problem of developing a single algorithm that works across all categories of decision-making problems (single-agent, cooperative multi-agent, competitive multi-agent, and mixed), proposing Configurable Mirror Descent (CMD) which achieved empirically competitive or better outcomes compared to baselines on a new benchmark of 15 games.

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) there lacks a comprehensive benchmark covering all the categories. This work presents a preliminary attempt to address the question with three main contributions. i) We propose the generalized mirror descent (GMD), a generalization of MD variants, which considers multiple historical policies and works with a broader class of Bregman divergences. ii) We propose the configurable mirror descent (CMD) where a meta-controller is introduced to dynamically adjust the hyper-parameters in GMD conditional on the evaluation measures. iii) We construct the \textsc{GameBench} with 15 academic-friendly games across different decision-making categories. Extensive experiments demonstrate that CMD achieves empirically competitive or better outcomes compared to baselines while providing the capability of exploring diverse dimensions of decision making.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes