1 citations · 3 across the 3 of their papers we have counts for
3 papers
Regret Matching+: (In)Stability and Fast Convergence in Games
Gabriele Farina, Julien Grand-Clément, Christian Kroer +2
Regret Matching+ (RM+) and its variants are important algorithms for solving large-scale games. However, a theoretical understanding of their success in practice is still a mystery…
Practical Knowledge Distillation: Using DNNs to Beat DNNs
Chung-Wei Lee, Pavlos Athanasios Apostolopulos, Igor L. Markov
For tabular data sets, we explore data and model distillation, as well as data denoising. These techniques improve both gradient-boosting models and a specialized DNN architecture.…
Clairvoyant Regret Minimization: Equivalence with Nemirovski's Conceptual Prox Method and Extension to General Convex Games
Gabriele Farina, Christian Kroer, Chung-Wei Lee +1
A recent paper by Piliouras et al. [2021, 2022] introduces an uncoupled learning algorithm for normal-form games -- called Clairvoyant MWU (CMWU). In this note we show that CMWU is…