research
∙
07/14/2023
Performance of â„“_1 Regularization for Sparse Convex Optimization
Despite widespread adoption in practice, guarantees for the LASSO and Gr...
share
research
∙
06/01/2023
Sharper Bounds for â„“_p Sensitivity Sampling
In large scale machine learning, random sampling is a popular way to app...
research
∙
04/18/2023
New Subset Selection Algorithms for Low Rank Approximation: Offline and Online
Subset selection for the rank k approximation of an n× d matrix A offers...
research
∙
09/29/2022
Sequential Attention for Feature Selection
Feature selection is the problem of selecting a subset of features for a...
research
∙
07/17/2022
Online Lewis Weight Sampling
The seminal work of Cohen and Peng introduced Lewis weight sampling to t...
research
∙
04/08/2022
High-Dimensional Geometric Streaming in Polynomial Space
Many existing algorithms for streaming geometric data analysis have been...
research
∙
11/09/2021
Active Sampling for Linear Regression Beyond the â„“_2 Norm
We study active sampling algorithms for linear regression, which aim to ...
research
∙
11/01/2021
Improved Algorithms for Low Rank Approximation from Sparsity
We overcome two major bottlenecks in the study of low rank approximation...
research
∙
04/27/2021
Exponentially Improved Dimensionality Reduction for â„“_1: Subspace Embeddings and Independence Testing
Despite many applications, dimensionality reduction in the â„“_1-norm is m...
research
∙
11/14/2019
Graph Spanners in the Message-Passing Model
Graph spanners are sparse subgraphs which approximately preserve all pai...
research
∙
09/24/2019
The Query Complexity of Mastermind with â„“_p Distances
Consider a variant of the Mastermind game in which queries are â„“_p dista...
research
∙
05/15/2019
