The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Learning Decision Trees Using the Fourier Spectrum
Abstract
This work gives a polynomial time algorithm for learning decision trees with respect to the uniform distribution. (This algorithm uses membership queries.) The decision tree model that is considered is an extension of the traditional boolean decision tree model that allows linear operations in each node (i.e., summation of a subset of the input variables over $GF(2)$). This paper shows how to learn in polynomial time any function that can be approximated (in norm $L_2 $) by a polynomially sparse function (i.e., a function with only polynomially many nonzero Fourier coefficients). The authors demonstrate that any function f whose $L_1 $-norm (i.e., the sum of absolute value of the Fourier coefficients) is polynomial can be approximated by a polynomially sparse function, and prove that boolean decision trees with linear operations are a subset of this class of functions. Moreover, it is shown that the functions with polynomial $L_1 $-norm can be learned deterministically. The algorithm can also exactly identify a decision tree of depth d in time polynomial in $2^d $ and n. This result implies that trees of logarithmic depth can be identified in polynomial time.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Valiant, L. G. (1984) · Communications of the ACM · doi:10.1145/1968.1972 · Cited by 3,279
Learning regular sets from queries and counterexamples
Angluin, D. (1987) · Information and Computation · doi:10.1016/0890-5401(87)90052-6 · Cited by 2,114
Group representations in probability and statistics
Diaconis, P. (1988) · doi:10.1214/lnms/1215467407 · Cited by 1,381
Parity, circuits, and the polynomial-time hierarchy
Furst, M., Saxe, J. B., & Sipser, M. (1984) · Mathematical Systems Theory · doi:10.1007/bf01744431 · Cited by 938
∑11-Formulae on finite structures
Ajtai, M. (1983) · Annals of Pure and Applied Logic · doi:10.1016/0168-0072(83)90038-6 · Cited by 585
A guided tour of chernoff bounds
Hagerup, T., & Rüb, C. (1990) · Information Processing Letters · doi:10.1016/0020-0190(90)90214-i · Cited by 524
Harmonic Analysis of Polynomial Threshold Functions
Bruck, J. (1990) · SIAM Journal on Discrete Mathematics · doi:10.1137/0403015 · Cited by 192
Learning decision trees from random examples
Ehrenfeucht, A., & Haussler, D. H. (1989) · Information and Computation · doi:10.1016/0890-5401(89)90001-1 · Cited by 143
Interpolation and Approximation of Sparse Multivariate Polynomials over $GF(2)$
Roth, R. M., & Benedek, G. M. (1991) · SIAM Journal on Computing · doi:10.1137/0220019 · Cited by 56
Cited by
Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals
Tropp, J. A., Laska, J. N., Duarte, M. F., Romberg, J. K., & Baraniuk, R. G. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2034811 · Cited by 1,089
O'Donnell, R. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781139814782 · Cited by 932
Small-Bias Probability Spaces: Efficient Constructions and Applications
Naor, J., & Naor, M. (1993) · SIAM Journal on Computing · doi:10.1137/0222053 · Cited by 560
The power of amnesia: Learning probabilistic automata with variable memory length
Ron, D., Singer, Y., & Tishby, N. (1997) · Machine Learning · doi:10.1007/bf00114008 · Cited by 447
Coppersmith, D., Krawczyk, H., & Mansour, Y. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_3 · Cited by 306
Self-citation
Metadata
- Authors
- Kushilevitz, E., & Mansour, Y.
- Venue
- SIAM Journal on Computing
- Published
- 1993-12
- Volume
- 22
- Issue
- 6
- Pages
- 1331-1348
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2095546965
- Cited by
- 328
- References
- 9
- FWCI
- 12.55
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.