mlsanityData to 7 Oct 2026

Model Uncertainty based Active Learning on Tabular Data using Boosted Trees

arXiv 2310.19573 ↗First posted 30 Oct 2023cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Supervised machine learning relies on the availability of good labelled data for model training. Labelled data is acquired by human annotation, which is a cumbersome and costly process, often requiring subject matter experts. Active learning is a sub-field of machine learning which helps in obtaining the labelled data efficiently by selecting the most valuable data instances for model training and querying the labels only for those instances from the human annotator. Recently, a lot of research has been done in the field of active learning, especially for deep neural network based models. Although deep learning shines when dealing with imagetextualmultimodal data, gradient boosting methods still tend to achieve much better results on tabular data. In this work, we explore active learning for tabular data using boosted trees. Uncertainty based sampling in active learning is the most commonly used querying strategy, wherein the labels of those instances are sequentially queried for which the current model prediction is maximally uncertain. Entropy is often the choice for measuring uncertainty. However, entropy is not exactly a measure of model uncertainty. Although there has been a lot of work in deep learning for measuring model uncertainty and employing it in active learning, it is yet to be explored for non-neural network models. To this end, we explore the effectiveness of boosted trees based model uncertainty methods in active learning. Leveraging this model uncertainty, we propose an uncertainty based sampling in active learning for regression tasks on tabular data. Additionally, we also propose a novel cost-effective active learning method for regression tasks along with an improved cost-effective active learning method for classification tasks.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 22 of its 53 references that are in the map. First posted on arXiv 30 Oct 2023.

Builds on

22 of 53 references.

References · 22

  1. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
  2. 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,416
  3. 2017What Uncertainties Do We Need in Bayesian Deep Learning for Computer Vision?cited by 2,335
  4. 2019Aleatoric and Epistemic Uncertainty in Machine Learning: An Introduction to Concepts and Methodscited by 903
  5. 2017Deep Bayesian Active Learning with Image Datacited by 812
  6. 2019TabNet: Attentive Interpretable Tabular Learningcited by 640
  7. 2020A Survey of Deep Active Learningcited by 547
  8. 2021Tabular Data: Deep Learning is Not All You Needcited by 530
  9. 2019BatchBALD: Efficient and Diverse Batch Acquisition for Deep Bayesian Active Learningcited by 428
  10. 2017Cost-Effective Active Learning for Deep Image Classificationcited by 165
  11. 2015Bayesian Convolutional Neural Networks with Bernoulli Approximate Variational Inferencecited by 159
  12. 2019NGBoost: Natural Gradient Boosting for Probabilistic Predictioncited by 94
10 more
  1. 2018Practical Obstacles to Deploying Active Learningcited by 68
  2. 2020Uncertainty in Gradient Boosting via Ensemblescited by 56
  3. 2022A Framework and Benchmark for Deep Batch Active Learning for Regressioncited by 47
  4. 2020Aleatoric and Epistemic Uncertainty with Random Forestscited by 42
  5. 2018Active Learning for Regression Using Greedy Samplingcited by 26
  6. 2018Dropout-based Active Learning for Regressioncited by 24
  7. 2019Epistemic Uncertainty Samplingcited by 24
  8. 2021A Survey on Epistemic (Model) Uncertainty in Supervised Learning: Recent Advances and Applicationscited by 24
  9. 2022Instance-Based Uncertainty Estimation for Gradient-Boosted Regression Treescited by 9
  10. 2019The Practical Challenges of Active Learning: Lessons Learned from Live Experimentationcited by 3

Built on by

Not cited yet.