Learning Decision Trees Using the Fourier Spectrum
From MaRDI portal
Recommendations
- Coset decision trees and the Fourier algebra
- scientific article; zbMATH DE number 1759073
- Spectral methods for learning discrete latent tree models
- End-to-end learning of decision trees and forests
- Learning decision trees with stochastic linear classifiers
- scientific article; zbMATH DE number 1179978
- Learning decision trees from random examples
- A tree-based dictionary learning framework
- On spectral learning
Cited in
(76)- Unconditional lower bounds for learning intersections of halfspaces
- Separating models of learning with faulty teachers
- Parameterized learnability of juntas
- Learning with queries corrupted by classification noise
- Simple learning algorithms using divide and conquer
- Reflections on ``Representations of sets of Boolean functions by commutative rings by Roman Smolensky
- An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
- Randomization and the computational power of analytic and algebraic decision trees
- The monotone theory for the PAC-model.
- More efficient PAC-learning of DNF with membership queries under the uniform distribution
- Evaluating spectral norms for constant depth circuits with symmetric gates
- Pseudorandom generators and learning algorithms for \(\mathrm{AC}^ 0\)
- A recursive procedure for density estimation on the binary hypercube
- Coset decision trees and the Fourier algebra
- Quantum algorithms for learning Walsh spectra of multi-output Boolean functions
- Quantum learning of concentrated Boolean functions
- Towards a proof of the Fourier-entropy conjecture?
- On the isomorphism problem for decision trees and decision lists
- Improved sparse Fourier approximation results: Faster implementations and stronger guarantees
- On PAC learning algorithms for rich Boolean function classes
- List-decoding Barnes-Wall lattices
- Quantum algorithms for learning and testing juntas
- Population recovery and partial identification
- Learning DNF from random walks
- Rates of minimization of error functionals over Boolean variable-basis functions
- A multiscale sub-linear time Fourier algorithm for noisy data
- Faster sparse multivariate polynomial interpolation of straight-line programs
- Exact learning from an honest teacher that answers membership queries
- Covert learning: how to learn with an untrusted intermediary
- Optimal bounds on approximation of submodular and XOS functions by juntas
- Book Review: A mathematical introduction to compressive sensing
- Parameterized Learnability of k-Juntas and Related Problems
- When Does Greedy Learning of Relevant Attributes Succeed?
- Reconstructing Algebraic Functions from Mixed Data
- Reliable agnostic learning
- Forest Learning From Data and its Universal Coding
- Finding significant Fourier coefficients: clarifications, simplifications, applications and limitations
- Testing submodularity and other properties of valuation functions
- Simple Learning Algorithms for Decision Trees and Multivariate Polynomials
- Preserving randomness for adaptive algorithms
- A note on the high-dimensional sparse Fourier transform in the continuous setting
- Local list recovery of high-rate tensor codes and applications
- scientific article; zbMATH DE number 7250148 (Why is no real title available?)
- Randomized interpolation and approximation of sparse polynomials stPreliminary version
- Rapidly computing sparse Legendre expansions via sparse Fourier transforms
- Boolean functions with small spectral norm, revisited
- Learning random log-depth decision trees under the uniform distribution.
- Learning Random Log-Depth Decision Trees under Uniform Distribution
- Algorithmic Learning Theory
- Private data release via learning thresholds
- scientific article; zbMATH DE number 7053345 (Why is no real title available?)
- On the modulo degree complexity of Boolean functions
- Decision tree approximations of Boolean functions
- Erasures versus errors in local decoding and property testing
- Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes
- Paradigms for Unconditional Pseudorandom Generators
- Exact learning of subclasses of CDNF formulas with membership queries
- Learning random monotone DNF
- A high dimensional Goldreich-Levin theorem
- Lifting uniform learners via distributional decomposition
- Properly learning decision trees in almost polynomial time
- Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions
- The power of amnesia: Learning probabilistic automata with variable memory length
- On the degree of Boolean functions as polynomials over \(\mathbb{Z}_m\)
- Deterministic sparse Fourier transform with an _ guarantee
- Classical verification of quantum learning
- On the structure of learnability beyond \textsf{P/poly}
- Distribution free learning with local queries
- Adaptive exact learning of decision trees from membership queries
- Interactive proofs for verifying machine learning
- Learning stochastic decision trees
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- What's the frequency, Kenneth?: sublinear Fourier sampling off the grid
- Spatio-spectral limiting on Boolean cubes
- Learning unions of (1)-dimensional rectangles
This page was built for publication: Learning Decision Trees Using the Fourier Spectrum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4277547)
