Reliability depends on the geometry of the pair.
The model uses heteroskedastic noise tied to distances between the user and each candidate, naturally discouraging comparisons that are too close or too far apart.
Learning from Preferences · Active learning · Query synthesis
Generate pairwise comparisons that are both informative and easier to answer, without exhaustively scoring a large query pool.
assets/fig-framework.png01 / Motivation
Standard pairwise comparison response models can treat every comparison as equally reliable. In practice, near identical options are difficult to distinguish, while highly dissimilar options may lack a meaningful common ground for comparison.
assets/fig-query-confidence-1.png
assets/fig-query-confidence-2.png
assets/fig-query-confidence-3.png02 / Method
The framework localizes an unknown preference vector with Bayesian updates and chooses the next pair by maximizing mutual information.
The model uses heteroskedastic noise tied to distances between the user and each candidate, naturally discouraging comparisons that are too close or too far apart.
Lower dimensional datasets
A Hessian induced Mahalanobis metric filters candidate pairs before mutual information refinement.
Higher dimensional datasets
An optimality based surrogate filters candidate pairs by midpoint, direction and distance deviations, avoiding the expensive Hessian.
The optimal query midpoint lies at the current posterior mean, ensuring equi-probability of the response outcomes.
The pair is oriented along the principal eigenvector of the posterior covariance; its distance follows from a one-dimensional optimization.
03 / Evaluation
The evaluation spans a user study, synthetic preference learning, a fixed text summary dataset, and continuous controller tuning.
A color estimation study tests whether the confidence aware model better captures how people answer pairwise comparison queries.

assets/fig-user-study-1.png
assets/fig-user-study-2.pngPair approximation is evaluated in a high dimensional embedding space under a fixed pool of allowable summary comparisons.

assets/fig-text-1.png
assets/fig-text-2.pngContinuous synthesis and approximation is evaluated in a low dimensional setting.

assets/fig-synthetic.pngContinuous query synthesis selects pairs of controller gains for subjective trajectory-quality comparisons.

assets/fig-robot.png04 / Takeaway
Effective preference queries should be informative about the user while avoiding comparisons that are too similar or too dissimilar to answer reliably.
05 / Citation
@article{nadagouda2026active,
title = {Active Query Synthesis for Preference Learning},
author = {Nadagouda, Namrata and Ahad, Nauman and
Tucker, Maegan and Davenport, Mark A.},
journal = {arXiv preprint arXiv:2605.26072},
year = {2026}
}