Lorenzo Orecchia
Lorenzo Orecchia
University of Chicago, Computer Science
Verified email at bu.edu - Homepage
TitleCited byYear
Linear coupling: An ultimate unification of gradient and mirror descent
Z Allen-Zhu, L Orecchia
arXiv preprint arXiv:1407.1537, 2014
2082014
A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
JA Kelner, L Orecchia, A Sidford, ZA Zhu
Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013
1832013
An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations
JA Kelner, YT Lee, L Orecchia, A Sidford
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
1662014
A local spectral method for graphs: With applications to improving graph partitions and exploring data graphs locally
MW Mahoney, L Orecchia, NK Vishnoi
Journal of Machine Learning Research 13 (Aug), 2339-2365, 2012
842012
Approximating the exponential, the lanczos method and an O (m)-time spectral algorithm for balanced separator
L Orecchia, S Sachdeva, NK Vishnoi
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
792012
On partitioning graphs via single commodity flows
L Orecchia, LJ Schulman, UV Vazirani, NK Vishnoi
Proceedings of the fortieth annual ACM symposium on Theory of computing, 461-470, 2008
732008
Localized techniques for broadcasting in wireless sensor networks
L Orecchia, A Panconesi, C Petrioli, A Vitaletti
Proceedings of the 2004 joint workshop on Foundations of mobile computing, 41-51, 2004
612004
Spectral sparsification and regret minimization beyond matrix multiplicative updates
Z Allen-Zhu, Z Liao, L Orecchia
Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015
492015
Flow-based algorithms for local graph clustering
L Orecchia, ZA Zhu
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
462014
Nearly-linear time positive LP solver with faster convergence rate
Z Allen-Zhu, L Orecchia
Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015
43*2015
Using optimization to break the epsilon barrier: A faster and simpler width-independent algorithm for solving positive linear programs in parallel
Z Allen-Zhu, L Orecchia
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2015
422015
Using optimization to obtain a width-independent, parallel, simpler, and faster positive SDP solver
Z Allen-Zhu, YT Lee, L Orecchia
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
332016
Implementing regularization implicitly via approximate eigenvector computation
MW Mahoney, L Orecchia
arXiv preprint arXiv:1010.0703, 2010
322010
Towards an SDP-based Approach to Spectral Methods: A Nearly-Linear-Time Algorithm for Graph Partitioning and Decomposition
L Orecchia, NK Vishnoi
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
302011
Coding properties of Oxytricha trifallax (Sterkiella histriomuscorum) macronuclear chromosomes: analysis of a pilot genome project
ARO Cavalcanti, NA Stover, L Orecchia, TG Doak, LF Landweber
Chromosoma 113 (2), 69-76, 2004
302004
Accelerated extra-gradient descent: A novel accelerated first-order method
J Diakonikolas, L Orecchia
arXiv preprint arXiv:1706.04680, 2017
192017
Localized techniques for broadcasting in wireless sensor networks
D Dubhashi, O Häggström, L Orecchia, A Panconesi, C Petrioli, A Vitaletti
Algorithmica 49 (4), 412-446, 2007
182007
On acceleration with noise-corrupted gradients
MB Cohen, J Diakonikolas, L Orecchia
arXiv preprint arXiv:1805.12591, 2018
162018
Fast approximation algorithms for graph partitioning using spectral and semidefinite-programming techniques
L Orecchia
UC Berkeley, 2011
162011
The approximate duality gap technique: A unified theory of first-order methods
J Diakonikolas, L Orecchia
SIAM Journal on Optimization 29 (1), 660-689, 2019
102019
The system can't perform the operation now. Try again later.
Articles 1–20