1 citations · 2 across the 10 of their papers we have counts for
10 papers · 1 filter
Fast Algorithms for Sparse PCA and Robust Sparse Estimation
Giannis Iakovidis, Ankit Pensia
We study fast algorithms for sparse-PCA certification. Given a positive semidefinite matrix , the problem asks either to rule out a large -sparse quadratic form or to return…
Information-Computation Tradeoffs for Noiseless Linear Regression with Oblivious Contamination
Ilias Diakonikolas, Chao Gao, Daniel M. Kane +2
We study the task of noiseless linear regression under Gaussian covariates in the presence of additive oblivious contamination. Specifically, we are given i.i.d.\ samples from a di…
SoS Certificates for Sparse Singular Values and Their Applications: Robust Statistics, Subspace Distortion, and More
Ilias Diakonikolas, Samuel B. Hopkins, Ankit Pensia +1
We study for random rectangular matrices. If is an matrix with independent Gaussian entries, we give a new family of…
SoS Certifiability of Subgaussian Distributions and its Algorithmic Applications
Ilias Diakonikolas, Samuel B. Hopkins, Ankit Pensia +1
We prove that there is a universal constant so that for every , every centered subgaussian distribution on , and every even $p \in…
Optimal Robust Estimation under Local and Global Corruptions: Stronger Adversary and Smaller Error
Thanasis Pittas, Ankit Pensia
Algorithmic robust statistics has traditionally focused on the contamination model where a small fraction of the samples are arbitrarily corrupted. We consider a recent contaminati…
A Sub-Quadratic Time Algorithm for Robust Sparse Mean Estimation
Ankit Pensia
We study the algorithmic problem of sparse mean estimation in the presence of adversarial outliers. Specifically, the algorithm observes a \emph{corrupted} set of samples from $\ma…