4 problems

Basis-decomposition conjecture. The double-scoring procedure applies broadly to models admitting basis decompositions, with masking interpretable as projection onto learned subspac…

Strong lottery ticket conjecture at virtually all sparsity levels. There exists $N$ such that, with probability at least $\delta$, the network contains a mask $H$ with sparsity $s$…

Let a randomly-initialised neural network be trained to obtain a fully-trained original network. A sparse subnetwork is a subnetwork obtained by retaining only a subset of the netw…

A randomly initialised neural network is said to contain a subnetwork if some subset of its parameters and corresponding connections is retained. Strong Lottery Ticket Hypothesis.…