Sample-complexity of Estimating Convolutional and Recurrent Neural Networks

Published on ● Video Link: https://www.youtube.com/watch?v=pcuW7llesxs



Duration: 34:57
2,079 views
22


Aarti Singh (Carnegie Mellon University)
https://simons.berkeley.edu/talks/tbd-54
Frontiers of Deep Learning




Other Videos By Simons Institute for the Theory of Computing


2019-08-06Off-policy Policy Optimization
2019-08-06Optimality and Approximation with Policy Gradient Methods in Markov Decision Processes
2019-08-06On the Hardness of Reinforcement Learning With Value-function Approximation
2019-08-06Reinforcement Learning in Feature Space: Complexity and Regret
2019-08-05Flexible Neural Networks and the Frontiers of Meta-Learning
2019-08-05Aligning ML objectives with human values
2019-08-05Is Deeper Better Only When Shallow Is Good?
2019-08-05Efficient Deep Learning with Humans in the Loop
2019-08-05Machine Learning-based Design of Proteins and Small Molecules
2019-08-05Knowledge is embedded in language neural networks but can they reason?
2019-07-18Sample-complexity of Estimating Convolutional and Recurrent Neural Networks
2019-07-18Studying Generalization in Deep Learning via PAC-Bayes
2019-07-18Towards Understanding Transfer Learning with Applications to Medical Imaging
2019-07-18Kernel and Deep Regimes in Overparameterized Learning
2019-07-18Meta-learning of Optimizers and Update Rules
2019-07-18Robust Deep Learning Under Distribution Shift
2019-07-18Using Deep Learning for Perception in Autonomous Systems: A Perspective from Control Theory
2019-07-17Interpretability - now what?
2019-07-17Lessons Learned from Evaluating the Robustness of Defenses to Adversarial Examples
2019-07-17Interpreting Deep Neural Networks (DNNs)
2019-07-171Provably Robust Deep Learning via Adversarially Trained Smoothed Classifiers



Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Frontiers of Deep Learning
Aarti Singh