Skip to contentSkip to filters

We use cookies for analytics.

Sample-complexity of Estimating Convolutional and Recurrent Neural Networks

Aarti Singh

Carnegie Mellon University

Recording

35 min

Abstract

Aarti Singh studies how many examples are needed to estimate linear recurrent and convolutional networks. The analysis compares structured architectures with fully connected networks, finds sample complexity proportional to their intrinsic dimension, and gives lower bounds that are tight up to logarithmic factors.

Topics