73 citations · 116 across the 12 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
cs.DS2017
On Computing Min-Degree Elimination Orderings
Matthew Fahrbach, Gary L. Miller, Richard Peng +3
We study faster algorithms for producing the minimum degree ordering used to speed up Gaussian elimination. This ordering is based on viewing the non-zero elements of a symmetric p…
cs.DS2017
Regression using Lewis Weights Preconditioning and Stochastic Gradient Descent
David Durfee, Kevin A. Lai, Saurabh Sawlani
We present preconditioned stochastic gradient descent (SGD) algorithms for the minimization problem in the overdetermined case, where there are far…
cs.DS2017
Density Independent Algorithms for Sparsifying -Step Random Walks
Gorav Jindal, Pavel Kolev, Richard Peng +1
We give faster algorithms for producing sparse approximations of the transition matrices of -step random walks on undirected, weighted graphs. These transition matrices also for…