Lorenzo Orecchia

ORCID

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 21

Top Venues

University of California, Berkeley, USA (PHD)

Education History

University of California, Berkeley, USA

PHD

Publications

Yuepeng Yang, Antares Chen, Lorenzo Orecchia, Cong Ma
Top-K ranking with a monotone adversary. CoRR (2024)
Yuepeng Yang, Antares Chen, Lorenzo Orecchia, Cong Ma
Top-K ranking with a monotone adversary. COLT (2024)
Konstantinos Ameranis, Antares Chen, Adela Frances DePavia, Lorenzo Orecchia, Erasmo Tani
Hypergraph Diffusions and Resolvents for Norm-Based Hypergraph Laplacians. CoRR (2023)
Konstantinos Ameranis, Antares Chen, Lorenzo Orecchia, Erasmo Tani
Efficient Flow-based Approximation Algorithms for Submodular Hypergraph Partitioning via a Generalized Cut-Matching Game. CoRR (2023)
Lorenzo Orecchia, Konstantinos Ameranis, Charalampos E. Tsourakakis, Kunal Talwar
Practical Almost-Linear-Time Approximation Algorithms for Hybrid and Overlapping Graph Clustering. ICML (2022)
Jelena Diakonikolas, Maryam Fazel, Lorenzo Orecchia
Fair Packing and Covering on a Relative Scale. SIAM J. Optim. 30 (4) (2020)
Zeyuan Allen-Zhu, Lorenzo Orecchia
Nearly linear-time packing and covering LP solvers - Achieving width-independence and -convergence. Math. Program. 175 (1-2) (2019)
Jelena Diakonikolas, Lorenzo Orecchia
Conjugate Gradients and Accelerated Methods Unified: The Approximate Duality Gap View. CoRR (2019)
Jelena Diakonikolas, Lorenzo Orecchia
The Approximate Duality Gap Technique: A Unified Theory of First-Order Methods. SIAM J. Optim. 29 (1) (2019)
Michael Cohen, Jelena Diakonikolas, Lorenzo Orecchia
On Acceleration with Noise-Corrupted Gradients. ICML (2018)
Jelena Diakonikolas, Lorenzo Orecchia
Alternating Randomized Block Coordinate Descent. ICML (2018)
Jelena Diakonikolas, Maryam Fazel, Lorenzo Orecchia
Width-Independence Beyond Linear Objectives: Distributed Fair Packing and Covering Algorithms. CoRR (2018)
Jelena Diakonikolas, Lorenzo Orecchia
Accelerated Extra-Gradient Descent: A Novel Accelerated First-Order Method. ITCS (2018)
Michael B. Cohen, Jelena Diakonikolas, Lorenzo Orecchia
On Acceleration with Noise-Corrupted Gradients. CoRR (2018)
Jelena Diakonikolas, Lorenzo Orecchia
The Approximate Duality Gap Technique: A Unified Theory of First-Order Methods. CoRR (2017)
Jelena Diakonikolas, Lorenzo Orecchia
Accelerated Extra-Gradient Descent: A Novel Accelerated First-Order Method. CoRR (2017)
Zeyuan Allen Zhu, Lorenzo Orecchia
Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent. ITCS (2017)
Jelena Diakonikolas, Lorenzo Orecchia
) Distributed Iterations with a Single Algorithm and Simpler Analysis. CoRR (2017)
Cem Aksoylar, Lorenzo Orecchia, Venkatesh Saligrama
Connected Subgraph Detection with Mirror Descent on SDPs. ICML (2017)
Zeyuan Allen Zhu, Yin Tat Lee, Lorenzo Orecchia
Using Optimization to Obtain a Width-Independent, Parallel, Simpler, and Faster Positive SDP Solver. SODA (2016)
Zeyuan Allen Zhu, Aditya Bhaskara, Silvio Lattanzi, Vahab S. Mirrokni, Lorenzo Orecchia
Expanders via Local Edge Flips. SODA (2016)
Zeyuan Allen Zhu, Zhenyu Liao, Lorenzo Orecchia
Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates. STOC (2015)
Zeyuan Allen Zhu, Zhenyu Liao, Lorenzo Orecchia
Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates. CoRR (2015)
Zeyuan Allen Zhu, Yin Tat Lee, Lorenzo Orecchia
Using Optimization to Obtain a Width-Independent, Parallel, Simpler, and Faster Positive SDP Solver. CoRR (2015)
Zeyuan Allen Zhu, Lorenzo Orecchia
Using Optimization to Break the Epsilon Barrier: A Faster and Simpler Width-Independent Algorithm for Solving Positive Linear Programs in Parallel. SODA (2015)
Zeyuan Allen Zhu, Aditya Bhaskara, Silvio Lattanzi, Vahab S. Mirrokni, Lorenzo Orecchia
Expanders via Local Edge Flips. CoRR (2015)
Zeyuan Allen Zhu, Lorenzo Orecchia
Nearly-Linear Time Positive LP Solver with Faster Convergence Rate. STOC (2015)
Zeyuan Allen Zhu, Lorenzo Orecchia
Using Optimization to Break the Epsilon Barrier: A Faster and Simpler Width-Independent Algorithm for Solving Positive Linear Programs in Parallel. CoRR (2014)
Zeyuan Allen Zhu, Lorenzo Orecchia
Nearly-Linear Time Packing and Covering LP Solver with Faster Convergence Rate Than $O(1/\varepsilon^2)$. CoRR (2014)
Zeyuan Allen Zhu, Zhenyu Liao, Lorenzo Orecchia
Using Optimization to Find Maximum Inscribed Balls and Minimum Enclosing Balls. CoRR (2014)
Zeyuan Allen Zhu, Lorenzo Orecchia
A Novel, Simple Interpretation of Nesterov's Accelerated Method as a Combination of Gradient and Mirror Descent. CoRR (2014)
Jonathan A. Kelner, Yin Tat Lee, Lorenzo Orecchia, Aaron Sidford
An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations. SODA (2014)
Lorenzo Orecchia, Zeyuan Allen Zhu
Flow-Based Algorithms for Local Graph Clustering. SODA (2014)
Jonathan A. Kelner, Lorenzo Orecchia, Yin Tat Lee, Aaron Sidford
An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations CoRR (2013)
Jonathan A. Kelner, Lorenzo Orecchia, Aaron Sidford, Zeyuan Allen Zhu
A simple, combinatorial algorithm for solving SDD systems in nearly-linear time. STOC (2013)
Lorenzo Orecchia, Zeyuan Allen Zhu
Flow-Based Algorithms for Local Graph Clustering. CoRR (2013)
Jonathan A. Kelner, Lorenzo Orecchia, Aaron Sidford, Zeyuan Allen Zhu
A Simple, Combinatorial Algorithm for Solving SDD Systems in Nearly-Linear Time CoRR (2013)
Lorenzo Orecchia, Sushant Sachdeva, Nisheeth K. Vishnoi
)-time spectral algorithm for balanced separator. STOC (2012)
Michael W. Mahoney, Lorenzo Orecchia, Nisheeth K. Vishnoi
A local spectral method for graphs: with applications to improving graph partitions and exploring data graphs locally. J. Mach. Learn. Res. 13 (2012)
Michael W. Mahoney, Lorenzo Orecchia
Implementing regularization implicitly via approximate eigenvector computation. ICML (2011)
Lorenzo Orecchia, Nisheeth K. Vishnoi
Towards an SDP-based Approach to Spectral Methods: A Nearly-Linear-Time Algorithm for Graph Partitioning and Decomposition. SODA (2011)
Lorenzo Orecchia, Sushant Sachdeva, Nisheeth K. Vishnoi
Approximating the Exponential, the Lanczos Method and an \tilde{O}(m)-Time Spectral Algorithm for Balanced Separator CoRR (2011)
Michael W. Mahoney, Lorenzo Orecchia
Implementing regularization implicitly via approximate eigenvector computation CoRR (2010)
Lorenzo Orecchia, Nisheeth K. Vishnoi
Towards an SDP-based Approach to Spectral Methods: A Nearly-Linear-Time Algorithm for Graph Partitioning and Decomposition CoRR (2010)
Michael W. Mahoney, Lorenzo Orecchia, Nisheeth K. Vishnoi
A Spectral Algorithm for Improving Graph Partitions CoRR (2009)
Kevin J. Lang, Michael W. Mahoney, Lorenzo Orecchia
Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and Flow. SEA (2009)
Lorenzo Orecchia, Leonard J. Schulman, Umesh V. Vazirani, Nisheeth K. Vishnoi
On partitioning graphs via single commodity flows. STOC (2008)
Devdatt P. Dubhashi, Olle Häggström, Lorenzo Orecchia, Alessandro Panconesi, Chiara Petrioli, Andrea Vitaletti
Localized Techniques for Broadcasting in Wireless Sensor Networks. Algorithmica 49 (4) (2007)
Lorenzo Orecchia, Alessandro Panconesi, Chiara Petrioli, Andrea Vitaletti
Localized techniques for broadcasting in wireless sensor networks. DIALM-POMC (2004)

Lorenzo Orecchia.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Lorenzo Orecchia