research
∙
07/20/2023
Hypergraph Diffusions and Resolvents for Norm-Based Hypergraph Laplacians
The development of simple and fast hypergraph spectral methods has been ...
share
research
∙
01/21/2023
Efficient Flow-based Approximation Algorithms for Submodular Hypergraph Partitioning via a Generalized Cut-Matching Game
In the past 20 years, increasing complexity in real world data has lead ...
research
∙
06/29/2019
Conjugate Gradients and Accelerated Methods Unified: The Approximate Duality Gap View
This note provides a novel, simple analysis of the method of conjugate g...
research
∙
08/07/2018
Width-Independence Beyond Linear Objectives: Distributed Fair Packing and Covering Algorithms
In network routing and resource allocation, α-fair utility functions are...
research
∙
05/31/2018
On Acceleration with Noise-Corrupted Gradients
Accelerated algorithms have broad applications in large-scale optimizati...
research
∙
06/14/2017
Accelerated Extra-Gradient Descent: A Novel Accelerated First-Order Method
We provide a novel accelerated first-order method that achieves the asym...
research
∙
06/16/2015
Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates
In this paper, we provide a novel construction of the linear-sized spect...
research
∙
07/06/2014
Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent
First-order methods play a central role in large-scale machine learning....
research
∙
07/10/2013
Flow-Based Algorithms for Local Graph Clustering
Given a subset S of vertices of an undirected graph G, the cut-improveme...
research
∙
10/04/2010