ConceptTheory & Algos
Fourier sparsity of a decision tree
A decision tree of depth k has at most non-zero Fourier coefficients for each path, leading to an overall sparsity bound of .
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.