Sign-In to the Lottery: Reparameterizing Sparse Training From Scratch

Advait Gadhikar, Tom Jacobs, Chao Zhou, Rebekka Burkholz
4/17/2025
cs.LGcs.CV

No confident code implementation found for this paper.

Abstract

The performance gap between training sparse neural networks from scratch (PaI) and dense-to-sparse training presents a major roadblock for efficient deep learning. According to the Lottery Ticket Hypothesis, PaI hinges on finding a problem specific parameter initialization. As we show, to this end, determining correct parameter signs is sufficient. Yet, they remain elusive to PaI. To address this issue, we propose Sign-In, which employs a dynamic reparameterization that provably induces sign flips. Such sign flips are complementary to the ones that dense-to-sparse training can accomplish, rendering Sign-In as an orthogonal method. While our experiments and theory suggest performance improvements of PaI, they also carve out the main open challenge to close the gap between PaI and dense-to-sparse training.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{gadhikar2025signin,
  title  = {Sign-In to the Lottery: Reparameterizing Sparse Training From Scratch},
  author = {Advait Gadhikar and Tom Jacobs and Chao Zhou and Rebekka Burkholz},
  year   = {2025},
  eprint = {2504.12801},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2504.12801v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2504.12801.svg)](https://codeofpaper.com/paper/2504.12801)

Discussion