Knowledge elicitation via sequential probabilistic inference for high-dimensional prediction

Loading...
Thumbnail Image

Access rights

openAccess

URL

Journal Title

Journal ISSN

Volume Title

A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä

Date

2017-07-12

Major/Subject

Mcode

Degree programme

Language

en

Pages

22
1-22

Series

Machine Learning

Abstract

Prediction in a small-sized sample with a large number of covariates, the “small n, large p” problem, is challenging. This setting is encountered in multiple applications, such as in precision medicine, where obtaining additional data can be extremely costly or even impossible, and extensive research effort has recently been dedicated to finding principled solutions for accurate prediction. However, a valuable source of additional information, domain experts, has not yet been efficiently exploited. We formulate knowledge elicitation generally as a probabilistic inference process, where expert knowledge is sequentially queried to improve predictions. In the specific case of sparse linear regression, where we assume the expert has knowledge about the relevance of the covariates, or of values of the regression coefficients, we propose an algorithm and computational approximation for fast and efficient interaction, which sequentially identifies the most informative features on which to query expert knowledge. Evaluations of the proposed method in experiments with simulated and real users show improved prediction accuracy already with a small effort from the expert.

Description

Keywords

Bayesian methods, Experimental design, Human-to-machine transfer learning, Interactive machine learning, Statistics in high dimensions

Other note

Citation

Daee, P, Peltola, T, Soare, M & Kaski, S 2017, ' Knowledge elicitation via sequential probabilistic inference for high-dimensional prediction ', Machine Learning, vol. 106, no. 9, pp. 1599-1620 . https://doi.org/10.1007/s10994-017-5651-7