activity
20182024
most citedFaster Randomized Interior Point Methods for Tall/Wide Linear Programs

4 citations · 7 across the 6 of their papers we have counts for

collaborators
Showing 2023Show all

3 papers · 1 filter

cs.DS2023

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).…

cs.DS2023

Universal Matrix Sparsifiers and Fast Deterministic Algorithms for Linear Algebra

Rajarshi Bhattacharjee, Gregory Dexter, Cameron Musco +3

Let satisfy , where is the all ones matrix and is the spectral norm. It is well-kno…

cs.LG2023

Feature Space Sketching for Logistic Regression

Gregory Dexter, Rajiv Khanna, Jawad Raheel +1

We present novel bounds for coreset construction, feature selection, and dimensionality reduction for logistic regression. All three approaches can be thought of as sketching the l…