Lorenzo Orecchia

Computer Science · Physical Sciences

17h-index1.3kcitations63works0.02yr avg
OpenAlex↗ORCID↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Stochastic Gradient Optimization Techniques(27), Complexity and Algorithms in Graphs(22), Sparse and Compressive Sensing Techniques(15), Advanced Optimization Algorithms Research(11), Optimization and Search Problems(9)

Publications63 total

Atlas-based Manifold Representations for Interpretable Riemannian Machine Learning
arXiv (Cornell University)·2025Open Access
Manifold learning and optimization using tangent space proxies
arXiv (Cornell University)·2025Open Access
Geometry and Duality of Alternating Markov Chains
arXiv (Cornell University)·2024Open Access
Top-$K$ ranking with a monotone adversary
arXiv (Cornell University)·2024Open Access
Training Binary Neural Networks via Gaussian Variational Inference and Low-Rank Semidefinite Programming
2024
Hypergraph Diffusions and Resolvents for Norm-Based Hypergraph Laplacians
arXiv (Cornell University)·2023Open Access
Submodular Hypergraph Partitioning: Metric Relaxations and Fast Algorithms via an Improved Cut-Matching Game
arXiv (Cornell University)·2023Open Access
Fair Packing and Covering on a Relative Scale
SIAM Journal on Optimization·2020Open Access
Conjugate Gradients and Accelerated Methods Unified: The Approximate Duality Gap View
arXiv (Cornell University)·2019· 2 citedOpen Access
The Approximate Duality Gap Technique: A Unified Theory of First-Order Methods
SIAM Journal on Optimization·2019· 62 citedOpen Access
Width-Independence Beyond Linear Objectives: Distributed Fair Packing and Covering Algorithms.
arXiv (Cornell University)·2018· 3 citedOpen Access
On Acceleration with Noise-Corrupted Gradients
International Conference on Machine Learning·2018· 39 cited
Alternating Randomized Block Coordinate Descent
International Conference on Machine Learning·2018· 5 cited
On Acceleration with Noise-Corrupted Gradients
arXiv (Cornell University)·2018· 6 citedOpen Access
Alternating Randomized Block Coordinate Descent
OpenBU (Boston University)·2018· 7 citedOpen Access
Nearly linear-time packing and covering LP solvers
Mathematical Programming·2018· 2 citedOpen Access
Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent
OpenBU/Boston University Institutional Repository (Boston University)·2018· 47 citedOpen Access
Solving Packing and Covering LPs in $\tilde{O}(\frac{1}{\epsilon^2})$ Distributed Iterations with a Single Algorithm and Simpler Analysis
arXiv (Cornell University)·2017· 2 citedOpen Access
Solving Packing and Covering LPs in $\tilde{O}(\frac{1}{ε^2})$ Distributed Iterations with a Single Algorithm and Simpler Analysis
arXiv (Cornell University)·2017· 1 citedOpen Access
Connected subgraph detection with mirror descent on SDPs
2017· 10 cited
page 1 of 4Next →

Frequent Co-authors

Jelena Diakonikolas(11), Zeyuan Allen-Zhu(10), Nisheeth K. Vishnoi(9), Michael W. Mahoney(8), Jonathan A. Kelner(6), Zeyuan Allen Zhu(6), Aaron Sidford(5), Yin Tat Lee(4), Sushant Sachdeva(2), Alessandro Panconesi(2), Chiara Petrioli(2), Andrea Vitaletti(2), Michael B. Cohen(2), Samantha J. Riesenfeld(2), Zhenyu Liao(2), Aaron Sidford(1), Leonard J. Schulman(1), Umesh Vazirani(1), AndreR.O. Cavalcanti(1), N. A. Stover(1)