5 papers
Average-and Last-Iterate Lower Bounds for Optimistic Matrix Mirror-Prox in Quantum Zero-Sum Games
Yiheng Su, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Pucheng Xiong
Optimistic matrix mirror-prox (OMMP) computes -approximate Nash equilibria in quantum zero-sum games with an average-iterate guarantee [arXiv:2311.10859]. We…
No Coin Left Behind: Maximizing Strategic Surplus Against No-Regret Dynamics
Yiheng Su, Emmanouil-Vasileios Vlatakis-Gkaragkounis
We investigate the strategic surplus obtainable against a Follow-the-Regularized-Leader (FTRL) learner with constant step size in two-player zero-sum games played o…
Breaking Barrier in Quantum Zero-Sum Games: Generalizing Metric Subregularity for Spectraplexes
Yiheng Su, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Pucheng Xiong
Quantum zero-sum games are bilinear saddle-point problems over density matrices. We study how their semidefinite geometry governs last-iterate convergence beyond existing $O(1/\var…
Convergence, optimization and stability of singular eigenmaps
Bernard Akwei, Bobita Atkins, Rachel Bailey +9
Eigenmaps are important in analysis, geometry, and machine learning, especially in nonlinear dimension reduction. Approximation of the eigenmaps of a Laplace operator depends cruci…
Diverse beam search to find densest-known planar unit distance graphs
Peter Engel, Owen Hammond-Lee, Yiheng Su +2
This paper addresses the problem of determining the maximum number of edges in a unit distance graph (UDG) of vertices using computer search. An unsolved problem of Paul Erdős…