Regret Circuits: Composability of Regret Minimizers

International Conference on Machine Learning, pp. 1863-1872, 2019.

Cited by: 7|Bibtex|Views23
EI
Other Links: academic.microsoft.com|dblp.uni-trier.de|arxiv.org

Abstract:

Regret minimization is a powerful tool for solving large-scale problems; it was recently used in breakthrough results for large-scale extensive-form game solving. This was achieved by composing simplex regret minimizers into an overall regret-minimization framework for extensive-form game strategy spaces. In this paper we study the genera...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments