arXiv AI

Rectification Difficulty and Optimal Sample Allocation in LLM-Augmented Surveys

arXiv:2604. 17267v2 Announce Type: replace Abstract: Large Language Models can generate synthetic survey responses at low cost, but their accuracy varies unpredictably across questions.

arXiv Machine Learning
Aug 31

Learning a Size-Weight Frontier for Synthetic-Augmented Inference

The paper introduces a framework for synthetic‑augmented inference that balances the number of synthetic observations with their assigned weight. It defines a size‑weight frontier, estimating for each weight the maximum synthetic sample size that still guarantees target task‑marginal coverage for all smaller sizes. The authors provide finite‑sample coverage guarantees for configurations on or below this frontier and demonstrate that, when applied to augment opinion survey data with large language model responses, the method achieves the desired coverage while significantly tightening confidence intervals.

By Chengpiao Huang, Kaizheng Wang
arXiv AI
Sep 24

Fine-Tune, Then Rectify

The paper proposes a two‑stage framework that first fine‑tunes a large language model (LLM) and then rectifies its outputs, allocating limited labeled data optimally between the stages. It argues that the usual mean‑squared‑error objective for fine‑tuning misaligns with the downstream rectification, and instead suggests minimizing prediction‑error variance for mean estimation or a scalarized variance metric for general M‑estimation. Empirical results confirm that this variance‑based fine‑tuning, combined with optimal data allocation, yields significant efficiency gains over using either fine‑tuning or rectification alone, or using the conventional objective.

By Zikun Ye, Jinglong Zhao, Lei Wang
arXiv AI
Aug 11

Beyond Solvability: Task Learnability as a Static Prior for LLM RL Post-Training

arXiv:2608. 09217v1 Announce Type: cross Abstract: Reinforcement learning (RL) has become a central post-training paradigm for eliciting reasoning capabilities in large language models, yet uniform task sampling allocates compute without regard to differences in how tasks respond to optimization.

By Ting Zhou, Zhenqing Ling, Daoyuan Chen, Qianli Shen, Yilun Huang, Ying Shen, Yaliang Li
arXiv Computation and Language
Sep 14

Chopthin-Consensus Power Sampling: A Diversity-Preserving Approach to LLM Decoding

Chopthin-Consensus Power Sampling (CCPS) is a new inference-time decoding method for large language models that uses the Chopthin resampler to preserve diversity among particle trajectories. By enforcing an upper bound on weight ratios instead of equal-weight resampling, CCPS maintains a richer set of distinct reasoning paths and guarantees a lower bound on effective sample size. Coupled with a semantic-majority selection mechanism, CCPS achieves higher oracle coverage and matches or surpasses baseline accuracy on multiple reasoning benchmarks.

By Minoo Ahmadi, Seyedarmin Azizi, Erfan Baghaei Potraghloo, Mehdi Kamal, Massoud Pedram
arXiv Computation and Language
6d ago

Large Language Model Selection with Limited Annotations

arXiv:2605.24981v2 Announce Type: replace Abstract: Choosing a Large Language Model (LLM) for a given task requires comparing many strong candidates, yet standard evaluation relies on costly annotati...

By Yavuz Durmazkeser, Patrik Okanovic, Andreas Kirsch, Torsten Hoefler, Nezihe Merve G\"urel