Department of Mathematics, Massachusetts Institute of Technology; Department of Mathematics and IDSS, Massachusetts Institute of Technology
Frederic Koehler, Andrej Risteski
theory;representational power;universal approximators;polynomial kernels;latent sparsity;beyond worst case;separation result
The Comparative Power of ReLU Networks and Polynomial Kernels in the Presence of Sparse Latent Structure