Research map / Learning theory and algorithms / Sample complexity
Efficiently Learning Fourier Sparse Set Functions
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Learning Set Functions that are Sparse in Non-Orthogonal Fourier Bases (AAAI 2021 · similarity 0.92)
- Price of Parsimony: Complexity of Fourier Sparsity Testing (NeurIPS 2025 · similarity 0.89)
- Fourier Sparse Leverage Scores and Approximate Kernel Learning (NeurIPS 2020 · similarity 0.88)
- Implicit Sensing for Fourier Sparse Boolean Functions (ICLR 2026 · similarity 0.88)
- On the Complexity of Learning Sparse Functions with Statistical and Gradient Queries (NeurIPS 2024 · similarity 0.85)
- Position: Spectral GNNs Rely Less on Graph Fourier Basis than Conceived (ICML 2025 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.