Learning Sparse Boolean Functions: Neural Networks Need a Hierarchical Degree Chain
Offered By: NCCR SwissMAP via YouTube
Course Description
Overview
Explore a thought-provoking lecture on the intricacies of learning sparse Boolean functions, focusing on the necessity of hierarchical degree chains in neural networks. Delve into the research presented by E. Abbé from EPFL as part of the Workshop on Spin Glasses. Gain insights into the complex relationship between sparse Boolean functions and neural network architectures, and understand the implications for machine learning and artificial intelligence. Discover how hierarchical structures in neural networks contribute to their ability to learn and represent sparse Boolean functions effectively.
Syllabus
Learning sparse Boolean functions: neural networks need a hierachical degree chain, E. Abbé (EPFL)
Taught by
NCCR SwissMAP
Related Courses
Algebra & AlgorithmsMoscow Institute of Physics and Technology via Coursera Lower Bounds in Complexity Theory, Communication Complexity, and Sunflowers - Toniann Pitassi
Institute for Advanced Study via YouTube Proof and Circuit Complexity - Robert Robere
Institute for Advanced Study via YouTube Undergrad Complexity at CMU - SAT
Ryan O'Donnell via YouTube Improved Non-Interactive Zero Knowledge with Applications to Post-Quantum Signatures
Association for Computing Machinery (ACM) via YouTube