mlsanityData to 14 Oct 2026

Market-Driven Subset Selection for Budgeted Training

arXiv 2510.02456 ↗First posted 2 Oct 2025cs.LG cs.AI cs.NAcited by 0

Not on the map. Why?

Abstract (arXiv)

Training large language models on massive datasets is computationally expensive, yet empirical evidence suggests that substantial portions of training examples contribute minimally to final performance. Data subset selection addresses this inefficiency by identifying small, high-utility subsets under resource constraints. However, example utility is inherently multi-faceted, encompassing uncertainty, distributional rarity, and diversity signals that are heterogeneous and typically combined through ad hoc weighted sums lacking theoretical grounding. We propose a market-based framework that treats each training example as a tradeable contract and employs the Logarithmic Market Scoring Rule to aggregate multiple utility signals into coherent prices. Heterogeneous signals act as traders, a single liquidity parameter controls concentration versus smoothing, and topic-wise normalization ensures calibrated aggregation. Token budgets are handled explicitly through a price-per-token decision rule with an interpretable length-bias parameter. We establish theoretical connections to maximum-entropy aggregation and provide utility recovery guarantees under noisy but monotone signals. On GSM8K mathematical reasoning under strict 60k-token budgets, our selector achieves parity with strong single-signal baselines while exhibiting lower variance and incurring less than 0.1 GPU-hour overhead. On AGNews classification at 5-25% retention rates, the market formulation delivers competitive accuracy with improved stability. Our framework unifies multi-signal data curation under fixed computational budgets for prompt-level reasoning and classification tasks.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 10 of its 29 references that are in the map. First posted on arXiv 2 Oct 2025.

Builds on

10 of 29 references.

References · 10

  1. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  2. 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,448
  3. 2017Billion-scale similarity search with GPUscited by 2,497
  4. 2015Character-level Convolutional Networks for Text Classificationcited by 2,330
  5. 2016Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphscited by 861
  6. 2019Deep Batch Active Learning by Diverse, Uncertain Gradient Lower Boundscited by 610
  7. 2021Deep Learning on a Data Diet: Finding Important Examples Early in Trainingcited by 533
  8. 2019BatchBALD: Efficient and Diverse Batch Acquisition for Deep Bayesian Active Learningcited by 432
  9. 2020GLISTER: Generalization based Data Subset Selection for Efficient and Robust Learningcited by 226
  10. 2025GRAFT: Gradient-Aware Fast MaxVol Technique for Dynamic Data Samplingcited by 2

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2025Alpha-R1: Alpha Screening with LLM Reasoning via Reinforcement Learning
  2. 2026Unlocking Data Value in Finance: A Study on Distillation and Difficulty-Aware Training
  3. 2026Learning to Trade Like an Expert: Cognitive Fine-Tuning for Stable Financial Reasoning in Language Models
  4. 2025Balancing the Budget: Understanding Trade-offs Between Supervised and Preference-Based Finetuning
  5. 2026QuantEval: A Benchmark for Financial Quantitative Tasks in Large Language Models
  6. 2026Utility-Aware Data Pricing: Token-Level Quality and Empirical Training Gain for LLMs
  7. 2026Aligning the Query Space: Greedy Information Projection for Language Model Data Selection
  8. 2025Subset Selection for Fine-Tuning: A Utility-Diversity Balanced Approach for Mathematical Domain Adaptation