mlsanityData to 7 Oct 2026

ID3 Learns Juntas for Smoothed Product Distributions

arXiv 1906.08654 ↗First posted 20 Jun 2019cs.LG stat.MLcited by 13

Not on the map. Why?

Abstract (arXiv)

In recent years, there are many attempts to understand popular heuristics. An example of such a heuristic algorithm is the ID3 algorithm for learning decision trees. This algorithm is commonly used in practice, but there are very few theoretical works studying its behavior. In this paper, we analyze the ID3 algorithm, when the target function is a k-Junta, a function that depends on k out of n variables of the input. We prove that when k = log n, the ID3 algorithm learns in polynomial time k-Juntas, in the smoothed analysis model of Kalai & Teng. That is, we show a learnability result when the observed distribution is a "noisy" variant of the original distribution.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). First posted on arXiv 20 Jun 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 4; 2022: 2; 2023: 2; 2024: 1; 2025: 1; 2026: 3.

13 papers.

Sort: