Brain Inspired cover image

BI 229 Tomaso Poggio: Principles of Intelligence and Learning

Brain Inspired

00:00

Theorem: efficient computability implies compositional sparsity

Tomaso states his result that functions computable in non-exponential time admit sparse compositional decompositions.

Play episode from 53:19
Transcript

The AI-powered Podcast Player

Save insights by tapping your headphones, chat with episodes, discover the best highlights - and more!
App store bannerPlay store banner
Get the app