{"total":19,"rows":[{"id":"2410.11988","title":"DISP-LLM: Dimension-Independent Structural Pruning for Large Language Models","created":"2024-10-15","cited_by_count":24,"area":null},{"id":"2409.09085","title":"HESSO: Towards Automatic Efficient and User Friendly Any Neural Network Training and Pruning","created":"2024-09-11","cited_by_count":4,"area":null},{"id":"2412.14426","title":"All-in-One Tuning and Structural Pruning for Domain-Specific LLMs","created":"2024-12-19","cited_by_count":4,"area":null},{"id":"2512.12544","title":"HyperEdit: Unlocking Instruction-based Text Editing in LLMs via Hypernetworks","created":"2025-12-14","cited_by_count":4,"area":null},{"id":"2410.16151","title":"Small Contributions, Small Networks: Efficient Neural Network Pruning Based on Relative Importance","created":"2024-10-21","cited_by_count":2,"area":null},{"id":"2506.12041","title":"Meta Pruning via Graph Metanetworks : A Universal Meta Learning Framework for Network Pruning","created":"2025-05-24","cited_by_count":2,"area":null},{"id":"2406.03879","title":"Decay Pruning Method: Smooth Pruning With a Self-Rectifying Procedure","created":"2024-06-06","cited_by_count":1,"area":null},{"id":"2412.06212","title":"A Self-guided Multimodal Approach to Enhancing Graph Representation Learning for Alzheimer's Diseases","created":"2024-12-09","cited_by_count":1,"area":null},{"id":"2501.13439","title":"One-Cycle Structured Pruning via Stability-Driven Subnetwork Search","created":"2025-01-23","cited_by_count":1,"area":null},{"id":"2501.14182","title":"Single-weight Model Editing for Post-hoc Spurious Correlation Neutralization","created":"2025-01-24","cited_by_count":1,"area":null},{"id":"2411.14345","title":"Layer Pruning with Consensus: A Triple-Win Solution","created":"2024-11-21","cited_by_count":0,"area":null},{"id":"2505.13225","title":"CoSeP: Complementary Separability Pruning via Class-Separability Clustering","created":"2025-05-19","cited_by_count":0,"area":null},{"id":"2506.04513","title":"Pruning Everything, Everywhere, All at Once","created":"2025-06-04","cited_by_count":0,"area":null},{"id":"2506.09451","title":"Safe Screening Rules for Group SLOPE","created":"2025-06-11","cited_by_count":0,"area":null},{"id":"2507.14170","title":"Catalyst: a Novel Regularizer for Structured Pruning with Auxiliary Extension of Parameter Space","created":"2025-07-10","cited_by_count":0,"area":null},{"id":"2510.04044","title":"Quantization Range Estimation for Convolutional Neural Networks","created":"2025-10-05","cited_by_count":0,"area":null},{"id":"2511.06265","title":"CAMP-HiVe: Cyclic Pair Merging based Efficient DNN Pruning with Hessian-Vector Approximation for Resource-Constrained Systems","created":"2025-11-09","cited_by_count":0,"area":null},{"id":"2604.25188","title":"Image Classification via Random Dilated Convolution with Multi-Branch Feature Extraction and Context Excitation","created":"2026-04-28","cited_by_count":0,"area":null},{"id":"2604.27434","title":"AdaBFL: Multi-Layer Defensive Adaptive Aggregation for Bzantine-Robust Federated Learning","created":"2026-04-30","cited_by_count":0,"area":null}],"next_cursor":null}