When Does Greedy Learning of Relevant Attributes Succeed? A Fourier-Based Characterization


We introduce a new notion called Fourier-accessibility that allows us to precisely characterize the class of Boolean functions for which a standard greedy learning algorithm successfully learns all relevant attributes. If the target function is Fourier-accessible, then the success probability of the greedy algorithm can be made arbitrarily close to one. On the other hand, if the target function is not Fourier-accessible, then the error probability tends to one. Finally, we extend these results to the situation where the input data are corrupted by random attribute and classification noise and prove that greedy learning is quite robust against such errors.

Original languageEnglish
Title of host publicationCOCOON 2007: Computing and Combinatorics
Number of pages11
Volume4598 LNCS
PublisherSpringer Berlin Heidelberg
Publication date01.12.2007
ISBN (Print)978-3-540-73544-1
ISBN (Electronic)978-3-540-73545-8
Publication statusPublished - 01.12.2007
Event13th Annual International Computing and Combinatorics Conference
- Banff, Canada
Duration: 16.07.200719.07.2007
Conference number: 70851


Dive into the research topics of 'When Does Greedy Learning of Relevant Attributes Succeed? A Fourier-Based Characterization'. Together they form a unique fingerprint.

Cite this