Learning Sparse Polymatrix Games in Polynomial Time and Sample ComplexityDownload PDFOpen Website

2018 (modified: 08 Nov 2022)AISTATS 2018Readers: Everyone
Abstract: We consider the problem of learning sparse polymatrix games from observations of strategic interactions. We show that a polynomial time method based on $\ell_{1,2}$-group regularized logistic regre...
0 Replies

Loading