{"total":29,"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":"2106.04533","title":"Chasing Sparsity in Vision Transformers: An End-to-End Exploration","created":"2021-06-08","cited_by_count":183,"area":null},{"id":"2210.04092","title":"Advancing Model Pruning via Bi-level Optimization","created":"2022-10-08","cited_by_count":56,"area":null},{"id":"2107.00166","title":"Sanity Checks for Lottery Tickets: Does Your Winning Ticket Really Win the Jackpot?","created":"2021-07-01","cited_by_count":52,"area":null},{"id":"2106.03225","title":"Efficient Lottery Ticket Finding: Less Data is More","created":"2021-06-06","cited_by_count":44,"area":null},{"id":"2202.09844","title":"Sparsity Winning Twice: Better Robust Generalization from More Efficient Training","created":"2022-02-20","cited_by_count":41,"area":null},{"id":"2202.04736","title":"Coarsening the Granularity: Towards Structurally Sparse Lottery Tickets","created":"2022-02-09","cited_by_count":27,"area":null},{"id":"2403.04861","title":"A Survey of Lottery Ticket Hypothesis","created":"2024-03-07","cited_by_count":24,"area":null},{"id":"2305.02190","title":"Rethinking Graph Lottery Tickets: Graph Sparsity Matters","created":"2023-05-03","cited_by_count":23,"area":null},{"id":"2111.00162","title":"You are caught stealing my winning lottery ticket! Making a lottery ticket claim its ownership","created":"2021-10-30","cited_by_count":18,"area":null},{"id":"2207.08629","title":"Comprehensive Graph Gradual Pruning for Sparse Training in Graph Neural Networks","created":"2022-07-18","cited_by_count":18,"area":null},{"id":"2205.11819","title":"Quarantine: Sparsity Can Uncover the Trojan Attack Trigger for Free","created":"2022-05-24","cited_by_count":15,"area":null},{"id":"2208.10842","title":"Lottery Pools: Winning More by Interpolating Tickets without Increasing Training or Inference Cost","created":"2022-08-23","cited_by_count":11,"area":null},{"id":"2302.14670","title":"Balanced Training for Sparse GANs","created":"2023-02-28","cited_by_count":8,"area":null},{"id":"2203.02770","title":"Don't Be So Dense: Sparse-to-Sparse GAN Training Without Sacrificing Performance","created":"2022-03-05","cited_by_count":7,"area":null},{"id":"2205.15677","title":"Augmentation-Aware Self-Supervision for Data-Efficient GAN Training","created":"2022-05-31","cited_by_count":7,"area":null},{"id":"2402.02855","title":"Dynamic Sparse Learning: A Novel Paradigm for Efficient Recommendation","created":"2024-02-05","cited_by_count":7,"area":null},{"id":"2206.04762","title":"Data-Efficient Double-Win Lottery Tickets from Robust Pre-training","created":"2022-06-09","cited_by_count":5,"area":null},{"id":"2206.14658","title":"Cut Inner Layers: A Structured Pruning Strategy for Efficient U-Net GANs","created":"2022-06-29","cited_by_count":5,"area":null},{"id":"2212.08311","title":"Can We Find Strong Lottery Tickets in Generative Models?","created":"2022-12-16","cited_by_count":4,"area":null},{"id":"2203.13802","title":"Playing Lottery Tickets in Style Transfer Models","created":"2022-03-25","cited_by_count":1,"area":null},{"id":"2212.11091","title":"Exploring Content Relationships for Distilling Efficient GANs","created":"2022-12-21","cited_by_count":1,"area":null},{"id":"2405.03723","title":"Generative adversarial learning with optimal input dimension and its adaptive generator architecture","created":"2024-05-06","cited_by_count":1,"area":null},{"id":"2412.06545","title":"On How Iterative Magnitude Pruning Discovers Local Receptive Fields in Fully Connected Neural Networks","created":"2024-12-09","cited_by_count":1,"area":null},{"id":"2112.06502","title":"DGL-GAN: Discriminator Guided Learning for GAN Compression","created":"2021-12-13","cited_by_count":0,"area":null},{"id":"2206.01244","title":"Real-Time Portrait Stylization on the Edge","created":"2022-06-02","cited_by_count":0,"area":null},{"id":"2410.24187","title":"Chasing Better Deep Image Priors between Over- and Under-parameterization","created":"2024-10-31","cited_by_count":0,"area":null},{"id":"2412.07605","title":"Fast Track to Winning Tickets: Repowering One-Shot Pruning for Graph Neural Networks","created":"2024-12-10","cited_by_count":0,"area":null},{"id":"2609.32615","title":"Stabilizing the Dynamic Low-Rank Training","created":"2026-09-26","cited_by_count":0,"area":null}],"next_cursor":null}