{"total":25,"rows":[{"id":"2308.06619","title":"Can Unstructured Pruning Reduce the Depth in Deep Neural Networks?","created":"2023-08-12","cited_by_count":20,"area":null},{"id":"2211.16667","title":"Dynamic Sparse Training via Balancing the Exploration-Exploitation Trade-off","created":"2022-11-30","cited_by_count":15,"area":null},{"id":"2411.00247","title":"Deep Learning Through A Telescoping Lens: A Simple Model Provides Empirical Insights On Grokking, Gradient Boosting & Beyond","created":"2024-10-31","cited_by_count":9,"area":null},{"id":"2303.01213","title":"DSD$^2$: Can We Dodge Sparse Double Descent and Compress the Neural Network Worry-Free?","created":"2023-03-02","cited_by_count":6,"area":null},{"id":"2506.06866","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","created":"2025-06-07","cited_by_count":5,"area":null},{"id":"2302.09369","title":"Calibrating the Rigged Lottery: Making All Tickets Reliable","created":"2023-02-18","cited_by_count":4,"area":null},{"id":"2307.08771","title":"UPSCALE: Unconstrained Channel Pruning","created":"2023-07-17","cited_by_count":4,"area":null},{"id":"2308.06755","title":"Influence Function Based Second-Order Channel Pruning-Evaluating True Loss Changes For Pruning Is Possible Without Retraining","created":"2023-08-13","cited_by_count":4,"area":null},{"id":"2404.16890","title":"Layer Collapse Can be Induced by Unstructured Pruning","created":"2024-04-24","cited_by_count":4,"area":null},{"id":"2301.00335","title":"Pruning Before Training May Improve Generalization, Provably","created":"2023-01-01","cited_by_count":3,"area":null},{"id":"2507.16872","title":"CompLeak: Deep Learning Model Compression Exacerbates Privacy Leakage","created":"2025-07-22","cited_by_count":3,"area":null},{"id":"2302.13259","title":"Can we avoid Double Descent in Deep Neural Networks?","created":"2023-02-26","cited_by_count":2,"area":null},{"id":"2306.12190","title":"Quantifying lottery tickets under label noise: accuracy, calibration, and complexity","created":"2023-06-21","cited_by_count":2,"area":null},{"id":"2307.14253","title":"Sparse Double Descent in Vision Transformers: real or phantom threat?","created":"2023-07-26","cited_by_count":2,"area":null},{"id":"2403.20047","title":"Embracing Unknown Step by Step: Towards Reliable Sparse Training in Real World","created":"2024-03-29","cited_by_count":1,"area":null},{"id":"2409.09196","title":"Are Sparse Neural Networks Better Hard Sample Learners?","created":"2024-09-13","cited_by_count":1,"area":null},{"id":"2308.16596","title":"The Quest of Finding the Antidote to Sparse Double Descent","created":"2023-08-31","cited_by_count":0,"area":null},{"id":"2401.10686","title":"Manipulating Sparse Double Descent","created":"2024-01-19","cited_by_count":0,"area":null},{"id":"2403.12690","title":"LNPT: Label-free Network Pruning and Training","created":"2024-03-19","cited_by_count":0,"area":null},{"id":"2405.07679","title":"Class-wise Activation Unravelling the Engima of Deep Double Descent","created":"2024-05-13","cited_by_count":0,"area":null},{"id":"2411.19092","title":"Neural Window Decoder for SC-LDPC Codes","created":"2024-11-28","cited_by_count":0,"area":null},{"id":"2501.01844","title":"Learning from Ambiguous Data with Hard Labels","created":"2025-01-03","cited_by_count":0,"area":null},{"id":"2503.02302","title":"On the Relationship Between Double Descent of CNNs and Shape/Texture Bias Under Learning Process","created":"2025-03-04","cited_by_count":0,"area":null},{"id":"2602.07618","title":"Neural Networks With Dense Weights Are Not Universal Approximators","created":"2026-02-07","cited_by_count":0,"area":null},{"id":"2608.04593","title":"Rethinking Reservoir Pruning: A Dynamical Perspective for Echo State Networks","created":"2026-08-05","cited_by_count":0,"area":null}],"next_cursor":null}