Search Results for author:
Found 2 papers, 0 papers with code
On the Power of Interactive Proofs for Learning
- 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.
A graph-theoretic approach to multitasking
A key feature of neural network architectures is their ability to support the simultaneous interaction among large numbers of units in the learning and processing of representations.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
