{"total":15,"rows":[{"id":"2303.15647","title":"Scaling Down to Scale Up: A Guide to Parameter-Efficient Fine-Tuning","created":"2023-03-28","cited_by_count":173,"area":null},{"id":"2405.17357","title":"DoRA: Enhancing Parameter-Efficient Fine-Tuning with Dynamic Rank Distribution","created":"2024-05-27","cited_by_count":43,"area":null},{"id":"2307.07982","title":"A Survey of Techniques for Optimizing Transformer Inference","created":"2023-07-16","cited_by_count":35,"area":null},{"id":"2302.01172","title":"STEP: Learning N:M Structured Sparsity Masks from Scratch with Precondition","created":"2023-02-02","cited_by_count":26,"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":"2203.10991","title":"Minimum Variance Unbiased N:M Sparsity for the Neural Gradients","created":"2022-03-21","cited_by_count":9,"area":null},{"id":"2312.13211","title":"DSFormer: Effective Compression of Text-Transformers by Dense-Sparse Weight Factorization","created":"2023-12-20","cited_by_count":3,"area":null},{"id":"2206.15014","title":"Compressing Pre-trained Transformers via Low-Bit NxM Sparsity for Natural Language Understanding","created":"2022-06-30","cited_by_count":2,"area":null},{"id":"2408.03728","title":"A Convex-optimization-based Layer-wise Post-training Pruner for Large Language Models","created":"2024-08-07","cited_by_count":2,"area":null},{"id":"2312.08685","title":"Privacy Amplification by Iteration for ADMM with (Strongly) Convex Objective Functions","created":"2023-12-14","cited_by_count":1,"area":null},{"id":"2502.11439","title":"An Efficient Sparse Fine-Tuning with Low Quantization Error via Neural Network Pruning","created":"2025-02-17","cited_by_count":1,"area":null},{"id":"2505.03373","title":"SPAP: Structured Pruning via Alternating Optimization and Penalty Methods","created":"2025-05-06","cited_by_count":1,"area":null},{"id":"2506.12876","title":"MaskPro: Linear-Space Probabilistic Learning for Strict (N:M)-Sparsity on LLMs","created":"2025-06-15","cited_by_count":1,"area":null},{"id":"2602.06694","title":"NanoQuant: Efficient Sub-1-Bit Quantization of Large Language Models","created":"2026-02-06","cited_by_count":1,"area":null},{"id":"2311.10549","title":"Archtree: on-the-fly tree-structured exploration for latency-aware pruning of deep neural networks","created":"2023-11-17","cited_by_count":0,"area":null}],"next_cursor":null}