# ID3 Learns Juntas for Smoothed Product Distributions

## TL;DR

This paper proves that the ID3 algorithm can efficiently learn k-Junta functions under smoothed analysis, demonstrating its effectiveness in noisy environments for functions depending on a logarithmic number of variables.

## Contribution

It provides the first theoretical analysis showing ID3 learns k-Juntas in polynomial time when k = log n under smoothed analysis.

## Key findings

- ID3 learns k-Juntas in polynomial time for k = log n
- The analysis applies to noisy, smoothed distributions
- Supports practical effectiveness of ID3 in noisy settings

## Abstract

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.