Fisher Random Walk: Automatic Debiasing Contextual Preference Inference for Large Language Model Evaluation
Motivated by the need for rigorous and scalable evaluation of large language models, we study contextual preference inference for pairwise comparison functionals of context-dependent preference score functions across domains. Focusing on the contextual Bradley-Terry-Luce model, we develop a semiparametric efficient estimator that automates the debiased estimation through aggregating weighted residual balancing terms across the comparison graph. We show that the efficiency is achieved when the weights are derived from a novel strategy called Fisher random walk. We also propose a computationally feasible method to compute the weights by a potential representation of nuisance weight functions. We show our inference procedure is valid for general score function estimators accommodating the practitioners' need to implement flexible deep learning methods. We extend the procedure to multiple hypothesis testing using a Gaussian multiplier bootstrap that controls familywise error and to distributional shift via a cross-fitted importance-sampling adjustment for target-domain inference. Numerical studies, including language model evaluations under diverse contexts, corroborate the accuracy, efficiency, and practical utility of our method.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Residual2Vec: Debiasing graph embedding with random graphs
Graph embedding maps a graph into a convenient vector-space representation for graph analysis and machine learning applications. Many graph embedding methods hinge on a sampling of context nodes based on random walks. Ho…
Graph EmbeddingGraph Representation LearningLink PredictionRepresentation LearningCausal Walk: Debiasing Multi-Hop Fact Verification with Front-Door Adjustment
Conventional multi-hop fact verification models are prone to rely on spurious correlations from the annotation artifacts, leading to an obvious performance decline on unbiased datasets. Among the various debiasing works,…
Causal InferencecounterfactualCounterfactual ReasoningFact Verification+2Information Geometry of Absorbing Markov-Chain and Discriminative Random Walks
Discriminative Random Walks (DRWs) are a simple yet powerful tool for semi-supervised node classification, but their theoretical foundations remain fragmentary. We revisit DRWs through the lens of information geometry, t…
Node ClassificationSocial Text Normalization using Contextual Graph Random Walks
RieszNet and ForestRiesz: Automatic Debiased Machine Learning with Neural Nets and Random Forests
Many causal and policy effects of interest are defined by linear functionals of high-dimensional or non-parametric regression functions. $\sqrt{n}$-consistent and asymptotically normal estimation of the object of interes…
BIG-bench Machine LearningModel Selectionregression