Thompson sampling based active learning in probabilistic programs with application to travel time estimation

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The pertinent problem of Traveling Time Estimation (TTE) is to estimate the travel time, given a start location and a destination, solely based on the coordinates of the points under consideration. This is typically solved by fitting a function based on a sequence of observations. However, it can be expensive or slow to obtain labeled data or measurements to calibrate the estimation function. Active Learning tries to alleviate this problem by actively selecting samples that minimize the total number of samples needed to do accurate inference. Probabilistic Programming Languages (PPL) give us the opportunities to apply powerful Bayesian inference to model problems that involve uncertainties. In this paper we combine Thompson Sampling with Probabilistic Programming to perform Active Learning in the Travel Time Estimation setting, outperforming traditional active learning methods.

Cite

CITATION STYLE

APA

Glimsdal, S., & Granmo, O. C. (2019). Thompson sampling based active learning in probabilistic programs with application to travel time estimation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11606 LNAI, pp. 71–78). Springer Verlag. https://doi.org/10.1007/978-3-030-22999-3_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free