#### Filter Results:

#### Publication Year

2010

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Michael B. Cohen, Rasmus Kyng, Gary L. Miller, Jakub W. Pachocki, Richard Peng, Anup Rao +1 other
- STOC
- 2014

We show an algorithm for solving symmetric diagonally dominant (SDD) linear systems with <i>m</i> non-zero entries to a relative error of <i>ε</i> in <i>O</i>(<i>m</i> log<sup>1/2</sup> <i>n</i> log<sup><i>c</i></sup> <i>n</i> log(1/<i>ε</i>)) time. Our approach follows the recursive preconditioning framework, which aims to reduce graphs to trees… (More)

We introduce the sparsified Cholesky and sparsified multigrid algorithms for solving systems of linear equations. These algorithms accelerate Gaussian elimination by sparsifying the nonzero matrix entries created by the elimination process. We use these new algorithms to derive the first nearly linear time algorithms for solving systems of equations in… (More)

Given a directed acyclic graph G, and a set of values y on the vertices, the Isotonic Regression of y is a vector x that respects the partial order described by G, and minimizes x − y , for a specified norm. This paper gives improved algorithms for computing the Isotonic Regression for all weighted p-norms with rigorous performance guarantees. Our… (More)

We show how to perform sparse approximate Gaussian elimination for Laplacian matrices. We present a simple, nearly linear time algorithm that approximates a Laplacian by a matrix with a sparse Cholesky factorization – the version of Gaussian elimination for symmetric matrices. This is the first nearly linear time solver for Laplacian systems that is based… (More)

We develop fast algorithms for solving regression problems on graphs where one is given the value of a function at some vertices, and must find its smoothest possible extension to all vertices. The extension we compute is the absolutely minimal Lipschitz extension, and is the limit for large p of p-Laplacian regularization. We present an algorithm that… (More)

We show that preconditioners constructed by random sampling can perform well without meeting the standard requirements of iterative methods. When applied to graph Laplacians, this leads to ultra-sparsifiers that in expectation behave as the nearly-optimal ones given by [Kolla-Makarychev-Saberi-Teng STOC'10]. Combining this with the recursive preconditioning… (More)

We propose an algorithm for di-mensionality reduction on the simplex, mapping a set of high-dimensional distributions to a space of lower-dimensional distributions, whilst approximately preserving pairwise Hellinger distance between distributions. By introducing a restriction on the input data to distributions that are in some sense quite smooth, we can map… (More)

A spectral sparsifier of a graph G is a sparser graph H that approximately preserves the quadratic form of G, i.e. for all vectors x, x T LGx ≈ x T LH x, where LG and LH denote the respective graph Lapla-cians. Spectral sparsifiers generalize cut sparsifiers, and have found many applications in designing graph algorithms. In recent years, there has been… (More)

We present an algorithm that, with high probability, generates a random spanning tree from an edge-weighted undirected graph in O(n 5/3 m 1/3) time 1. The tree is sampled from a distribution where the probability of each tree is proportional to the product of its edge weights. This improves upon the previous best algorithm due to Colbourn et al. that runs… (More)

We develop fast algorithms for solving regression problems on graphs where one is given the value of a function at some vertices, and must find its smoothest possible extension to all vertices. The extension we compute is the absolutely minimal Lipschitz extension, and is the limit for large p of p-Laplacian regu-larization. We present an algorithm that… (More)