Compositional sparsity of learnable functions

Neural networks have demonstrated impressive success in various domains, raising the question of what fundamental principles underlie the effectiveness of the best AI systems and quite possibly of human intelligence. This perspective argues that compositional sparsity, or the property that a compositional function have “few” constituent functions, each depending on only a small subset of inputs, is a key principle underlying successful learning architectures. Surprisingly, all functions that are efficiently Turing computable have a compositional sparse representation. Furthermore, deep networks that are also sparse can exploit this general property to avoid the “curse of dimensionality”. This framework suggests interesting implications about the role that machine learning may play in mathematics.

• Machine Learning and Algorithms
• Advanced Optimization Algorithms Research
• Neural Networks and Applications

• DSpace@MIT (Massachusetts Institute of Technology)
  View PDF
• Bulletin of the American Mathematical Society
  View PDF