{"total":14,"rows":[{"id":"2308.06767","title":"A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendations","created":"2023-08-13","cited_by_count":202,"area":null},{"id":"2403.04861","title":"A Survey of Lottery Ticket Hypothesis","created":"2024-03-07","cited_by_count":24,"area":null},{"id":"2201.08514","title":"How does unlabeled data improve generalization in self-training? A one-hidden-layer theoretical analysis","created":"2022-01-21","cited_by_count":19,"area":null},{"id":"2310.16173","title":"On the Convergence and Sample Complexity Analysis of Deep Q-Networks with $\\epsilon$-Greedy Exploration","created":"2023-10-24","cited_by_count":17,"area":null},{"id":"2205.02343","title":"Convolutional and Residual Networks Provably Contain Lottery Tickets","created":"2022-05-04","cited_by_count":16,"area":null},{"id":"2204.05023","title":"Machine Learning and Deep Learning -- A review for Ecologists","created":"2022-04-11","cited_by_count":11,"area":null},{"id":"2112.04002","title":"SHRIMP: Sparser Random Feature Models via Iterative Magnitude Pruning","created":"2021-12-07","cited_by_count":9,"area":null},{"id":"2207.03615","title":"Learning and generalization of one-hidden-layer neural networks, going beyond standard Gaussian data","created":"2022-07-07","cited_by_count":8,"area":null},{"id":"2206.05604","title":"A Theoretical Understanding of Neural Network Compression from Sparse Linear Approximation","created":"2022-06-11","cited_by_count":5,"area":null},{"id":"2112.08538","title":"Visualizing the Loss Landscape of Winning Lottery Tickets","created":"2021-12-16","cited_by_count":2,"area":null},{"id":"2112.04905","title":"i-SpaSP: Structured Neural Pruning via Sparse Signal Recovery","created":"2021-12-07","cited_by_count":1,"area":null},{"id":"2306.09707","title":"Representation and decomposition of functions in DAG-DNNs and structural network pruning","created":"2023-06-16","cited_by_count":1,"area":null},{"id":"2306.16557","title":"Non-Convex Optimizations for Machine Learning with Theoretical Guarantee: Robust Matrix Completion and Neural Network Learning","created":"2023-06-28","cited_by_count":0,"area":null},{"id":"2512.22106","title":"Pruning as a Game: Equilibrium-Driven Sparsification of Neural Networks","created":"2025-12-26","cited_by_count":0,"area":null}],"next_cursor":null}