Conference
BEYOND WORST-CASE DIMENSIONALITY REDUCTION FOR SPARSE VECTORS
BEYOND WORST-CASE DIMENSIONALITY REDUCTION FOR SPARSE VECTORS
Learning-augmented sketching offers improved performance for privacy preserving and secure GWAS
LEVATTENTION: TIME, SPACE AND STREAMING EFFICIENT ALGORITHM FOR HEAVY ATTENTIONS
STREAMING ALGORITHMS FOR ℓp FLOWS AND ℓp REGRESSION
Tight Sampling Bounds for Eigenvalue Approximation
Unbiased Insights: Optimal Streaming Algorithms for $\ell_p$ Sampling, the Forget Model, and Beyond
A Strong Separation for Adversarially Robust l<sub>0</sub> Estimation for Linear Sketches
ADAPTIVE REGRET FOR BANDITS MADE POSSIBLE: TWO QUERIES SUFFICE
Adversarially Robust Dense-Sparse Tradeoffs via Heavy-Hitters
Approximating the Top Eigenvector in Random Order Streams
Communication Bounds for the Distributed Experts Problem
Coresets for Multiple ℓp Regression
Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond