170 citations · 527 across the 39 of their papers we have counts for
19 papers · 1 filter
Sketching Algorithms for Sparse Dictionary Learning: PTAS and Turnstile Streaming
Gregory Dexter, Petros Drineas, David P. Woodruff +1
Sketching algorithms have recently proven to be a powerful approach both for designing low-space streaming algorithms as well as fast polynomial time approximation schemes (PTAS).…
Faster Randomized Interior Point Methods for Tall/Wide Linear Programs
Agniva Chowdhury, Gregory Dexter, Palma London +2
Linear programming (LP) is an extremely useful tool which has been successfully applied to solve various problems in a wide range of areas, including operations research, engineeri…
Approximation Algorithms for Sparse Principal Component Analysis
Agniva Chowdhury, Petros Drineas, David P. Woodruff +1
Principal component analysis (PCA) is a widely used dimension reduction technique in machine learning and multivariate statistics. To improve the interpretability of PCA, various a…
Speeding up Linear Programming using Randomized Linear Algebra
Agniva Chowdhury, Palma London, Haim Avron +1
Linear programming (LP) is an extremely useful tool and has been successfully applied to solve various problems in a wide range of areas, including operations research, engineering…
Near Optimal Linear Algebra in the Online and Sliding Window Models
Vladimir Braverman, Petros Drineas, Cameron Musco +4
We initiate the study of numerical linear algebra in the sliding window model, where only the most recent updates in a stream form the underlying data set. We first introduce a…
Lectures on Randomized Numerical Linear Algebra
Petros Drineas, Michael W. Mahoney
This chapter is based on lectures on Randomized Numerical Linear Algebra from the 2016 Park City Mathematics Institute summer school on The Mathematics of Data.