[36] Shiwei Liu, Tim Van der Lee, Anil Yaman, Zahra Atashgahi, Davide Ferraro, Ghada Sokar, Mykola Pechenizkiy, and Decebal Constantin Mocanu. Topological Insights into Sparse Neural Networks. In Joint European conference on machine learning and knowledge discovery in databases, pages 279-294. Springer, 2020. URL: https://arxiv.org/abs/2006.14085.
[37] Shiwei Liu, Decebal Constantin Mocanu, Amarsagar Reddy Ramesh Ramapuram Matavalam, Yulong Pei, and Mykola Pechenizkiy. Sparse evolutionary deep learning with over one million artificial neurons on commodity hardware. Neural Computing and Applications, 33(7):2589-2604, 2021. URL: https://arxiv.org/abs/1901.09181.
[38] Shiwei Liu, Lu Yin, Decebal Constantin Mocanu, and Mykola Pechenizkiy. Do We Actually Need Dense Over-Parameterization? In-Time Over-Parameterization in Sparse Training. In International Conference on Machine Learning, pages 6989–7000. PMLR, 2021. URL: https://arxiv.org/abs/2102.02887.
[39] Yinhan Liu, Myle Ott, Naman Goyal, Jingfei Du, Mandar Joshi, Danqi Chen, Omer Levy, Mike Lewis, Luke Zettlemoyer, and Veselin Stoyanov. Roberta: A robustly optimized bert pretraining approach. arXiv preprint arXiv:1907.11692, 2019.
[40] Decebal Constantin Mocanu, Elena Mocanu, Phuong H Nguyen, Madeleine Gibescu, and Antonio Liotta. A topological insight into restricted boltzmann machines. Machine Learning, 104(2):243-270, 2016. URL: https://link.springer.com/article/10.1007/s10994-016-5570-z.
[41] Decebal Constantin Mocanu, Elena Mocanu, Tiago Pinto, Selima Curci, Phuong H Nguyen, Madeleine Gibescu, Damien Ernst, and Zita A Vale. Sparse Training Theory for Scalable and Efficient Agents. International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2021. URL: https://arxiv.org/abs/2103.01636.
[42] Decebal Constantin Mocanu, Elena Mocanu, Peter Stone, Phuong H Nguyen, Madeleine Gibescu, and Antonio Liotta. Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Science. Nature communications, 9(1):1-12, 2018. URL: https://arxiv.org/abs/1707.04780.
[43] Pavlo Molchanov, Arun Mallya, Stephen Tyree, Iuri Frosio, and Jan Kautz. Importance Estimation for Neural Network Pruning. In The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), June 2019. URL: https://arxiv.org/abs/1906.10771.
[44] Michael C. Mozer and Paul Smolensky. Using relevance to reduce network size automatically. Connection Science, 1(1):3-16, 1989. URL: https://doi.org/10.1080/09540098908915626.
[45] Seyed Naji, Azra Abtahi, and Farokh Marvasti. Efficient Sparse Artificial Neural Networks. arXiv preprint arXiv:2103.07674, 03 2021. URL: https://arxiv.org/abs/2103.07674.
[46] Sharan Narang, Erich Elsen, Gregory Diamos, and Shubho Sengupta. Exploring Sparsity in Recurrent Neural Networks. International Conference on Learning Representations, 2017. URL: https://arxiv.org/abs/1704.05119.
[47] Ozan Özdenizci and Robert Legenstein. Training Adversarially Robust Sparse Networks via Bayesian Connectivity Sampling. In International Conference on Machine Learning, pages 8314-8324. PMLR, 2021. URL: https://proceedings.mlr.press/v139/ozdenizci21a.html.
[48] Vivek Ramanujan, Mitchell Wortsman, Aniruddha Kembhavi, Ali Farhadi, and Mohammad Rastegari. What's Hidden in a Randomly Weighted Neural Network? In Conference on Computer Vision and Pattern Recognition, pages 11893-11902, 2020. URL: https://arxiv.org/abs/1911.13299.
[49] Olga Russakovsky, Jia Deng, Hao Su, Jonathan Krause, Sanjeev Satheesh, Sean Ma, Zhiheng Huang, Andrej Karpathy, Aditya Khosla, Michael Bernstein, Alexander C. Berg, and Li Fei-Fei. ImageNet Large Scale Visual Recognition Challenge. International Journal of Computer Vision (IJCV), 115(3):211–252, 2015. URL: https://arxiv.org/abs/1409.0575.