{"total":32,"rows":[{"id":"2402.09748","title":"Model Compression and Efficient Inference for Large Language Models: A Survey","created":"2024-02-15","cited_by_count":64,"area":null},{"id":"2311.13160","title":"Large Language Models in Education: Vision and Opportunities","created":"2023-11-22","cited_by_count":54,"area":null},{"id":"2310.09234","title":"ClickPrompt: CTR Models are Strong Prompt Generators for Adapting Language Models to CTR Prediction","created":"2023-10-13","cited_by_count":27,"area":null},{"id":"2312.00678","title":"The Efficiency Spectrum of Large Language Models: An Algorithmic Survey","created":"2023-12-01","cited_by_count":26,"area":null},{"id":"2402.17946","title":"SparseLLM: Towards Global Pruning for Pre-trained Language Models","created":"2024-02-28","cited_by_count":23,"area":null},{"id":"2310.04621","title":"Model Compression in Practice: Lessons Learned from Practitioners Creating On-device Machine Learning Experiences","created":"2023-10-06","cited_by_count":21,"area":null},{"id":"2401.11506","title":"Enhancing Recommendation Diversity by Re-ranking with Large Language Models","created":"2024-01-21","cited_by_count":19,"area":null},{"id":"2410.04960","title":"On Efficient Variants of Segment Anything Model: A Survey","created":"2024-10-07","cited_by_count":16,"area":null},{"id":"2508.04853","title":"Provable Post-Training Quantization: Theoretical Analysis of OPTQ and Qronos","created":"2025-08-06","cited_by_count":16,"area":null},{"id":"2406.14318","title":"The Fire Thief Is Also the Keeper: Balancing Usability and Privacy in Prompts","created":"2024-06-20","cited_by_count":13,"area":null},{"id":"2311.03687","title":"Dissecting the Runtime Performance of the Training, Fine-tuning, and Inference of Large Language Models","created":"2023-11-07","cited_by_count":12,"area":null},{"id":"2305.01645","title":"Distill or Annotate? Cost-Efficient Fine-Tuning of Compact Models","created":"2023-05-02","cited_by_count":11,"area":null},{"id":"2407.12797","title":"CEBench: A Benchmarking Toolkit for the Cost-Effectiveness of LLM Pipelines","created":"2024-06-20","cited_by_count":11,"area":null},{"id":"2507.04636","title":"Put Teacher in Student's Shoes: Cross-Distillation for Ultra-compact Model Compression Framework","created":"2025-07-07","cited_by_count":8,"area":null},{"id":"2310.08797","title":"A Comparative Analysis of Task-Agnostic Distillation Methods for Compressing Transformer Language Models","created":"2023-10-13","cited_by_count":6,"area":null},{"id":"2310.10262","title":"Enhancing Interpretability using Human Similarity Judgements to Prune Word Embeddings","created":"2023-10-16","cited_by_count":6,"area":null},{"id":"2405.17081","title":"Effective Layer Pruning Through Similarity Metric Perspective","created":"2024-05-27","cited_by_count":6,"area":null},{"id":"2208.14839","title":"QuantNAS for super resolution: searching for efficient quantization-friendly architectures against quantization noise","created":"2022-08-31","cited_by_count":4,"area":null},{"id":"2401.08505","title":"Harnessing Orthogonality to Train Low-Rank Neural Networks","created":"2024-01-16","cited_by_count":4,"area":null},{"id":"2502.02766","title":"Theoretical Guarantees for Low-Rank Compression of Deep Neural Networks","created":"2025-02-04","cited_by_count":3,"area":null},{"id":"2603.18426","title":"Prune-then-Quantize or Quantize-then-Prune? Understanding the Impact of Compression Order in Joint Model Compression","created":"2026-03-19","cited_by_count":3,"area":null},{"id":"2405.06038","title":"From Algorithm to Hardware: A Survey on Efficient and Safe Deployment of Deep Neural Networks","created":"2024-05-09","cited_by_count":2,"area":null},{"id":"2510.03246","title":"StructPrune: Structured Global Pruning asymptotics with $\\mathcal{O}(\\sqrt{N})$ GPU Memory","created":"2025-09-25","cited_by_count":1,"area":null},{"id":"2603.19296","title":"TTQ: Activation-Aware Test-Time Quantization to Accelerate LLM Inference On The Fly","created":"2026-03-11","cited_by_count":1,"area":null},{"id":"2605.08568","title":"Different Prompts, Different Ranks: Prompt-aware Dynamic Rank Selection for SVD-based LLM Compression","created":"2026-05-09","cited_by_count":1,"area":null},{"id":"2305.14066","title":"One-stop Training of Multiple Capacity Models","created":"2023-05-23","cited_by_count":0,"area":null},{"id":"2306.10056","title":"Generate to Understand for Representation","created":"2023-06-14","cited_by_count":0,"area":null},{"id":"2402.04359","title":"Adaptive Inference: Theoretical Limits and Unexplored Opportunities","created":"2024-02-06","cited_by_count":0,"area":null},{"id":"2406.06239","title":"I-MPN: Inductive Message Passing Network for Efficient Human-in-the-Loop Annotation of Mobile Eye Tracking Data","created":"2024-06-10","cited_by_count":0,"area":null},{"id":"2502.01706","title":"Comply: Learning Sentences with Complex Weights inspired by Fruit Fly Olfaction","created":"2025-02-03","cited_by_count":0,"area":null},{"id":"2605.17985","title":"SAFE-SVD: Sensitivity-Aware Fidelity-Enforcing SVD for Physics Foundation Models","created":"2026-05-18","cited_by_count":0,"area":null},{"id":"2606.08565","title":"EinSort: Sorting is All We Need for Tensorizing LLM","created":"2026-06-07","cited_by_count":0,"area":null}],"next_cursor":null}