{"total":23,"rows":[{"id":"2103.03936","title":"Pufferfish: Communication-efficient Models At No Extra Cost","created":"2021-03-05","cited_by_count":61,"area":null},{"id":"2205.13571","title":"Low-rank lottery tickets: finding efficient low-rank neural networks via matrix differential equations","created":"2022-05-26","cited_by_count":43,"area":null},{"id":"2210.06640","title":"Compute-Efficient Deep Learning: Algorithmic Trends and Opportunities","created":"2022-10-13","cited_by_count":38,"area":null},{"id":"2107.11442","title":"Compressing Neural Networks: Towards Determining the Optimal Layer-wise Decomposition","created":"2021-07-23","cited_by_count":33,"area":null},{"id":"2203.05483","title":"projUNN: efficient method for training deep networks with unitary matrices","created":"2022-03-10","cited_by_count":27,"area":null},{"id":"2309.03160","title":"ResFields: Residual Neural Fields for Spatiotemporal Signals","created":"2023-09-06","cited_by_count":27,"area":null},{"id":"2102.08329","title":"An Information-Theoretic Justification for Model Pruning","created":"2021-02-16","cited_by_count":25,"area":null},{"id":"2305.02538","title":"Cuttlefish: Low-Rank Model Training without All the Tuning","created":"2023-05-04","cited_by_count":25,"area":null},{"id":"2209.08554","title":"Pruning Neural Networks via Coresets and Convex Geometry: Towards No Assumptions","created":"2022-09-18","cited_by_count":20,"area":null},{"id":"2208.13141","title":"Federated Learning of Large Models at the Edge via Principal Sub-Model Training","created":"2022-08-28","cited_by_count":13,"area":null},{"id":"2305.19059","title":"Geometry-aware training of factorized layers in tensor Tucker format","created":"2023-05-30","cited_by_count":12,"area":null},{"id":"2401.10341","title":"ELRT: Efficient Low-Rank Training for Compact Convolutional Neural Networks","created":"2024-01-18","cited_by_count":11,"area":null},{"id":"2306.11250","title":"InRank: Incremental Low-Rank Learning","created":"2023-06-20","cited_by_count":10,"area":null},{"id":"2210.05280","title":"ME-D2N: Multi-Expert Domain Decompositional Network for Cross-Domain Few-Shot Learning","created":"2022-10-11","cited_by_count":9,"area":null},{"id":"2312.05264","title":"All Rivers Run to the Sea: Private Learning with Asymmetric Flows","created":"2023-12-05","cited_by_count":4,"area":null},{"id":"2409.03945","title":"TropNNC: Structured Neural Network Compression Using Tropical Geometry","created":"2024-09-05","cited_by_count":3,"area":null},{"id":"2410.07771","title":"Full-Rank No More: Low-Rank Weight Training for Modern Speech Recognition Models","created":"2024-10-10","cited_by_count":3,"area":null},{"id":"2303.03645","title":"Filter Pruning based on Information Capacity and Independence","created":"2023-03-07","cited_by_count":2,"area":null},{"id":"2502.07820","title":"Low-Rank Compression for IMC Arrays","created":"2025-02-10","cited_by_count":2,"area":null},{"id":"2403.10995","title":"Edge Private Graph Neural Networks with Singular Value Perturbation","created":"2024-03-16","cited_by_count":1,"area":null},{"id":"2510.20800","title":"Compress to Impress: Efficient LLM Adaptation Using a Single Gradient Step on 100 Samples","created":"2025-10-23","cited_by_count":1,"area":null},{"id":"2503.24014","title":"Optimization of Layer Skipping and Frequency Scaling for Convolutional Neural Networks under Latency Constraint","created":"2025-03-31","cited_by_count":0,"area":null},{"id":"2604.23375","title":"Hierarchical Spatio-Channel Clustering for Efficient Model Compression in Medical Image Analysis","created":"2026-04-25","cited_by_count":0,"area":null}],"next_cursor":null}