Ameya Velingker

Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes

We prove that a random linear code over

An entropy sumset inequality and polynomially fast convergence to shannon capacity over all alphabets

\mathbb{F}_q

A fast algorithm for well-spaced points and approximate delaunay graphs

, with probability arbitrarily close to 1, is list decodable at radius

Approximating Nearest Neighbor Distances

1-1/q-\epsilon

(1 + Ω(1))-approximation to MAX-CUT requires linear space

with list size

Restricted isometry of fourier matrices and list decodability of random linear codes

L=O(1/\epsilon^2)

Bridging the capacity gap between interactive and one-way communication

and rate

On the Sensitivity Conjecture for Read-k Formulas.

R=\Omega_q(\epsilon^2/(\log^3(1/\epsilon)))

Random Fourier Features for Kernel Ridge Regression: Approximation Bounds and Statistical Guarantees

. Up to the polylogarithmic factor in

Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes.

1/\epsilon