Deep Networks Learn Deep Hierarchical Models
Amit Daniely

TL;DR
This paper demonstrates that layerwise SGD on residual networks can efficiently learn complex hierarchical models, surpassing previous models in depth and providing insights into deep learning's ability to learn structured, layered representations.
Contribution
It introduces a class of hierarchical models that are learnable by deep networks at the depth limit of efficient algorithms, extending prior work on deep learning capabilities.
Findings
Layerwise SGD effectively learns hierarchical models.
Models in this class require polynomial depth, exceeding previous log-depth models.
Hierarchical structures may underpin deep learning success.
Abstract
We consider supervised learning with labels and show that layerwise SGD on residual networks can efficiently learn a class of hierarchical models. This model class assumes the existence of an (unknown) label hierarchy , where labels in are simple functions of the input, while for , labels in are simple functions of simpler labels. Our class surpasses models that were previously shown to be learnable by deep learning algorithms, in the sense that it reaches the depth limit of efficient learnability. That is, there are models in this class that require polynomial depth to express, whereas previous models can be computed by log-depth circuits. Furthermore, we suggest that learnability of such hierarchical models might eventually form a basis for understanding deep learning. Beyond their natural fit for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Algorithms · Machine Learning and Data Classification · Domain Adaptation and Few-Shot Learning
