Linear decision lists and partitioning algorithms for the construction of neural networks
Title | Linear decision lists and partitioning algorithms for the construction of neural networks |
Publication Type | Conference Paper |
Year of Publication | 1997 |
Authors | Turán G, Vatan F |
Editor | Cucker F, Shub M |
Conference Name | Foundations of Computational Mathematics |
Pagination | 414–423 |
Publisher | Springer Berlin Heidelberg |
Place Published | Berlin, Heidelberg |
ISBN Number | 978-3-642-60539-0 |
Abstract | We consider the computational power of neural networks constructed by partitioning algorithms. These neural networks can also be viewed as decision lists with tests evaluating linear functions. An exponential lower bound is proved for the complexity of an explicit Boolean function in this model. The lower bound is extended to decision trees of bounded rank. We also discuss the relationship between these models and the hierarchy of threshold circuit complexity classes. |