Pith. sign in

REVIEW 4 cited by

Towards Optimizing the Costs of LLM Usage

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 2402.01742 v1 pith:ENVLPO4Q submitted 2024-01-29 cs.CL cs.AIcs.LG

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

Generative AI and LLMs in particular are heavily used nowadays for various document processing tasks such as question answering and summarization. However, different LLMs come with different capabilities for different tasks as well as with different costs, tokenization, and latency. In fact, enterprises are already incurring huge costs of operating or using LLMs for their respective use cases. In this work, we propose optimizing the usage costs of LLMs by estimating their output quality (without actually invoking the LLMs), and then solving an optimization routine for the LLM selection to either keep costs under a budget, or minimize the costs, in a quality and latency aware manner. We propose a model to predict the output quality of LLMs on document processing tasks like summarization, followed by an LP rounding algorithm to optimize the selection of LLMs. We study optimization problems trading off the quality and costs, both theoretically and empirically. We further propose a sentence simplification model for reducing the number of tokens in a controlled manner. Additionally, we propose several deterministic heuristics for reducing tokens in a quality aware manner, and study the related optimization problem of applying the heuristics optimizing the quality and cost trade-off. We perform extensive empirical validation of our methods on not only enterprise datasets but also on open-source datasets, annotated by us, and show that we perform much better compared to closest baselines. Our methods reduce costs by 40%- 90% while improving quality by 4%-7%. We will release the annotated open source datasets to the community for further research and exploration.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

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

  1. Opti-Q: A Constraint-Based Optimization Framework for Multi-LLM Question Planning

    cs.AI 2026-06 conditional novelty 6.0 of 10

    Per-question database-style plan search over multi-LLM DAGs improves QA quality under budgets by ~58% (MMLU-Pro) and ~41% (SimpleQA) versus reimplemented baselines.

  2. eMamba: Efficient Acceleration Framework for Mamba Models in Edge Computing

    cs.LG 2025-08 conditional novelty 6.0 of 10

    An end-to-end Mamba edge accelerator using hardware-friendly approximations, INT8 quantization, and NAS achieves 4.95x-5.62x lower latency and 1.63x-19.9x smaller models than ViT/CNN baselines.

  3. RedactOR: An LLM-Powered Framework for Automatic Clinical Data De-Identification

    cs.AI 2025-05 conditional novelty 6.0 of 10

    RedactOR combines schema rules, multi-pass LLM entity extraction, retrieval-based relexicalization, and ASR plus VAD audio redaction, achieving F1 0.9646 on a 100-note i2b2 2014 subsample.

  4. FAA Framework: A Large Language Model-Based Approach for Credit Card Fraud Investigations

    cs.CR 2025-06 reject novelty 4.0 of 10

    The FAA framework automates credit card fraud investigations with GPT-4o agents and reports 98-99% fraud-detection F1, though the evaluation is weakened by self-referential LLM scoring.

Pith tools