Adaptive Querying with AI Persona Priors

• URL: http://arxiv.org/abs/2605.00696v1
• Date: Fri, 01 May 2026 14:34:25 GMT
• Title: Adaptive Querying with AI Persona Priors
• Abstract summary: We study adaptive querying for learning user-dependent quantities of interest.<n>We introduce a persona-induced latent variable model that represents a user's state through membership in a finite dictionary of AI personas.
• Score: 12.151167766756108
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study adaptive querying for learning user-dependent quantities of interest, such as responses to held-out items and psychometric indicators, within tight question budgets. Classical Bayesian design and computerized adaptive testing typically rely on restrictive parametric assumptions or expensive posterior approximations, limiting their use in heterogeneous, high-dimensional, and cold-start settings. We introduce a persona-induced latent variable model that represents a user's state through membership in a finite dictionary of AI personas, each offering response distributions produced by a large language model. This yields expressive priors with closed-form posterior updates and efficient finite-mixture predictions, enabling scalable Bayesian design for sequential item selection. Experiments on synthetic data and WorldValuesBench demonstrate that persona-based posteriors deliver accurate probabilistic predictions and an interpretable adaptive elicitation pipeline.

Related papers

• Learning Dynamic User Personas from Implicit Interaction Streams via Iterative Refinement [4.027292457517535]
  We propose IRIS, a framework that learns dynamic user personas directly from implicit interaction streams.<n>IRIS produces stable personas and distinguishes individual users while revealing limitations of memory-only approaches.<n>We validate IRIS on anonymized real-world Reddit r/AmItheAsshole (AITA) data, with personas built solely from each author's historical interactions.
  arXiv  Detail & Related papers  (2026-07-29T04:56:14Z)
• An efficient adaptive dimension selection algorithm for multidimensional probit graded response models [5.226600335299251]
  Multidimensional graded response models (MGRMs) are widely used for analyzing ordinal questionnaire data in psychological and educational assessments.<n>A central challenge in applying these models is determining the number of latent dimensions.<n>We develop an adaptive Bayesian dimension selection framework for probit MGRMs.
  arXiv  Detail & Related papers  (2026-07-20T08:06:47Z)
• Tabular Foundation Models for Discrete Choice Estimation [8.167439804974467]
  Tabular foundation models (TFMs) generate predictions on structured data via in-context learning, without task-specific estimation.<n>We ask whether TFMs can be effectively applied to discrete choice, a central demand estimation framework in marketing and operations.<n>We propose a reformulation that encodes both choice-set dependence and individual heterogeneity within a row-based learning framework.
  arXiv  Detail & Related papers  (2026-07-14T22:34:00Z)
• Self-Supervised Laplace Approximation for Bayesian Uncertainty Quantification [45.61685127984694]
  We quantify a Bayesian model's predictive uncertainty by refitting on self-predicted data.<n>The modular structure of our Self-Supervised Laplace Approximation (SSLA) allows us to plug in different prior specifications.<n>In order to bypass expensive refitting, we further introduce an approximate version of SSLA, called ASSLA.
  arXiv  Detail & Related papers  (2026-05-12T14:46:08Z)
• P-GenRM: Personalized Generative Reward Model with Test-time User-based Scaling [66.55381105691818]
  We propose P-GenRM, the first Personalized Generative Reward Model with test-time user-based scaling.<n>P-GenRM transforms preference signals into structured evaluation chains that derive adaptive personas and scoring rubrics.<n>It further clusters users into User Prototypes and introduces a dual-granularity scaling mechanism.
  arXiv  Detail & Related papers  (2026-02-12T16:07:22Z)
• EXACT: Explicit Attribute-Guided Decoding-Time Personalization [11.035465374731563]
  EXACT is a new decoding-time personalization that aligns generation with limited pairwise preference feedback.<n>We show that EXACT consistently outperforms strong baselines, including preference modeling accuracy and personalized generation quality.
  arXiv  Detail & Related papers  (2026-02-06T14:53:37Z)
• Conv4Rec: A 1-by-1 Convolutional AutoEncoder for User Profiling through Joint Analysis of Implicit and Explicit Feedbacks [35.7275102787435]
  We introduce a new convolutional AutoEncoder architecture for user modelling and recommendation tasks.<n>Our model is able to learn jointly from both the explicit ratings and the implicit information in the sampling pattern.<n>In experiments on several real-life datasets, we achieve state-of-the-art performance on both the implicit and explicit feedback prediction tasks.
  arXiv  Detail & Related papers  (2025-09-09T08:25:11Z)
• Hyperparameter Optimization via Interacting with Probabilistic Circuits [20.128718882698593]
  We develop a novel selection policy that enables an acquisition function-free generation of candidate points.<n>We demonstrate that our method achieves state-of-the-art performance in standard HPO and outperforms interactive BO baselines in interactive HPO.
  arXiv  Detail & Related papers  (2025-05-23T12:21:19Z)
• Quantifying predictive uncertainty of aphasia severity in stroke patients with sparse heteroscedastic Bayesian high-dimensional regression [47.1405366895538]
  Sparse linear regression methods for high-dimensional data commonly assume that residuals have constant variance, which can be violated in practice. This paper proposes estimating high-dimensional heteroscedastic linear regression models using a heteroscedastic partitioned empirical Bayes Expectation Conditional Maximization algorithm.
  arXiv  Detail & Related papers  (2023-09-15T22:06:29Z)
• Variational Inference with Coverage Guarantees in Simulation-Based Inference [18.818573945984873]
  We propose Conformalized Amortized Neural Variational Inference (CANVI) CANVI constructs conformalized predictors based on each candidate, compares the predictors using a metric known as predictive efficiency, and returns the most efficient predictor. We prove lower bounds on the predictive efficiency of the regions produced by CANVI and explore how the quality of a posterior approximation relates to the predictive efficiency of prediction regions based on that approximation.
  arXiv  Detail & Related papers  (2023-05-23T17:24:04Z)
• Prediction-Oriented Bayesian Active Learning [51.426960808684655]
  Expected predictive information gain (EPIG) is an acquisition function that measures information gain in the space of predictions rather than parameters. EPIG leads to stronger predictive performance compared with BALD across a range of datasets and models.
  arXiv  Detail & Related papers  (2023-04-17T10:59:57Z)
• ASPEST: Bridging the Gap Between Active Learning and Selective Prediction [56.001808843574395]
  Selective prediction aims to learn a reliable model that abstains from making predictions when uncertain. Active learning aims to lower the overall labeling effort, and hence human dependence, by querying the most informative examples. In this work, we introduce a new learning paradigm, active selective prediction, which aims to query more informative samples from the shifted target domain.
  arXiv  Detail & Related papers  (2023-04-07T23:51:07Z)
• Improving Adaptive Conformal Prediction Using Self-Supervised Learning [72.2614468437919]
  We train an auxiliary model with a self-supervised pretext task on top of an existing predictive model and use the self-supervised error as an additional feature to estimate nonconformity scores. We empirically demonstrate the benefit of the additional information using both synthetic and real data on the efficiency (width), deficit, and excess of conformal prediction intervals.
  arXiv  Detail & Related papers  (2023-02-23T18:57:14Z)
• HyperImpute: Generalized Iterative Imputation with Automatic Model Selection [77.86861638371926]
  We propose a generalized iterative imputation framework for adaptively and automatically configuring column-wise models. We provide a concrete implementation with out-of-the-box learners, simulators, and interfaces.
  arXiv  Detail & Related papers  (2022-06-15T19:10:35Z)
• Generating diverse and natural text-to-speech samples using a quantized fine-grained VAE and auto-regressive prosody prior [53.69310441063162]
  This paper proposes a sequential prior in a discrete latent space which can generate more naturally sounding samples. We evaluate the approach using listening tests, objective metrics of automatic speech recognition (ASR) performance, and measurements of prosody attributes.
  arXiv  Detail & Related papers  (2020-02-06T12:35:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.