Sparse Fourier Transform in Any Constant Dimension with Nearly-Optimal Sample Complexity in Sublinear Time.
Michael KapralovPublished in: CoRR (2016)
Keyphrases
- fourier transform
- sample complexity
- frequency domain
- fourier coefficients
- constant factor
- signal processing
- special case
- theoretical analysis
- pac learning
- active learning
- upper bound
- learning problems
- fourier domain
- generalization error
- lower bound
- vc dimension
- discrete fourier transform
- sample size
- supervised learning
- worst case
- optimal solution
- learning algorithm
- concept classes
- fast fourier transform
- lifting wavelet
- covering numbers
- image processing