{"total":33,"rows":[{"id":"2312.03863","title":"Efficient Large Language Models: A Survey","created":"2023-12-06","cited_by_count":186,"area":null},{"id":"2312.11556","title":"StarVector: Generating Scalable Vector Graphics Code from Images and Text","created":"2023-12-17","cited_by_count":102,"area":null},{"id":"2402.03804","title":"ReLU$^2$ Wins: Discovering Efficient Activation Functions for Sparse LLMs","created":"2024-02-06","cited_by_count":67,"area":null},{"id":"2311.14479","title":"Controlled Text Generation via Language Model Arithmetic","created":"2023-11-24","cited_by_count":51,"area":null},{"id":"2408.08696","title":"Turning Trash into Treasure: Accelerating Inference of Large Language Models with Token Recycling","created":"2024-08-16","cited_by_count":47,"area":null},{"id":"2507.11851","title":"Your LLM Knows the Future: Uncovering Its Multi-Token Prediction Potential","created":"2025-07-16","cited_by_count":47,"area":null},{"id":"2405.14696","title":"A Declarative System for Optimizing AI Workloads","created":"2024-05-23","cited_by_count":37,"area":null},{"id":"2409.04267","title":"An overview of domain-specific foundation model: key technologies, applications and challenges","created":"2024-09-06","cited_by_count":19,"area":null},{"id":"2501.08219","title":"Characterizing LLM Inference Energy-Performance Tradeoffs across Workloads and GPU Scaling","created":"2025-01-14","cited_by_count":19,"area":null},{"id":"2401.12522","title":"BiTA: Bi-Directional Tuning for Lossless Acceleration in Large Language Models","created":"2024-01-23","cited_by_count":13,"area":null},{"id":"2505.14709","title":"FastCar: Cache Attentive Replay for Fast Auto-Regressive Video Generation on the Edge","created":"2025-05-17","cited_by_count":10,"area":null},{"id":"2407.12021","title":"Adaptive Draft-Verification for Efficient Large Language Model Decoding","created":"2024-06-27","cited_by_count":9,"area":null},{"id":"2311.08981","title":"Speculative Contrastive Decoding","created":"2023-11-15","cited_by_count":8,"area":null},{"id":"2510.13890","title":"A Survey on Collaborating Small and Large Language Models for Performance, Cost-effectiveness, Cloud-edge Privacy, and Trustworthiness","created":"2025-10-14","cited_by_count":7,"area":null},{"id":"2409.15869","title":"Whisper in Medusa's Ear: Multi-head Efficient Decoding for Transformer-based ASR","created":"2024-09-24","cited_by_count":6,"area":null},{"id":"2412.10418","title":"Constrained Decoding with Speculative Lookaheads","created":"2024-12-09","cited_by_count":6,"area":null},{"id":"2405.00888","title":"DynaMo: Accelerating Language Model Inference with Dynamic Multi-Token Sampling","created":"2024-05-01","cited_by_count":4,"area":null},{"id":"2409.04833","title":"Achieving Peak Performance for Large Language Models: A Systematic Review","created":"2024-09-07","cited_by_count":4,"area":null},{"id":"2601.22362","title":"Understanding Efficiency: Quantization, Batching, and Serving Strategies in LLM Energy Use","created":"2026-01-29","cited_by_count":4,"area":null},{"id":"2510.17892","title":"Advances in Pre-trained Language Models for Domain-Specific Text Classification: A Systematic Review","created":"2025-10-18","cited_by_count":3,"area":null},{"id":"2511.15618","title":"FlashMesh: Faster and Better Autoregressive Mesh Synthesis via Structured Speculation","created":"2025-11-19","cited_by_count":3,"area":null},{"id":"2401.07886","title":"Learned Best-Effort LLM Serving","created":"2024-01-15","cited_by_count":2,"area":null},{"id":"2404.15834","title":"FEDSTR: Money-In AI-Out | A Decentralized Marketplace for Federated Learning and LLM Training on the NOSTR Protocol","created":"2024-04-15","cited_by_count":2,"area":null},{"id":"2408.13985","title":"TF-Attack: Transferable and Fast Adversarial Attacks on Large Language Models","created":"2024-08-26","cited_by_count":2,"area":null},{"id":"2409.15097","title":"Efficiently Dispatching Flash Attention For Partially Filled Attention Masks","created":"2024-09-23","cited_by_count":2,"area":null},{"id":"2501.05465","title":"Small Language Models (SLMs) Can Still Pack a Punch: A survey (updated 2026)","created":"2025-01-03","cited_by_count":2,"area":null},{"id":"2510.11813","title":"Task-Aware Reduction for Scalable LLM-Database Systems","created":"2025-10-13","cited_by_count":1,"area":null},{"id":"2601.15714","title":"Even GPT-5.2 Can't Count to Five: The Case for Zero-Error Horizons in Trustworthy LLMs","created":"2026-01-22","cited_by_count":1,"area":null},{"id":"2406.06571","title":"SUBLLM: A Novel Efficient Architecture with Token Sequence Subsampling for LLM","created":"2024-06-03","cited_by_count":0,"area":null},{"id":"2410.20488","title":"FIRP: Faster LLM inference via future intermediate representation prediction","created":"2024-10-27","cited_by_count":0,"area":null},{"id":"2509.07909","title":"Uncovering Scaling Laws for Large Language Models via Inverse Problems","created":"2025-09-09","cited_by_count":0,"area":null},{"id":"2603.13438","title":"Draft-and-Target Sampling for Video Generation Policy","created":"2026-03-13","cited_by_count":0,"area":null},{"id":"2606.10935","title":"CLP: Collocation-Length Prediction for Zero-Loss Adaptive Multi-Token Inference","created":"2026-06-09","cited_by_count":0,"area":null}],"next_cursor":null}