Why and When Can Deep -- but Not Shallow -- Networks Avoid the Curse of Dimensionality: a Review
November 02, 2016 Β· The Cartographer Β· π International Journal of Automation and Computing
"No code URL or promise found in abstract"
"Title-pattern auto-detect: Why and When Can Deep -- but Not Shallow -- Networks Avoid the Curse of Dimensionality: a Review"
Evidence collected by the PWNC Scanner
Authors
Tomaso Poggio, Hrushikesh Mhaskar, Lorenzo Rosasco, Brando Miranda, Qianli Liao
arXiv ID
1611.00740
Category
cs.LG: Machine Learning
Citations
623
Venue
International Journal of Automation and Computing
Last Checked
1 day ago
Abstract
The paper characterizes classes of functions for which deep learning can be exponentially better than shallow learning. Deep convolutional networks are a special case of these conditions, though weight sharing is not the main reason for their exponential advantage.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Machine Learning
ποΈ
ποΈ
Transcended
ποΈ
ποΈ
Transcended
Continuous control with deep reinforcement learning
π
π
Old Age
Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks
π
π
Old Age
Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor
π
π
Old Age
SGDR: Stochastic Gradient Descent with Warm Restarts
ποΈ
ποΈ
Transcended