Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On the Existence of Universal Lottery Tickets (2111.11146v2)

Published 22 Nov 2021 in cs.LG, cs.AI, and stat.ML

Abstract: The lottery ticket hypothesis conjectures the existence of sparse subnetworks of large randomly initialized deep neural networks that can be successfully trained in isolation. Recent work has experimentally observed that some of these tickets can be practically reused across a variety of tasks, hinting at some form of universality. We formalize this concept and theoretically prove that not only do such universal tickets exist but they also do not require further training. Our proofs introduce a couple of technical innovations related to pruning for strong lottery tickets, including extensions of subset sum results and a strategy to leverage higher amounts of depth. Our explicit sparse constructions of universal function families might be of independent interest, as they highlight representational benefits induced by univariate convolutional architectures.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Rebekka Burkholz (34 papers)
  2. Nilanjana Laha (12 papers)
  3. Rajarshi Mukherjee (39 papers)
  4. Alkis Gotovos (9 papers)
Citations (31)

Summary

We haven't generated a summary for this paper yet.