Many decision-support systems recommend actions by optimizing measurable objectives, even when a human decision-maker retains final authority and considers additional criteria that are difficult to specify in advance. We study how an algorithm should curate a small portfolio of quantitatively strong alternatives in such settings. We introduce generative curation, a framework that learns a recommendation policy to maximize the expected desirability of the action ultimately selected by the decision-maker. For policies that generate quantitatively competitive actions, we decompose expected portfolio desirability into quantitative performance and a qualitative curation gain. Under a Gaussian process model of residual desirability, this gain is characterized by the Gaussian width induced by the covariance kernel, yielding a decision-theoretic notion of diversity based on qualitative nonredundancy rather than generic geometric separation. We establish diminishing returns to portfolio size and characterize regimes in which optimal policies are balanced, endpoint-concentrated, or space-filling. We develop neural generative and sequential optimization approaches applicable to continuous and combinatorial action spaces. Controlled synthetic experiments demonstrate substantial regret reductions relative to optimization- and distance-based benchmarks, while an Atlanta police redistricting case study illustrates the framework's applicability to a complex operational planning problem.
Balancing Optimality and Diversity: Human-Centered Decision Making through Generative Curation
Many decision-support systems recommend actions by optimizing measurable objectives, even when a human decision-maker retains final authority and considers additional criteria that are difficult to specify in advance.
- Year
- 2024
- Hosting
- Abstract onlyARXIV-DEFAULT
Cite
Notes
Only stored in your browser.
Attribution
- Abstract & full text
- arxiv.org/abs/2409.11535ARXIV-DEFAULT
- TL;DR
- Semantic Scholar