The fact that machine learning models, despite their advancements, are still trained on randomly gathered data is proof that a lasting solution to the problem of optimal data gathering has not yet been found. In this paper, we investigate whether a Bayesian approach to the classification problem can provide assumptions under which one is guaranteed to perform at least as good as random sampling. For a logistic regression model, we show that maximal expected information gain on model parameters is a promising criterion for selecting samples, assuming that our classification model is well-matched to the data. Our derived criterion is closely related to the maximum model change. We experiment with data sets which satisfy this assumption to varying degrees to see how sensitive our performance is to the violation of our assumption in practice.
|Title of host publication||Proceedings of 2020 25th International Conference on Pattern Recognition|
|Publication status||Published - 2021|
|Event||25th International Conference on Pattern Recognition - Virtual event, Milano, Italy|
Duration: 10 Jan 2021 → 15 Jan 2021
|Conference||25th International Conference on Pattern Recognition|
|Period||10/01/2021 → 15/01/2021|