arXiv Machine Learning By Kosuke Iguchi, Ren Kishimoto

Adaptive Doubly Robust Off-Policy Evaluation for Ranking Policies under Diverse User Behavior

Read the original on arXiv Machine Learning →

The paper introduces Adaptive Doubly Robust (ADR), an off‑policy evaluation method for ranking policies that blends adaptive importance weighting with reward regression to reduce variance. ADR is unbiased when the true user behavior model is known and, under a sufficient condition, achieves lower variance than the prior Adaptive Inverse Propensity Scoring (AIPS) approach. Experiments on synthetic data show that ADR consistently improves mean squared error over AIPS and other ranking OPE estimators across various data sizes and ranking lengths.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
6d ago

Prediction-Powered LLM Ranking with Adaptively Collected Human Feedback

The paper introduces Prediction-Powered Ranking (PP‑Rank), a framework that blends large language model (LLM) judge predictions with limited human feedback to rank LLMs more precisely while maintaining valid inference under adaptive sampling. PP‑Rank uses data‑driven prediction weights to minimize asymptotic covariance, establishes asymptotic normality for general evaluation targets, and provides a rule for reducing exploration that balances cost and variance. Experiments on UltraFeedback‑Extended and synthetic data show that PP‑Rank improves score estimation, narrows confidence intervals, certifies rankings, and can cut evaluation costs without losing precision.

By Gabriel Sargent, Will Wei Sun, Zhengwu Zhang, Yufeng Liu
arXiv Machine Learning
Oct 8

Efficient Best-of-N policy evaluation for inference-time alignment

The paper introduces a sample‑only framework for evaluating and selecting Best‑of‑N (BoN) inference‑time alignment policies without needing response likelihoods. By exploiting the order‑statistic structure of BoN, the authors express required density ratios through score‑rank probabilities that can be estimated from samples alone, and develop a doubly robust estimator (BoN‑DR) that reuses a shared auxiliary sample pool across candidate budgets. The method provides valid asymptotic inference even with reward estimator misspecification, proves efficiency, and offers two selection rules—maximizing estimated policy value or a lower confidence bound—to avoid over‑optimization and guarantee no harm, as demonstrated on synthetic data and GSM8K.

By Jonas Schweisthal, Yuxin Wang, Athiya Deviyani, Stefan Feuerriegel, Dennis Frauen