{"total":17,"rows":[{"id":"2202.12002","title":"Rare Gems: Finding Lottery Tickets at Initialization","created":"2022-02-24","cited_by_count":34,"area":null},{"id":"2203.07808","title":"Interspace Pruning: Using Adaptive Filter Representations to Improve Training of Sparse CNNs","created":"2022-03-15","cited_by_count":16,"area":null},{"id":"2408.09966","title":"Mask in the Mirror: Implicit Sparsification","created":"2024-08-19","cited_by_count":14,"area":null},{"id":"2205.08099","title":"Dimensionality Reduced Training by Pruning and Freezing Parts of a Deep Neural Network, a Survey","created":"2022-05-17","cited_by_count":12,"area":null},{"id":"2406.01820","title":"Finding Lottery Tickets in Vision Models via Data-driven Spectral Foresight Pruning","created":"2024-06-03","cited_by_count":10,"area":null},{"id":"2302.14670","title":"Balanced Training for Sparse GANs","created":"2023-02-28","cited_by_count":8,"area":null},{"id":"2504.12801","title":"Sign-In to the Lottery: Reparameterizing Sparse Training From Scratch","created":"2025-04-17","cited_by_count":6,"area":null},{"id":"2602.19799","title":"Path-conditioned training: a principled way to rescale ReLU neural networks","created":"2026-02-23","cited_by_count":6,"area":null},{"id":"2210.16589","title":"Strong Lottery Ticket Hypothesis with $\\varepsilon$--perturbation","created":"2022-10-29","cited_by_count":3,"area":null},{"id":"2305.16886","title":"Understanding Sparse Neural Networks from their Topology via Multipartite Graph Representations","created":"2023-05-26","cited_by_count":2,"area":null},{"id":"2305.17559","title":"Pruning at Initialization -- A Sketching Perspective","created":"2023-05-27","cited_by_count":2,"area":null},{"id":"2510.17515","title":"The Graphon Limit Hypothesis: Understanding Neural Network Pruning via Infinite Width Analysis","created":"2025-10-20","cited_by_count":2,"area":null},{"id":"2406.02773","title":"Cyclic Sparse Training: Is it Enough?","created":"2024-06-04","cited_by_count":1,"area":null},{"id":"2305.18402","title":"Neural Sculpting: Uncovering hierarchically modular task structure in neural networks through pruning and network analysis","created":"2023-05-28","cited_by_count":0,"area":null},{"id":"2406.19050","title":"FedMap: Iterative Magnitude-Based Pruning for Communication-Efficient Federated Learning","created":"2024-06-27","cited_by_count":0,"area":null},{"id":"2509.24066","title":"A Second-Order Perspective on Pruning at Initialization and Knowledge Transfer","created":"2025-09-28","cited_by_count":0,"area":null},{"id":"2509.25665","title":"Gradual Capacity Growth for Sparse Network Discovery","created":"2025-09-30","cited_by_count":0,"area":null}],"next_cursor":null}