Can Evolutionary Sampling Improve Bagged Ensembles?
Harsh Nisar, Bhanu Pratap Singh Rawat

TL;DR
This paper introduces Evolutionary Sampling, a novel approach that uses evolutionary algorithms to improve bagged ensembles by intelligently sampling features and training data, aiming to enhance predictive accuracy.
Contribution
It proposes a new family of Perturb and Combine methods called Evolutionary Sampling, utilizing evolutionary algorithms for smarter sampling in features and training data.
Findings
Empirical comparison shows improved ensemble performance.
Evolutionary Sampling outperforms randomized sampling methods.
Multiple fitness functions effectively assess ensemble quality.
Abstract
Perturb and Combine (P&C) group of methods generate multiple versions of the predictor by perturbing the training set or construction and then combining them into a single predictor (Breiman, 1996b). The motive is to improve the accuracy in unstable classification and regression methods. One of the most well known method in this group is Bagging. Arcing or Adaptive Resampling and Combining methods like AdaBoost are smarter variants of P&C methods. In this extended abstract, we lay the groundwork for a new family of methods under the P&C umbrella, known as Evolutionary Sampling (ES). We employ Evolutionary algorithms to suggest smarter sampling in both the feature space (sub-spaces) as well as training samples. We discuss multiple fitness functions to assess ensembles and empirically compare our performance against randomized sampling of training data and feature sub-spaces.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsEvolutionary Algorithms and Applications · Metaheuristic Optimization Algorithms Research · Data Stream Mining Techniques
