no code implementations • 11 Apr 2024 • Tom Gur, Mohammad Mahdi Jahanara, Mohammad Mahdi Khodabandeh, Ninad Rajgopal, Bahar Salamatian, Igor Shinkar
- We construct an interactive protocol for learning the $t$ largest Fourier characters of a given function $f \colon \{0, 1\}^n \to \{0, 1\}$ up to an arbitrarily small error, wherein the verifier uses $\mathsf{poly}(t)$ random examples.