4 papers
Universality of first-order methods on random and deterministic matrices
Nicola Gorini, Chris Jones, Dmitriy Kunisky +1
General first-order methods (GFOM) are a flexible class of iterative algorithms which update a state vector by matrix-vector multiplications and entrywise nonlinearities. A long li…
The Grothendieck Constant is Strictly Larger than Davie-Reeds' Bound
Chris Jones, Giulio Malavolta
The Grothendieck constant is a fundamental quantity in functional analysis, with important connections to quantum information, combinatorial optimization, and the geometry…
Sparsest cut and eigenvalue multiplicities on low degree Abelian Cayley graphs
Tommaso d'Orsi, Chris Jones, Jake Ruotolo +2
Whether or not the Sparsest Cut problem admits an efficient -approximation algorithm is a fundamental algorithmic question with connections to geometry and the Unique Games C…
Fourier Analysis of Iterative Algorithms
Chris Jones, Lucas Pesenti
We study a general class of nonlinear iterative algorithms which includes power iteration, belief propagation and approximate message passing, and many forms of gradient descent. W…