What Jonathan Frankle thinks about neural networks
Chief AI scientist at Databricks, and the author of the lottery ticket hypothesis. His MIT doctorate was on why the sparse networks pruning produces are so hard to train from scratch.
Jonathan Frankle did not write this page.
We collected these quotes from things they published elsewhere, and every quote links to where it was said. They have no account here and have not endorsed this site. Quotes are word for word; the short line under each one is our own restatement, not their wording. Their own site. Is this you? Claim it or ask us to remove it. Or tell us what is wrong here.
Filter neural networks · Newest first
Only Jonathan Frankle on neural networks. See everyone on neural networks
4 dated positions, 2018, in their own words. Our reading of what Jonathan Frankle has said — not written or endorsed by them.
-
Their wordsNeural network pruning techniques can reduce the parameter counts of trained networks by over 90%, decreasing storage requirements and improving computational performance of inference without compromising accuracy.
↗Frankle & Carbin, "The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks" (arXiv)arxiv.org All 10 from this paper
-
Their wordsWe find that a standard pruning technique naturally uncovers subnetworks whose initializations made them capable of training effectively.
↗Frankle & Carbin, "The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks" (arXiv)arxiv.org All 10 from this paper
-
Their wordsThe winning tickets we find have won the initialization lottery: their connections have initial weights that make training particularly effective.
↗Frankle & Carbin, "The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks" (arXiv)arxiv.org All 10 from this paper
-
Their wordsAbove this size, the winning tickets that we find learn faster than the original network and reach higher test accuracy.
↗Frankle & Carbin, "The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks" (arXiv)arxiv.org All 10 from this paper