Pith. sign in

REVIEW 15 cited by

Efficient Large Language Models: A Survey

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2312.03863 v4 pith:KKDT3IA7 submitted 2023-12-06 cs.CL cs.AI

classification cs.CLcs.AI
keywords efficientlanguagellmssurveyresearchcapabilitiesgithubimportant
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Large Language Models (LLMs) have demonstrated remarkable capabilities in important tasks such as natural language understanding and language generation, and thus have the potential to make a substantial impact on our society. Such capabilities, however, come with the considerable resources they demand, highlighting the strong need to develop effective techniques for addressing their efficiency challenges. In this survey, we provide a systematic and comprehensive review of efficient LLMs research. We organize the literature in a taxonomy consisting of three main categories, covering distinct yet interconnected efficient LLMs topics from model-centric, data-centric, and framework-centric perspective, respectively. We have also created a GitHub repository where we organize the papers featured in this survey at https://github.com/AIoT-MLSys-Lab/Efficient-LLMs-Survey. We will actively maintain the repository and incorporate new research as it emerges. We hope our survey can serve as a valuable resource to help researchers and practitioners gain a systematic understanding of efficient LLMs research and inspire them to contribute to this important and exciting field.

Discussion (0). Sign in to comment.

Forward citations

Cited by 15 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 24 citations worldwide. Full citation record

  1. OTora: A Unified Red Teaming Framework for Reasoning-Level Denial-of-Service in LLM Agents

    cs.LG 2026-05 unverdicted novelty 8.0 of 10

    OTora provides the first unified framework for reasoning-level denial-of-service attacks on LLM agents, achieving up to 10x more reasoning tokens and order-of-magnitude latency increases while preserving task accuracy...

  2. Token Reduction Is Not Cost Reduction

    cs.CL 2026-07 conditional novelty 6.0 of 10

    Token reduction of tool output does not reliably lower billed coding-agent cost; prompt-cache traffic dominates, and aggressive compression can also destroy task success.

  3. What to Keep, What to Forget: A Rate--Distortion View of Memory Compaction in LLMs and Agents

    cs.LG 2026-07 conditional novelty 6.0 of 10

    KV-cache eviction, prompt compression, recurrent state bounding, and agent memory consolidation are unified as one rate-distortion problem with a shared lower bound, shared failure mode, and transferable mechanisms.

  4. Decoding Memories: An Efficient Pipeline for Self-Consistency Hallucination Detection

    cs.CL 2025-08 conditional novelty 6.0 of 10

    A decoding pipeline reuses cached tokens and anneals sampling temperature to accelerate self-consistency hallucination detection by up to 3x without meaningful AUROC loss.

  5. EAT: QoS-Aware Edge-Collaborative AIGC Task Scheduling via Attention-Guided Diffusion Reinforcement Learning

    cs.DC 2025-07 conditional novelty 6.0 of 10

    EAT, an attention-guided diffusion reinforcement learning scheduler for collaborative edge AIGC, reduces Stable Diffusion inference latency by 56-74% versus baselines while keeping CLIP quality nearly unchanged.

  6. Direct Behavior Optimization: Unlocking the Potential of Lightweight LLMs

    cs.CL 2025-06 conditional novelty 6.0 of 10

    A gradient-free Monte Carlo tree search over JSON key-step plans produces few-shot demonstrations that let LLaMA3-8B and LLaMA3.2-3B outperform GPT-3.5 on most of seven BIG-Bench Hard tasks.

  7. DaMoC: Efficiently Selecting the Optimal Large Language Model for Fine-tuning Domain Tasks Based on Data and Model Compression

    cs.CL 2025-09 reject novelty 5.0 of 10

    DaMoC combines data filtering, token compression, and layer pruning to select the best LLM for domain fine-tuning, claiming ~20x faster training while preserving model rankings.

  8. TASE: Token Awareness and Structured Evaluation for Multilingual Language Models

    cs.CL 2025-08 unverdicted novelty 5.0 of 10

    TASE benchmark shows LLMs lag humans on token-level and structural language tasks across Chinese, English, and Korean despite strong high-level performance.

  9. Semantic Scheduling for LLM Inference

    cs.LG 2025-06 conditional novelty 5.0 of 10

    A semantic scheduler for LLM inference uses urgency labels and estimated remaining compute to cut waiting times for urgent requests, tested on emergency medical data.

  10. Enhancing Reasoning Capabilities of Small Language Models with Blueprints and Prompt Template Search

    cs.LG 2025-06 conditional novelty 5.0 of 10

    Small language models achieve higher accuracy on math, coding, and logic benchmarks when their prompts contain LLM-generated reasoning blueprints and a per-model, per-task searched template.

  11. The Path to Self-Evolving Clinical Systems: Scaling Medical Agents from Assistance to Autonomy

    cs.AI 2026-07 conditional novelty 4.5 of 10

    Medical agents should be scaled mainly by richer clinical environments and self-evolution loops, not parameter growth alone, under a three-level autonomy taxonomy.

  12. CHS-SQL: A Text-to-SQL approach based on Confidence-Guided Heuristic Search Schema Linking process

    cs.AI 2026-06 conditional novelty 4.0 of 10

    CHS-SQL combines beam search with model-internal-confidence filtering in schema linking to improve small-model text-to-SQL accuracy on Spider and BIRD.

  13. NeurIPS 2025 E2LM Competition : Early Training Evaluation of Language Models

    cs.AI 2025-06 conditional novelty 4.0 of 10

    The authors propose a competition with new scoring metrics to find benchmarks that give clean early-training signals for small language models, and show MMLU-var outperforms MMLU as a baseline.

  14. SkipGPT: Dynamic Layer Pruning Reinvented with Token Awareness and Module Decoupling

    cs.CL 2025-06 conditional novelty 4.0 of 10

    SkipGPT learns per-token, per-module routers that dynamically skip attention and MLP blocks, then uses LoRA to recover most of the original model's quality.

  15. Toward Efficient Agents: Memory, Tool learning, and Planning

    cs.AI 2026-01 conditional novelty 3.0 of 10

    A survey that organizes efficiency techniques for LLM agents into memory, tool learning, and planning, and consolidates benchmarks and metrics for measuring cost-performance trade-offs.

Pith tools