5min chapter

Machine Learning Street Talk (MLST) cover image

The Lottery Ticket Hypothesis with Jonathan Frankle

Machine Learning Street Talk (MLST)

CHAPTER

How to Find a Lottery Ticket From Unsupervised Learning

So the answer is complicated, but i don't think it is black and white. As you know, sparse equals slow, dense equals fast. And there's probably also a compiler's story here of, can we find ways to make sparsity, or the sparsity we find, run faster? Or do you feel like it really has to be on the data an order for its to be useful? So to answer that question, i would actually defer you to two different papers that have been written by fantastic colleagues at facebook. A one paper that was in europe this past year looks at whether these lottery tickets transfer between tasks, at least on image tasks. If you find one of these

00:00

Get the Snipd
podcast app

Unlock the knowledge in podcasts with the podcast player of the future.
App store bannerPlay store banner

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode

Save any
moment

Hear something you like? Tap your headphones to save it with AI-generated key takeaways

Share
& Export

Send highlights to Twitter, WhatsApp or export them to Notion, Readwise & more

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode