The Complexity of Learning Neural Networks episode artwork

EPISODE · Oct 20, 2017 · 38 MIN

The Complexity of Learning Neural Networks

from Data Skeptic

Over the past several years, we have seen many success stories in machine learning brought about by deep learning techniques. While the practical success of deep learning has been phenomenal, the formal guarantees have been lacking. Our current theoretical understanding of the many techniques that are central to the current ongoing big-data revolution is far from being sufficient for rigorous analysis, at best. In this episode of Data Skeptic, our host Kyle Polich welcomes guest John Wilmes, a mathematics post-doctoral researcher at Georgia Tech, to discuss the efficiency of neural network learning through complexity theory.

Episode metadata supplied by the publisher feed · Published Oct 20, 2017

Embed this episode

NOW PLAYING

The Complexity of Learning Neural Networks

0:00 38:51

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

No similar episodes found.

No similar podcasts found.

Frequently Asked Questions

How long is this episode of Data Skeptic?

This episode is 38 minutes long.

When was this Data Skeptic episode published?

This episode was published on October 20, 2017.

Can I download this Data Skeptic episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.
URL copied to clipboard!