1 citations · 2 across the 5 of their papers we have counts for
5 papers · 1 filter
A Fast Spectral Algorithm for Mean Estimation with Sub-Gaussian Rates
Zhixian Lei, Kyle Luh, Prayaag Venkat +1
We study the algorithmic problem of estimating the mean of heavy-tailed random vector in , given i.i.d. samples. The goal is to design an efficient estimator that…
Some new results in random matrices over finite fields
Kyle Luh, Sean Meehan, Hoi H. Nguyen
In this note we give various characterizations of random walks with possibly different steps that have relatively large discrepancy from the uniform distribution modulo a prime p,…
On the counting problem in inverse Littlewood--Offord theory
Asaf Ferber, Vishesh Jain, Kyle Luh +1
Let be i.i.d. Rademacher random variables taking values with probability each. Given an integer vector , its c…
Four Deviations Suffice for Rank 1 Matrices
Rasmus Kyng, Kyle Luh, Zhao Song
We prove a matrix discrepancy bound that strengthens the famous Kadison-Singer result of Marcus, Spielman, and Srivastava. Consider any independent scalar random variables $ξ_1, \l…
Tail bounds for gaps between eigenvalues of sparse random matrices
Patrick Lopatto, Kyle Luh
We prove the first eigenvalue repulsion bound for sparse random matrices. As a consequence, we show that these matrices have simple spectrum, improving the range of sparsity and er…