4 problems

Strong lottery ticket conjecture at virtually all sparsity levels
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$ …
openFrom paperslottery-tickets neural-networks sparsity
0 responses
6
Baranyai's partition characterisation of (3,6)-tight graphs
The partition characterisation conjecture. The graph $G$ is $(3,6)$ -tight if and only if, for every edge $e\in E$ , there exists a partition $(S_1,S_2,S_3)$ of $E$ such that
openFrom paperscombinatorics graph-rigidity sparsity
0 responses
3
The stronger edge bound conjecture for stress-independent graphs
Stronger edge bound conjecture. The number of edges satisfies
openFrom papersgraph-rigidity sparsity
0 responses
4
The block-and-hole minimal-rigidity conjecture in $\ell_p^3$
Block-and-hole minimal-rigidity conjecture. The following statements are equivalent:
openFrom papersnormed-spaces rigidity-theory sparsity
0 responses
5

Strong lottery ticket conjecture at virtually all sparsity levels