1 citations · 1 across the 4 of their papers we have counts for
6 papers
Linear Last-Iterate Convergence Rates for Optimistic Learning in Harmonic Games
John Lazarsfeld, Anas Barakat, Jacob Abernethy +4
We prove that the last iterate of Optimistic Follow-The-Regularized-Leader (OFTRL) converges at a linear rate to a Nash equilibrium in multiplayer harmonic games. Our result holds…
Arbitrarily Slow Polynomial Convergence of Fictitious Play
Jacob Abernethy, John Lazarsfeld, Andre Wibisono
We show that fictitious play can converge at arbitrarily slow polynomial rates in two-player zero-sum games. For every integer , we construct a payoff matrix with $(k+1)^2…
SPARQ: Synthetic Problem Generation for Reasoning via Quality-Diversity Algorithms
Alex Havrilla, Edward Hughes, Mikayel Samvelyan +1
Large language model (LLM) driven synthetic data generation has emerged as a powerful method for improving model reasoning capabilities. However, most methods either distill large…
Can Transformers Reason Logically? A Study in SAT Solving
Leyan Pan, Vijay Ganesh, Jacob Abernethy +2
We formally study the logical reasoning capabilities of decoder-only Transformers in the context of the boolean satisfiability (SAT) problem. First, we prove by construction that d…
Lexicographic Optimization: Algorithms and Stability
Jacob Abernethy, Robert E. Schapire, Umar Syed
A lexicographic maximum of a set is a vector in whose smallest component is as large as possible, and subject to that requirement, whose second small…
Faster Margin Maximization Rates for Generic and Adversarially Robust Optimization Methods
Guanghui Wang, Zihao Hu, Claudio Gentile +2
First-order optimization methods tend to inherently favor certain solutions over others when minimizing an underdetermined training objective that has multiple global optima. This…