4 papers
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…
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…
Node Max-Cut and Computing Equilibria in Linear Weighted Congestion Games
Dimitris Fotakis, Vardis Kandiros, Thanasis Lianeas +3
In this work, we seek a more refined understanding of the complexity of local optimum computation for Max-Cut and pure Nash equilibrium (PNE) computation for congestion games with…
Reallocating Multiple Facilities on the Line
Dimitris Fotakis, Loukas Kavouras, Panagiotis Kostopanagiotis +3
We study the multistage -facility reallocation problem on the real line, where we maintain facility locations over stages, based on the stage-dependent locations of …