Udo W. Pooch and Al Nieder. A survey of indexing techniques for sparse matrices. ACM Comput. Surv., 5(2):109-133, 1973. doi: 10.1145/356616.356618. URL https://doi.org/10.1145/356616.356618. 2
Adam Polyak and Lior Wolf. Channel-level acceleration of deep face representations. IEEE Access, 3:2163-2175, 2015. doi: 10.1109/ACCESS.2015.2494536. URL https://doi.org/10.1109/ACCESS.2015.2494536. 2
Paul Michel, Omer Levy, and Graham Neubig. Are sixteen heads really better than one? In Hanna M. Wallach, Hugo Larochelle, Alina Beygelzimer, Florence d'Alché-Buc, Emily B. Fox, and Roman Garnett, editors, Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, December 8-14, 2019, Vancouver, BC, Canada, pages 14014-14024, 2019. URL https://proceedings.neurips.cc/paper/2019/bitical/2c601ad9d2ff9bc8b282670cdb54f69f-Abstract.html. 2
Jose M. Alvarez and Mathieu Salzmann. Learning the number of neurons in deep networks. In Daniel D. Lee, Masashi Sugiyama, Ulrike von Luxburg, Isabelle Guyon, and Roman Garnett, editors, Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, December 5-10, 2016, Barcelona, Spain, pages 2262-2270, 2016. URL https://proceedings.neurips.cc/paper/2016/bitnet/6e7d2da6d3953058db75714ac400b584-AAbstract.html. 2
Zhuang Liu, Mingjie Sun, Tinghui Zhou, Gao Huang, and Trevor Darrell. Rethinking the value of network pruning. In 7th International Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA, May 6-9, 2019. OpenReview.net, 2019. URL https://openreview.net/forum?id=rJlnB3C5Ym.2
Sajid Anwar, Kyuyeon Hwang, and Wonyong Sung. Structured pruning of deep convolutional neural networks. ACM J. Emerg. Technol. Comput. Syst., 13(3):32:1-32:18, 2017. doi: 10.1145/3005348. URL https://doi.org/10.1145/3005348.2
Arlene Elizabeth Siswanto. Block sparsity and weight initialization in neural network pruning. PhD thesis, Massachusetts Institute of Technology, 2021. 2
Eran Malach, Gilad Yehudai, Shai Shalev-Schwartz, and Ohad Shamir. Proving the lottery ticket hypothesis: Pruning is all you need. In International Conference on Machine Learning, pages 6682-6691. PMLR, 2020. 2, 4
Ali Rahimi and Benjamin Recht. Random features for large-scale kernel machines. In John C. Platt, Daphne Koller, Yoram Singer, and Sam T. Roweis, editors, Advances in Neural Information Processing Systems 20, Proceedings of the Twenty-First Annual Conference on Neural Information Processing Systems, Vancouver, British Columbia, Canada, December 3-6, 2007, pages 1177-1184. Curran Associates, Inc., 2007. URL https://proceedings.neurips.cc/paper/2007/bit/013a006f03dbc5392effeb8f18fda755-AAbstract.html. 2
Ali Rahimi and Benjamin Recht. Uniform approximation of functions with random bases. In 2008 46th annual allerton conference on communication, control, and computing, pages 555-561. IEEE, 2008. 2
Gilad Yehudai and Ohad Shamir. On the power and limitations of random features for understanding neural networks. In Hanna M. Wallach, Hugo Larochelle, Alina Beygelzimer, Florence d'Alché-Buc, Emily B. Fox, and Roman Garnett, editors, Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, December 8-14, 2019, Vancouver, BC, Canada, pages 6594-6604, 2019. URL https://proceedings.neurips.cc/paper/2019/bit/5481b2f34a74e427a2818014b8e103b0-AAbstract.htm1.3
George S. Lueker. Exponentially small bounds on the expected optimum of the partition and subset sum problems. Random Structures and Algorithms, 12:51-62, 1998. 3, 4
Arthur Carvalho Walraven Da Cunha, Francesco d'Amore, Frédéric Giroire, Hicham Lesfari, Emanuele Natale, and Laurent Viennot. Revisiting the Random Subset Sum Problem. In Inge Li