Cost-aware LLM-based Online Dataset Annotation
Not on the map. Why?
Abstract (arXiv)
Recent advances in large language models (LLMs) have enabled automated dataset labeling with minimal human supervision. While majority voting across multiple LLMs can improve label reliability by mitigating individual model biases, it incurs high computational costs due to repeated querying. In this work, we propose a novel online framework, Cost-aware Majority Voting (CaMVo), for efficient and accurate LLM-based dataset annotation. CaMVo adaptively selects a subset of LLMs for each data instance based on contextual embeddings, balancing confidence and cost without requiring pre-training or ground-truth labels. Leveraging a LinUCB-based selection mechanism and a Bayesian estimator over confidence scores, CaMVo estimates a lower bound on labeling accuracy for each LLM and aggregates responses through weighted majority voting. Our empirical evaluation on the MMLU and IMDB Movie Review datasets demonstrates that CaMVo achieves comparable or superior accuracy to full majority voting while significantly reducing labeling costs. This establishes CaMVo as a practical and robust solution for cost-efficient annotation in dynamic labeling environments.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 13 of its 25 references that are in the map. First posted on arXiv 21 May 2025.
Builds on
13 of 25 references.
References · 13
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2015Character-level Convolutional Networks for Text Classificationcited by 2,330
- 2022Language Models (Mostly) Know What They Knowcited by 1,856
- 2020MiniLM: Deep Self-Attention Distillation for Task-Agnostic Compression of Pre-Trained Transformerscited by 1,463
- 2020Aligning AI With Shared Human Valuescited by 723
- 2023A Comprehensive Overview of Large Language Modelscited by 648
- 2024Hybrid LLM: Cost-Efficient and Quality-Aware Query Routingcited by 372
- 2024More Agents Is All You Needcited by 180
- 2024What Did I Do Wrong? Quantifying LLMs' Sensitivity and Consistency to Prompt Engineeringcited by 90
- 2024MetaLLM: A High-performant and Cost-efficient Dynamic Framework for Wrapping LLMscited by 41
- 2014Error Rate Bounds and Iterative Weighted Majority Voting for Crowdsourcingcited by 21
- 2024To Ensemble or Not: Assessing Majority Voting Strategies for Phishing Detection with Large Language Modelscited by 12
1 more
Built on by
Citing papers per year: 2025: 1; 2026: 3.
4 papers.
- 2025Beyond Majority Voting: LLM Aggregation by Leveraging Higher-Order Informationcited by 26
- 2026Don't Always Pick the Highest-Performing Model: An Information Theoretic View of LLM Ensemble Selectioncited by 11
- 2026MultiSoc-4D: A Benchmark for Diagnosing Instruction-Induced Label Collapse in Closed-Set LLM Annotation of Bengali Social Mediacited by 1
- 2026Industry Classification of GitHub Repositories Using the North American Industry Classification System (NAICS)cited by 0
- 2026Industry Classification of GitHub Repositories Using the North American Industry Classification System (NAICS)7 Jul 2026
- 2026MultiSoc-4D: A Benchmark for Diagnosing Instruction-Induced Label Collapse in Closed-Set LLM Annotation of Bengali Social Media7 May 2026
- 2026Don't Always Pick the Highest-Performing Model: An Information Theoretic View of LLM Ensemble Selection8 Feb 2026
- 2025Beyond Majority Voting: LLM Aggregation by Leveraging Higher-Order Information1 Oct 2025