Decision-theoretic elicitation of generalized additive utilities
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In this thesis, we present a decision-theoretic framework for building decision support systems that incrementally elicit preferences of individual users over multiattribute outcomes and then provide recommendations based on the acquired preference information. By combining decision-theoretically sound modeling with effective computational techniques and certain user-centric considerations, we demonstrate the feasibility and potential of practical autonomous preference elicitation and recommendation systems. More concretely, we focus on decision scenarios in which a user can obtain any outcome from a finite set of available outcomes. The outcome is space is multiattribute; each outcome can be viewed as an instantiation of a set of attributes with finite domains. The user has preferences over outcomes that can be represented by a utility function. We assume that user preferences are generalized additively independent (GAI), and, therefore, can be represented by a GAI utility function. GAI utilities provide a flexible representation framework for structured preferences over multiattribute outcomes; they are less restrictive and, therefore, more widely applicable than additive utilities. In many decision scenarios with large and complex decision spaces (such as making travel plans or choosing an apartment to rent from thousands of available options), selecting the optimal decision can require a lot of time and effort on the part of the user. Since obtaining the user's complete utility function is generally infeasible, the decision support system has to support recommendation with partial preference information. We provide solutions for effective elicitation of GAI utilities in situations where a probabilistic prior about the user's utility function is available, and in situations where the system's uncertainty about user utilities is represented by maintaining a set of feasible user utilities. In the first case, we use Bayesian criteria for decision making and query selection. In the second case, recommendations (and query strategies) are based on the robust minimax regret criterion which recommends the outcome with the smallest maximum regret (with respect to all adversarial instantiations of feasible utility functions). Our proposed framework is implemented in the UTPref recommendation system that searches multiattribute product databases using the minimax regret criterion. UTPref is tested with a study involving 40 users interacting with the system. The study measures the effectiveness of regret-based elicitation, evaluates user comprehension and acceptance of minimax regret, and assesses the relative difficulty of different query types.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it