mlsanityData to 7 Oct 2026

CliqueParcel: An Approach For Batching LLM Prompts That Jointly Optimizes Efficiency And Faithfulness

arXiv 2402.14833 ↗First posted 17 Feb 2024cs.CL cs.AI cs.LGcited by 12

Not on the map. Why?

Abstract (arXiv)

Large language models (LLMs) have become pivotal in recent research. However, during the inference process, LLMs still require substantial resources. In this paper, we propose CliqueParcel, a method designed to improve the efficiency of LLMs via prompt batching. Existing strategies to optimize inference efficiency often compromise on output quality, leading to a discounted output problem. This issue might result in reduced accuracy or outputs that are less detailed. CliqueParcel is our answer to this challenge. While ensuring accuracy and minimizing deviations from the original outputs (i.e., faithfulness), our method significantly improves efficiency during inference. To lay the groundwork, we first redefine efficiency measurements by excluding the reduction in running time due to shorter lengths. Then, we provide a comprehensive trade-off between efficiency and faithfulness to clarify the nature of the 'discounted output' problem. Within the CliqueParcel framework, we suggest multiple batching sub-methods and discuss the specific scenarios in which they can be applied. During evaluation, CliqueParcel is tested on eight widely recognized datasets, which can be classified into three types: reading comprehension, open-source question-answering, and reasoning. Our experiments explore the performance of CliqueParcel, including efficiency, faithfulness, and the trade-off between them. This work provides novel insights into inference efficiency and demonstrates promising performance.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 38 of its 49 references that are in the map. First posted on arXiv 17 Feb 2024.

Builds on

38 of 49 references.

References · 38

  1. 2020Language Models are Few-Shot Learnerscited by 32,199
  2. 2023GPT-4 Technical Reportcited by 18,132
  3. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  4. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  5. 2020Measuring Massive Multitask Language Understandingcited by 7,768
  6. 2022Large Language Models are Zero-Shot Reasonerscited by 4,323
  7. 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
  8. 2021On the Opportunities and Risks of Foundation Modelscited by 3,961
  9. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
  10. 2018HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answeringcited by 3,686
  11. 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
  12. 2021Pre-train, Prompt, and Predict: A Systematic Survey of Prompting Methods in Natural Language Processingcited by 2,222
26 more
  1. 2020Concept Bottleneck Modelscited by 1,022
  2. 2022Large Language Models Are Human-Level Prompt Engineerscited by 1,020
  3. 2022LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scalecited by 881
  4. 2019Adversarial NLI: A New Benchmark for Natural Language Understandingcited by 798
  5. 2016Sequence-Level Knowledge Distillationcited by 761
  6. 2020Towards Faithfully Interpretable NLP Systems: How should we define and evaluate faithfulness?cited by 590
  7. 2022Efficiently Scaling Transformer Inferencecited by 529
  8. 2022ZeroQuant: Efficient and Affordable Post-Training Quantization for Large-Scale Transformerscited by 517
  9. 2022Complexity-Based Prompting for Multi-Step Reasoningcited by 387
  10. 2023Logic-LM: Empowering Large Language Models with Symbolic Solvers for Faithful Logical Reasoningcited by 379
  11. 2019Analysing Mathematical Reasoning Abilities of Neural Modelscited by 331
  12. 2022From Anecdotal Evidence to Quantitative Evaluation Methods: A Systematic Review on Evaluating Explainable AIcited by 299
  13. 2020FEQA: A Question Answering Evaluation Framework for Faithfulness Assessment in Abstractive Summarizationcited by 292
  14. 2023Deja Vu: Contextual Sparsity for Efficient LLMs at Inference Timecited by 247
  15. 2023A Comprehensive Survey of AI-Generated Content (AIGC): A History of Generative AI from GAN to ChatGPTcited by 221
  16. 2023Evaluating Correctness and Faithfulness of Instruction-Following Models for Question Answeringcited by 150
  17. 2023RPTQ: Reorder-based Post-training Quantization for Large Language Modelscited by 112
  18. 2023Question Decomposition Improves the Faithfulness of Model-Generated Reasoningcited by 107
  19. 2023LoSparse: Structured Compression of Large Language Models based on Low-Rank and Sparse Approximationcited by 103
  20. 2023Batch Prompting: Efficient Inference with Large Language Model APIscited by 84
  21. 2018Complex Sequential Question Answering: Towards Learning to Converse Over Linked Question Answer Pairs with a Knowledge Graphcited by 67
  22. 2021CPM-2: Large-scale Cost-effective Pre-trained Language Modelscited by 52
  23. 2023Did You Read the Instructions? Rethinking the Effectiveness of Task Definitions in Instruction Learningcited by 40
  24. 2022DISCO: Distilling Counterfactuals with Large Language Modelscited by 29
  25. 2023Compress, Then Prompt: Improving Accuracy-Efficiency Trade-off of LLM Inference with Transferable Promptcited by 28
  26. 2023Stationary Algorithmic Balancing For Dynamic Email Re-Ranking Problemcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 8; 2025: 2; 2026: 2.

12 papers.