Bayesian active learning for choice models with deep Gaussian processes
Not on the map. Why?
Abstract (arXiv)
In this paper, we propose an active learning algorithm and models which can gradually learn individual's preference through pairwise comparisons. The active learning scheme aims at finding individual's most preferred choice with minimized number of pairwise comparisons. The pairwise comparisons are encoded into probabilistic models based on assumptions of choice models and deep Gaussian processes. The next-to-compare decision is determined by a novel acquisition function. We benchmark the proposed algorithm and models using functions with multiple local optima and one public airline itinerary dataset. The experiments indicate the effectiveness of our active learning algorithm and models.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 4 May 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1.
1 paper.
- 2021A Sparse Expansion For Deep Gaussian Processescited by 5
- 2021A Sparse Expansion For Deep Gaussian Processes11 Dec 2021