2026
CLM-AI-003607= mistakes = O(k log n)ASYMPTOTIC BOUNDThe cited theorem establishes mistakes = O(k log n) under the recorded model.Source: Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm — Winnow sparse-disjunction mistake bound ↗
PROVEN