Lorenzo Orecchia

56 papers A* 20A 2B 1Journal 31Unranked 1

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Atlas-based Manifold Representations for Interpretable Riemannian Machine Learning. CoRR Ryan A. Robinett, Sophia A. Madejski, Kyle Ruark, Samantha J. Riesenfeld, Lorenzo Orecchia
2025	J	`jnl`	Manifold learning and optimization using tangent space proxies. CoRR Ryan A. Robinett, Lorenzo Orecchia, Samantha J. Riesenfeld
2025	A*	`conf`	Submodular Hypergraph Partitioning: Metric Relaxations and Fast Algorithms via an Improved Cut-Matching Game. ICALP Antares Chen, Lorenzo Orecchia, Erasmo Tani
2024	A*	`conf`	Fast Algorithms for Hypergraph PageRank with Applications to Semi-Supervised Learning. ICML Konstantinos Ameranis, Adela Frances DePavia, Lorenzo Orecchia, Erasmo Tani
2024	J	`jnl`	Geometry and Duality of Alternating Markov Chains. CoRR Deven Mithal, Lorenzo Orecchia
2024	A*	`conf`	Top-K ranking with a monotone adversary. COLT Yuepeng Yang, Antares Chen, Lorenzo Orecchia, Cong Ma
2024	J	`jnl`	Top-K ranking with a monotone adversary. CoRR Yuepeng Yang, Antares Chen, Lorenzo Orecchia, Cong Ma
2024	A*	`conf`	Training Binary Neural Networks via Gaussian Variational Inference and Low-Rank Semidefinite Programming. NeurIPS Lorenzo Orecchia, Jiawei Hu, Xue He, Wang Mark, XuLei Yang, Min Wu, Xue Geng
2023	J	`jnl`	Efficient Flow-based Approximation Algorithms for Submodular Hypergraph Partitioning via a Generalized Cut-Matching Game. CoRR Konstantinos Ameranis, Antares Chen, Lorenzo Orecchia, Erasmo Tani
2023	J	`jnl`	Hypergraph Diffusions and Resolvents for Norm-Based Hypergraph Laplacians. CoRR Konstantinos Ameranis, Antares Chen, Adela Frances DePavia, Lorenzo Orecchia, Erasmo Tani
2022	A*	`conf`	Practical Almost-Linear-Time Approximation Algorithms for Hybrid and Overlapping Graph Clustering. ICML Lorenzo Orecchia, Konstantinos Ameranis, Charalampos E. Tsourakakis, Kunal Talwar
2020	J	`jnl`	Fair Packing and Covering on a Relative Scale. SIAM J. Optim. Jelena Diakonikolas, Maryam Fazel, Lorenzo Orecchia
2019	J	`jnl`	Conjugate Gradients and Accelerated Methods Unified: The Approximate Duality Gap View. CoRR Jelena Diakonikolas, Lorenzo Orecchia
2019	J	`jnl`	Nearly linear-time packing and covering LP solvers - Achieving width-independence and -convergence. Math. Program. Zeyuan Allen-Zhu, Lorenzo Orecchia
2019	J	`jnl`	The Approximate Duality Gap Technique: A Unified Theory of First-Order Methods. SIAM J. Optim. Jelena Diakonikolas, Lorenzo Orecchia
2018	A	`conf`	Accelerated Extra-Gradient Descent: A Novel Accelerated First-Order Method. ITCS Jelena Diakonikolas, Lorenzo Orecchia
2018	A*	`conf`	Alternating Randomized Block Coordinate Descent. ICML Jelena Diakonikolas, Lorenzo Orecchia
2018	A*	`conf`	On Acceleration with Noise-Corrupted Gradients. ICML Michael Cohen, Jelena Diakonikolas, Lorenzo Orecchia
2018	J	`jnl`	On Acceleration with Noise-Corrupted Gradients. CoRR Michael B. Cohen, Jelena Diakonikolas, Lorenzo Orecchia
2018	J	`jnl`	Width-Independence Beyond Linear Objectives: Distributed Fair Packing and Covering Algorithms. CoRR Jelena Diakonikolas, Maryam Fazel, Lorenzo Orecchia
2017	J	`jnl`	Accelerated Extra-Gradient Descent: A Novel Accelerated First-Order Method. CoRR Jelena Diakonikolas, Lorenzo Orecchia
2017	A*	`conf`	Connected Subgraph Detection with Mirror Descent on SDPs. ICML Cem Aksoylar, Lorenzo Orecchia, Venkatesh Saligrama
2017	A	`conf`	Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent. ITCS Zeyuan Allen Zhu, Lorenzo Orecchia
2017	J	`jnl`	Solving Packing and Covering LPs in Õ(1/ε CoRR Jelena Diakonikolas, Lorenzo Orecchia
2017	J	`jnl`	The Approximate Duality Gap Technique: A Unified Theory of First-Order Methods. CoRR Jelena Diakonikolas, Lorenzo Orecchia
2016	A*	`conf`	Expanders via Local Edge Flips. SODA Zeyuan Allen Zhu, Aditya Bhaskara, Silvio Lattanzi, Vahab S. Mirrokni, Lorenzo Orecchia
2016	A*	`conf`	Using Optimization to Obtain a Width-Independent, Parallel, Simpler, and Faster Positive SDP Solver. SODA Zeyuan Allen Zhu, Yin Tat Lee, Lorenzo Orecchia
2015	J	`jnl`	Expanders via Local Edge Flips. CoRR Zeyuan Allen Zhu, Aditya Bhaskara, Silvio Lattanzi, Vahab S. Mirrokni, Lorenzo Orecchia
2015	A*	`conf`	Nearly-Linear Time Positive LP Solver with Faster Convergence Rate. STOC Zeyuan Allen Zhu, Lorenzo Orecchia
2015	A*	`conf`	Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates. STOC Zeyuan Allen Zhu, Zhenyu Liao, Lorenzo Orecchia
2015	J	`jnl`	Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates. CoRR Zeyuan Allen Zhu, Zhenyu Liao, Lorenzo Orecchia
2015	A*	`conf`	Using Optimization to Break the Epsilon Barrier: A Faster and Simpler Width-Independent Algorithm for Solving Positive Linear Programs in Parallel. SODA Zeyuan Allen Zhu, Lorenzo Orecchia
2015	J	`jnl`	Using Optimization to Obtain a Width-Independent, Parallel, Simpler, and Faster Positive SDP Solver. CoRR Zeyuan Allen Zhu, Yin Tat Lee, Lorenzo Orecchia
2014	J	`jnl`	A Novel, Simple Interpretation of Nesterov's Accelerated Method as a Combination of Gradient and Mirror Descent. CoRR Zeyuan Allen Zhu, Lorenzo Orecchia
2014	A*	`conf`	An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations. SODA Jonathan A. Kelner, Yin Tat Lee, Lorenzo Orecchia, Aaron Sidford
2014	A*	`conf`	Flow-Based Algorithms for Local Graph Clustering. SODA Lorenzo Orecchia, Zeyuan Allen Zhu
2014	J	`jnl`	Nearly-Linear Time Packing and Covering LP Solver with Faster Convergence Rate Than $O(1/\varepsilon^2)$. CoRR Zeyuan Allen Zhu, Lorenzo Orecchia
2014	J	`jnl`	Using Optimization to Break the Epsilon Barrier: A Faster and Simpler Width-Independent Algorithm for Solving Positive Linear Programs in Parallel. CoRR Zeyuan Allen Zhu, Lorenzo Orecchia
2014	J	`jnl`	Using Optimization to Find Maximum Inscribed Balls and Minimum Enclosing Balls. CoRR Zeyuan Allen Zhu, Zhenyu Liao, Lorenzo Orecchia
2013	J	`jnl`	A Simple, Combinatorial Algorithm for Solving SDD Systems in Nearly-Linear Time CoRR Jonathan A. Kelner, Lorenzo Orecchia, Aaron Sidford, Zeyuan Allen Zhu
2013	A*	`conf`	A simple, combinatorial algorithm for solving SDD systems in nearly-linear time. STOC Jonathan A. Kelner, Lorenzo Orecchia, Aaron Sidford, Zeyuan Allen Zhu
2013	J	`jnl`	An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations CoRR Jonathan A. Kelner, Lorenzo Orecchia, Yin Tat Lee, Aaron Sidford
2013	J	`jnl`	Flow-Based Algorithms for Local Graph Clustering. CoRR Lorenzo Orecchia, Zeyuan Allen Zhu
2012	J	`jnl`	A local spectral method for graphs: with applications to improving graph partitions and exploring data graphs locally. J. Mach. Learn. Res. Michael W. Mahoney, Lorenzo Orecchia, Nisheeth K. Vishnoi
2012	A*	`conf`	Approximating the exponential, the lanczos method and an Õ( STOC Lorenzo Orecchia, Sushant Sachdeva, Nisheeth K. Vishnoi
2011	J	`jnl`	Approximating the Exponential, the Lanczos Method and an \tilde{O}(m)-Time Spectral Algorithm for Balanced Separator CoRR Lorenzo Orecchia, Sushant Sachdeva, Nisheeth K. Vishnoi
2011	—	`—`	Fast Approximation Algorithms for Graph Partitioning Using Spectral and Semidefinite-Programming Techniques. Lorenzo Orecchia
2011	A*	`conf`	Implementing regularization implicitly via approximate eigenvector computation. ICML Michael W. Mahoney, Lorenzo Orecchia
2011	A*	`conf`	Towards an SDP-based Approach to Spectral Methods: A Nearly-Linear-Time Algorithm for Graph Partitioning and Decomposition. SODA Lorenzo Orecchia, Nisheeth K. Vishnoi
2010	J	`jnl`	Implementing regularization implicitly via approximate eigenvector computation CoRR Michael W. Mahoney, Lorenzo Orecchia
2010	J	`jnl`	Towards an SDP-based Approach to Spectral Methods: A Nearly-Linear-Time Algorithm for Graph Partitioning and Decomposition CoRR Lorenzo Orecchia, Nisheeth K. Vishnoi
2009	J	`jnl`	A Spectral Algorithm for Improving Graph Partitions CoRR Michael W. Mahoney, Lorenzo Orecchia, Nisheeth K. Vishnoi
2009	B	`conf`	Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and Flow. SEA Kevin J. Lang, Michael W. Mahoney, Lorenzo Orecchia
2008	A*	`conf`	On partitioning graphs via single commodity flows. STOC Lorenzo Orecchia, Leonard J. Schulman, Umesh V. Vazirani, Nisheeth K. Vishnoi
2007	J	`jnl`	Localized Techniques for Broadcasting in Wireless Sensor Networks. Algorithmica Devdatt P. Dubhashi, Olle Häggström, Lorenzo Orecchia, Alessandro Panconesi, Chiara Petrioli, Andrea Vitaletti
2004	—	`conf`	Localized techniques for broadcasting in wireless sensor networks. DIALM-POMC Lorenzo Orecchia, Alessandro Panconesi, Chiara Petrioli, Andrea Vitaletti