mlsanityData to 7 Oct 2026

Knowledge Elicitation via Sequential Probabilistic Inference for High-Dimensional Prediction

arXiv 1612.03328 ↗First posted 10 Dec 2016cs.AI cs.HC cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

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 precision medicine, where obtaining additional samples 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 values of the regression coefficients or about the relevance of the features, 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 our method in experiments with simulated and real users show improved prediction accuracy already with a small effort from the expert.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 10 Dec 2016.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 2; 2022: 1; 2023: 1; 2024: 1.

5 papers.