no code implementations • 1 Nov 2023 • Yang Cai, Gabriele Farina, Julien Grand-Clément, Christian Kroer, Chung-Wei Lee, Haipeng Luo, Weiqiang Zheng
Algorithms based on regret matching, specifically regret matching$^+$ (RM$^+$), and its variants are the most popular approaches for solving large-scale two-player zero-sum games in practice.
no code implementations • 21 Sep 2022 • Julien Grand-Clément, Marek Petrik
Our work opens a new research direction for RMDPs and can serve as a first step toward obtaining a tractable convex formulation of RMDPs.
no code implementations • 5 Sep 2022 • Julien Grand-Clément, Jean Pauphilet
Many high-stake decisions follow an expert-in-loop structure in that a human operator receives recommendations from an algorithm but is the ultimate decision maker.
no code implementations • 24 Feb 2022 • Julien Grand-Clément, Christian Kroer
We introduce the Conic Blackwell Algorithm$^+$ (CBA$^+$) regret minimizer, a new parameter- and scale-free regret minimizer for general convex sets.
no code implementations • 21 Oct 2021 • Julien Grand-Clément, Carri Chan, Vineet Goyal, Elizabeth Chuang
We propose a novel data-driven model to compute interpretable triage guidelines based on policies for Markov Decision Process that can be represented as simple sequences of decision trees ("tree policies").
no code implementations • NeurIPS 2021 • Julien Grand-Clément, Christian Kroer
We develop new parameter-free and scale-free algorithms for solving convex-concave saddle-point problems.
no code implementations • 11 May 2020 • Julien Grand-Clément, Christian Kroer
Our framework is also the first one to solve robust MDPs with $s$-rectangular KL uncertainty sets.