arXiv:2511.07414v2 Announce Type: replace-cross
Abstract: The quantity of interest in the classical Cram\'er-Rao theory of unbiased estimation (e.g., the Cram\'er-Rao lower bound, its exact attainmen...
By Nicol\'as Garc\'ia Trillos, Adam Quinn Jaffe, Bodhisattva Sen
The paper addresses how to allocate a fixed evaluation budget across heterogeneous large language model judges to estimate scores for multiple prompt-response pairs most accurately. It introduces an inverse‑variance weighted estimator (IVWE) and an adaptive algorithm, EST‑IVWE, that uses optimistic variance estimates to approximate the oracle allocation. The authors prove that EST‑IVWE achieves near‑oracle error rates and establish a local minimax lower bound, demonstrating asymptotic instance‑optimality up to logarithmic factors, and validate the method on synthetic data and HelpSteer2 evaluations.
By Junghyun Lee, Sanghwa Kim, Yassir Jedra, Alexandre Prouti\`ere, Se-Young Yun
arXiv:2606. 30372v1 Announce Type: new Abstract: Quantitative research across the social and behavioral sciences depends on human subject experiments that are expensive, slow, and subject to sampling bias.
By Haobo Yang
arXiv:2512. 19905v3 Announce Type: replace-cross Abstract: Recent developments in large language models have shown advantages in reallocating a notable share of computational resource from training time to inference time.
By Indranil Halder, Cengiz Pehlevan
The paper introduces a variational inequality (VI) framework for estimating parameters in generalized linear models (GLMs), offering an alternative to the traditional maximum likelihood estimation (MLE). It provides finite‑sample error bounds, asymptotic normality, and convergence guarantees for both fixed‑point and stochastic approximation algorithms, and extends to generalized additive models (GAMs). Numerical experiments show that, within a fixed iteration budget, the VI method achieves comparable or better estimation accuracy and more stable, faster convergence than MLE, especially for GLMs and GAMs with non‑canonical or non‑smooth link functions.
By Linglingzhi Zhu, Jonghyeok Lee, Yao Xie
arXiv:2610. 28314v1 Announce Type: cross Abstract: Prior-data fitted networks (PFNs) have recently gained popularity as an end-to-end approach to amortized Bayesian inference.
By Valentyn Melnychuk, Emil Javurek, Stefan Feuerriegel
arXiv:2608. 08662v1 Announce Type: cross Abstract: The single-selection prophet inequality is a canonical Bayesian online selection problem in which independent nonnegative values arrive sequentially and the decision-maker must irrevocably select at most one.
By Patrick Loiseau, Mathieu Molina, Vianney Perchet, Sebastian Perez-Salazar, Victor Verdugo
arXiv:2610. 29425v1 Announce Type: new Abstract: Understanding generalization of randomized learning algorithms remains a central challenge.
By Mohammad Hossein Momeni Hamaneh, Mohammad Mahdi Mojahedian, Mohammad Hossein Yassaee
Minimax risk and regret are expectation-based criteria and do not capture rare but consequential failures. To address this concern, we develop a $δ$-explicit minimax-quantile theory for interactive statistical decision making (ISDM).
arXiv:2602. 16061v2 Announce Type: replace-cross Abstract: Estimating population quantities such as mean outcomes from user feedback is fundamental to platform evaluation and social science, yet feedback is often missing not at random (MNAR): users with stronger opinions are more likely to respond, so standard estimators are biased and the estimand is not identified without additional assumptions.
By Hongyu Chen, David Simchi-Levi, Ruoxuan Xiong
arXiv:2607. 11920v1 Announce Type: cross Abstract: Evaluating decisions made under uncertainty is hard when labeled outcomes are scarce, costly, or confounded with luck.
By Jeff Helzner
arXiv:2606. 11171v2 Announce Type: replace Abstract: We develop indexed Bellman information complexity, a representation-level theory of interactive decision making centered on information indices and reference histories.
By Yunbei Xu