Lorenzo Orecchia

CoRR, 2024

Fast Algorithms for Hypergraph PageRank with Applications to Semi-Supervised Learning.

[BibT_eX]

[DOI]

Adela Frances DePavia

Erasmo Tani

Proceedings of the Forty-first International Conference on Machine Learning, 2024

Top-K ranking with a monotone adversary.

[BibT_eX]

[DOI]

Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

2023

Hypergraph Diffusions and Resolvents for Norm-Based Hypergraph Laplacians.

[BibT_eX]

[DOI]

Antares Chen

Adela Frances DePavia

Erasmo Tani

CoRR, 2023

Efficient Flow-based Approximation Algorithms for Submodular Hypergraph Partitioning via a Generalized Cut-Matching Game.

[BibT_eX]

[DOI]

Antares Chen

Erasmo Tani

CoRR, 2023

2022

Practical Almost-Linear-Time Approximation Algorithms for Hybrid and Overlapping Graph Clustering.

[BibT_eX]

[DOI]

Charalampos E. Tsourakakis

Kunal Talwar

Proceedings of the International Conference on Machine Learning, 2022

2020

Fair Packing and Covering on a Relative Scale.

[BibT_eX]

[DOI]

Maryam Fazel

SIAM J. Optim., 2020

2019

The Approximate Duality Gap Technique: A Unified Theory of First-Order Methods.

[BibT_eX]

[DOI]

SIAM J. Optim., 2019

Nearly linear-time packing and covering LP solvers - Achieving width-independence and -convergence.

[BibT_eX]

[DOI]

Zeyuan Allen-Zhu

Math. Program., 2019

Conjugate Gradients and Accelerated Methods Unified: The Approximate Duality Gap View.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Width-Independence Beyond Linear Objectives: Distributed Fair Packing and Covering Algorithms.

[BibT_eX]

[DOI]

Maryam Fazel

CoRR, 2018

Accelerated Extra-Gradient Descent: A Novel Accelerated First-Order Method.

[BibT_eX]

[DOI]

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

Alternating Randomized Block Coordinate Descent.

[BibT_eX]

[DOI]

Proceedings of the 35th International Conference on Machine Learning, 2018

On Acceleration with Noise-Corrupted Gradients.

[BibT_eX]

[DOI]

Michael Cohen

Proceedings of the 35th International Conference on Machine Learning, 2018

2017

Solving Packing and Covering LPs in Õ(1/ε<sup>2</sup>) Distributed Iterations with a Single Algorithm and Simpler Analysis.

[BibT_eX]

[DOI]

CoRR, 2017

Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent.

[BibT_eX]

[DOI]

Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

Connected Subgraph Detection with Mirror Descent on SDPs.

[BibT_eX]

[DOI]

Cem Aksoylar

Venkatesh Saligrama

Proceedings of the 34th International Conference on Machine Learning, 2017

2016

Expanders via Local Edge Flips.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Using Optimization to Obtain a Width-Independent, Parallel, Simpler, and Faster Positive SDP Solver.

[BibT_eX]

[DOI]

Yin Tat Lee

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

Nearly-Linear Time Positive LP Solver with Faster Convergence Rate.

[BibT_eX]

[DOI]

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates.

[BibT_eX]

[DOI]

Zhenyu Liao

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Using Optimization to Break the Epsilon Barrier: A Faster and Simpler Width-Independent Algorithm for Solving Positive Linear Programs in Parallel.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

Nearly-Linear Time Packing and Covering LP Solver with Faster Convergence Rate Than $O(1/\varepsilon^2)$.

[BibT_eX]

[DOI]

CoRR, 2014

A Novel, Simple Interpretation of Nesterov's Accelerated Method as a Combination of Gradient and Mirror Descent.

[BibT_eX]

[DOI]

CoRR, 2014

Using Optimization to Find Maximum Inscribed Balls and Minimum Enclosing Balls.

[BibT_eX]

[DOI]

Zhenyu Liao

CoRR, 2014

Flow-Based Algorithms for Local Graph Clustering.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013

A simple, combinatorial algorithm for solving SDD systems in nearly-linear time.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing Conference, 2013

2012

A local spectral method for graphs: with applications to improving graph partitions and exploring data graphs locally.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2012

Approximating the exponential, the lanczos method and an Õ(<i>m</i>)-time spectral algorithm for balanced separator.

[BibT_eX]

[DOI]

Sushant Sachdeva

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

2011

Fast Approximation Algorithms for Graph Partitioning Using Spectral and Semidefinite-Programming Techniques.

[BibT_eX]

[DOI]

PhD thesis, 2011

Approximating the Exponential, the Lanczos Method and an \tilde{O}(m)-Time Spectral Algorithm for Balanced Separator

[BibT_eX]

[DOI]

Sushant Sachdeva

CoRR, 2011

Towards an SDP-based Approach to Spectral Methods: A Nearly-Linear-Time Algorithm for Graph Partitioning and Decomposition.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Implementing regularization implicitly via approximate eigenvector computation.

[BibT_eX]

[DOI]

Proceedings of the 28th International Conference on Machine Learning, 2011

2009

A Spectral Algorithm for Improving Graph Partitions

[BibT_eX]

[DOI]

CoRR, 2009

Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and Flow.

[BibT_eX]

[DOI]

Kevin J. Lang