{"list":"other","total":53,"rows":[{"id":"1412.6980","title":"Adam: A Method for Stochastic Optimization","created":"2014-12-22","cited_by_count":37240},{"id":"1503.02531","title":"Distilling the Knowledge in a Neural Network","created":"2015-03-09","cited_by_count":10324},{"id":"1609.07843","title":"Pointer Sentinel Mixture Models","created":"2016-09-26","cited_by_count":3096},{"id":"1510.00149","title":"Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Coding","created":"2015-10-01","cited_by_count":2329},{"id":"1803.03635","title":"The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks","created":"2018-03-09","cited_by_count":2262},{"id":"1506.02626","title":"Learning both Weights and Connections for Efficient Neural Networks","created":"2015-06-08","cited_by_count":2031},{"id":"1810.02340","title":"SNIP: Single-shot Network Pruning based on Connection Sensitivity","created":"2018-10-04","cited_by_count":812},{"id":"1312.6120","title":"Exact solutions to the nonlinear dynamics of learning in deep linear neural networks","created":"2013-12-20","cited_by_count":763},{"id":"1710.01878","title":"To prune, or not to prune: exploring the efficacy of pruning for model compression","created":"2017-10-05","cited_by_count":603},{"id":"1802.10026","title":"Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNs","created":"2018-02-27","cited_by_count":588},{"id":"1712.01312","title":"Learning Sparse Neural Networks through $L_0$ Regularization","created":"2017-12-04","cited_by_count":583},{"id":"1911.11134","title":"Rigging the Lottery: Making All Tickets Winners","created":"2019-11-25","cited_by_count":495},{"id":"1506.02557","title":"Variational Dropout and the Local Reparameterization Trick","created":"2015-06-08","cited_by_count":490},{"id":"2006.05467","title":"Pruning neural networks without any data by iteratively conserving synaptic flow","created":"2020-06-09","cited_by_count":479},{"id":"1902.09574","title":"The State of Sparsity in Deep Neural Networks","created":"2019-02-25","cited_by_count":476},{"id":"2002.07376","title":"Picking Winning Tickets Before Training by Preserving Gradient Flow","created":"2020-02-18","cited_by_count":471},{"id":"1803.00885","title":"Essentially No Barriers in Neural Network Energy Landscape","created":"2018-03-02","cited_by_count":330},{"id":"1707.04780","title":"Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Science","created":"2017-07-15","cited_by_count":328},{"id":"1405.3866","title":"Speeding up Convolutional Neural Networks with Low Rank Expansions","created":"2014-05-15","cited_by_count":284},{"id":"1701.05369","title":"Variational Dropout Sparsifies Deep Neural Networks","created":"2017-01-19","cited_by_count":265},{"id":"1511.07543","title":"Convergent Learning: Do different neural networks learn the same representations?","created":"2015-11-24","cited_by_count":220},{"id":"1802.08435","title":"Efficient Neural Audio Synthesis","created":"2018-02-23","cited_by_count":219},{"id":"1907.04840","title":"Sparse Networks from Scratch: Faster Training without Losing Performance","created":"2019-07-10","cited_by_count":213},{"id":"1905.01067","title":"Deconstructing Lottery Tickets: Zeros, Signs, and the Supermask","created":"2019-05-03","cited_by_count":207},{"id":"1708.02182","title":"Regularizing and Optimizing LSTM Language Models","created":"2017-08-07","cited_by_count":205},{"id":"1409.2329","title":"Recurrent Neural Network Regularization","created":"2014-09-08","cited_by_count":189},{"id":"1902.05967","title":"Parameter Efficient Training of Deep Convolutional Neural Networks by Dynamic Sparse Reparameterization","created":"2019-02-15","cited_by_count":189},{"id":"1412.6544","title":"Qualitatively characterizing neural network optimization problems","created":"2014-12-19","cited_by_count":188},{"id":"1507.06228","title":"Training Very Deep Networks","created":"2015-07-22","cited_by_count":173},{"id":"1512.05287","title":"A Theoretically Grounded Application of Dropout in Recurrent Neural Networks","created":"2015-12-16","cited_by_count":161},{"id":"1711.03953","title":"Breaking the Softmax Bottleneck: A High-Rank RNN Language Model","created":"2017-11-10","cited_by_count":152},{"id":"2002.03231","title":"Soft Threshold Weight Reparameterization for Learnable Sparsity","created":"2020-02-08","cited_by_count":151},{"id":"1711.05136","title":"Deep Rewiring: Training very sparse deep networks","created":"2017-11-14","cited_by_count":139},{"id":"1705.08665","title":"Bayesian Compression for Deep Learning","created":"2017-05-24","cited_by_count":116},{"id":"1707.05589","title":"On the State of the Art of Evaluation in Neural Language Models","created":"2017-07-18","cited_by_count":104},{"id":"1810.09536","title":"Ordered Neurons: Integrating Tree Structures into Recurrent Neural Networks","created":"2018-10-22","cited_by_count":101},{"id":"1906.06307","title":"A Signal Propagation Perspective for Pruning Neural Networks at Initialization","created":"2019-06-14","cited_by_count":96},{"id":"1611.01462","title":"Tying Word Vectors and Word Classifiers: A Loss Framework for Language Modeling","created":"2016-11-04","cited_by_count":92},{"id":"1612.04426","title":"Improving Neural Language Models with a Continuous Cache","created":"2016-12-13","cited_by_count":82},{"id":"1906.04724","title":"Large Scale Structure of Neural Network Loss Landscapes","created":"2019-06-11","cited_by_count":68},{"id":"2005.06870","title":"Dynamic Sparse Training: Find Efficient Sparse Network From Scratch With Trainable Masked Layers","created":"2020-05-14","cited_by_count":68},{"id":"2006.09081","title":"Progressive Skeletonization: Trimming more fat from a network at initialization","created":"2020-06-16","cited_by_count":64},{"id":"1709.07432","title":"Dynamic Evaluation of Neural Sequence Models","created":"2017-09-21","cited_by_count":55},{"id":"1901.09181","title":"Sparse evolutionary Deep Learning with over one million artificial neurons on commodity hardware","created":"2019-01-26","cited_by_count":48},{"id":"1608.07905","title":"Machine Comprehension Using Match-LSTM and Answer Pointer","created":"2016-08-29","cited_by_count":47},{"id":"2001.01969","title":"Sparse Weight Activation Training","created":"2020-01-07","cited_by_count":45},{"id":"1607.03474","title":"Recurrent Highway Networks","created":"2016-07-12","cited_by_count":37},{"id":"1604.05978","title":"A topological insight into restricted Boltzmann machines","created":"2016-04-20","cited_by_count":32},{"id":"1711.08757","title":"Deep Expander Networks: Efficient Deep Networks from Graph Theory","created":"2017-11-23","cited_by_count":23},{"id":"2006.14085","title":"Topological Insights into Sparse Neural Networks","created":"2020-06-24","cited_by_count":22},{"id":"1709.05027","title":"Learning Intrinsic Sparse Structures within Long Short-Term Memory","created":"2017-09-15","cited_by_count":18},{"id":"1905.00416","title":"RadiX-Net: Structured Sparse Matrices for Deep Neural Networks","created":"2019-04-30","cited_by_count":12},{"id":"1901.09208","title":"Intrinsically Sparse Long Short-Term Memory Networks","created":"2019-01-26","cited_by_count":3}],"next_cursor":null}