On the Sparsity of the Strong Lottery Ticket Hypothesis
Authors: Emanuele Natale, Davide Ferre, Giordano Giambartolomei, Frederic Giroire, Frederik Mallmann-Trenn
NeurIPS 2024 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We provide the first proof of the SLTH in classical settings, such as dense and equivariant networks, with guarantees on the sparsity of the subnetworks. Central to our results, is the proof of an essentially tight bound on the Random Fixed-Size Subset Sum Problem (RFSS), a variant of the RSS Problem in which we only ask for subsets of a given size, which is of independent interest. Our proof of the RFSS Problem in Section 3 is based on the second moment method approach first explored by [18]. The paper does not include experiments. |
| Researcher Affiliation | Academia | Emanuele Natale Universit e Cˆote d Azur, CNRS, Inria, I3S, France Davide Ferr e Universit e Cˆote d Azur, CNRS, Inria, I3S, France Giordano Giambartolomei Department of Informatics, King s College London Fr ed eric Giroire Universit e Cˆote d Azur, CNRS, Inria, I3S, France Frederik Mallmann-Trenn Department of Informatics, King s College London |
| Pseudocode | No | The paper contains formal mathematical proofs and theorems but does not include any explicitly labeled 'Pseudocode' or 'Algorithm' blocks. |
| Open Source Code | No | The paper does not include experiments. |
| Open Datasets | No | The paper does not include experiments. |
| Dataset Splits | No | The paper does not include experiments. |
| Hardware Specification | No | The paper does not include experiments. |
| Software Dependencies | No | The paper does not include experiments. |
| Experiment Setup | No | The paper does not include experiments. |