activity
20192026
most citedMaximum Independent Set: Self-Training through Dynamic Programming

3 citations · 10 across the 24 of their papers we have counts for

collaborators
Showing 2020Show all

5 papers · 1 filter

cs.GT2020

Evolutionary Game Theory Squared: Evolving Agents in Endogenously Evolving Zero-Sum Games

Stratis Skoulakis, Tanner Fiez, Ryann Sim +2

The predominant paradigm in evolutionary game theory and more generally online learning in games is based on a clear distinction between a population of dynamic agents that interac…

cs.LG2020★ 3 cited

Efficient Online Learning of Optimal Rankings: Dimensionality Reduction via Gradient Descent

Dimitris Fotakis, Thanasis Lianeas, Georgios Piliouras +1

We consider a natural model of online preference aggregation, where sets of preferred items along with a demand for items in each , appear online…

cs.CC2020

The Complexity of Constrained Min-Max Optimization

Constantinos Daskalakis, Stratis Skoulakis, Manolis Zampetakis

Despite its important applications in Machine Learning, min-max optimization of nonconvex-nonconcave objectives remains elusive. Not only are there no known first-order methods con…

cs.LG2020★ 1 cited

Convergence to Second-Order Stationarity for Non-negative Matrix Factorization: Provably and Concurrently

Ioannis Panageas, Stratis Skoulakis, Antonios Varvitsiotis +1

Non-negative matrix factorization (NMF) is a fundamental non-convex optimization problem with numerous applications in Machine Learning (music analysis, document clustering, speech…

cs.DS2020

The Online Min-Sum Set Cover Problem

Dimitris Fotakis, Loukas Kavouras, Grigorios Koumoutsos +2

We consider the online Min-Sum Set Cover (MSSC), a natural and intriguing generalization of the classical list update problem. In Online MSSC, the algorithm maintains a permutation…