Pages that link to "Item:Q4277547"
From MaRDI portal
The following pages link to Learning Decision Trees Using the Fourier Spectrum (Q4277547):
Displaying 50 items.
- Population recovery and partial identification (Q255358) (← links)
- A multiscale sub-linear time Fourier algorithm for noisy data (Q262947) (← links)
- Reliable agnostic learning (Q439993) (← links)
- Rapidly computing sparse Legendre expansions via sparse Fourier transforms (Q521921) (← links)
- Learning random monotone DNF (Q628302) (← links)
- Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions (Q657913) (← links)
- The power of amnesia: Learning probabilistic automata with variable memory length (Q676238) (← links)
- What's the frequency, Kenneth?: sublinear Fourier sampling off the grid (Q747618) (← links)
- Spatio-spectral limiting on Boolean cubes (Q829900) (← links)
- Learning unions of \(\omega(1)\)-dimensional rectangles (Q950197) (← links)
- Unconditional lower bounds for learning intersections of halfspaces (Q1009217) (← links)
- Separating models of learning with faulty teachers (Q1017667) (← links)
- Parameterized learnability of juntas (Q1034613) (← links)
- Learning with queries corrupted by classification noise (Q1304475) (← links)
- Simple learning algorithms using divide and conquer (Q1355381) (← links)
- Reflections on ``Representations of sets of Boolean functions by commutative rings'' by Roman Smolensky (Q1377573) (← links)
- An efficient membership-query algorithm for learning DNF with respect to the uniform distribution (Q1384530) (← links)
- Randomization and the computational power of analytic and algebraic decision trees (Q1386179) (← links)
- On learning decision trees with large output domains (Q1386355) (← links)
- The monotone theory for the PAC-model. (Q1426003) (← links)
- More efficient PAC-learning of DNF with membership queries under the uniform distribution (Q1878685) (← links)
- Evaluating spectral norms for constant depth circuits with symmetric gates (Q1904669) (← links)
- Pseudorandom generators and learning algorithms for \(\mathrm{AC}^ 0\) (Q1918950) (← links)
- A recursive procedure for density estimation on the binary hypercube (Q1951138) (← links)
- On the structure of Boolean functions with small spectral norm (Q2012184) (← links)
- Coset decision trees and the Fourier algebra (Q2073019) (← links)
- Quantum algorithms for learning Walsh spectra of multi-output Boolean functions (Q2100831) (← links)
- Quantum learning of concentrated Boolean functions (Q2101535) (← links)
- Towards a proof of the Fourier-entropy conjecture? (Q2216459) (← links)
- On the isomorphism problem for decision trees and decision lists (Q2348033) (← links)
- Improved sparse Fourier approximation results: Faster implementations and stronger guarantees (Q2376358) (← links)
- On PAC learning algorithms for rich Boolean function classes (Q2382283) (← links)
- List-decoding Barnes-Wall lattices (Q2410678) (← links)
- Quantum algorithms for learning and testing juntas (Q2462663) (← links)
- Learning DNF from random walks (Q2568457) (← links)
- Rates of minimization of error functionals over Boolean variable-basis functions (Q2583503) (← links)
- Faster sparse multivariate polynomial interpolation of straight-line programs (Q2635066) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- Covert learning: how to learn with an untrusted intermediary (Q2697884) (← links)
- Optimal bounds on approximation of submodular and XOS functions by juntas (Q2816303) (← links)
- Book Review: A mathematical introduction to compressive sensing (Q3178754) (← links)
- Parameterized Learnability of k-Juntas and Related Problems (Q3520054) (← links)
- Reconstructing Algebraic Functions from Mixed Data (Q4210162) (← links)
- Forest Learning From Data and its Universal Coding (Q4562324) (← links)
- (Q4615809) (← links)
- Testing submodularity and other properties of valuation functions (Q4638085) (← links)
- Preserving Randomness for Adaptive Algorithms (Q5009539) (← links)
- A note on the high-dimensional sparse Fourier transform in the continuous setting* (Q5030166) (← links)
- Local List Recovery of High-Rate Tensor Codes and Applications (Q5117374) (← links)
- (Q5121896) (← links)