Can Evolutionary Sampling Improve Bagged Ensembles?
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Graph-Supported Dynamic Algorithm Configuration for Multi-Objective Combinatorial Optimization
Randomised Optimism via Competitive Co-Evolution for Matrix Games with Bandit Feedback
Benchmarking MOEAs for solving continuous multi-objective RL problems
Mergenetic: a Simple Evolutionary Model Merging Library
Evolutionary thoughts: integration of large language models and evolutionary algorithms
RainbowPlus: Enhancing Adversarial Prompt Generation via Evolutionary Quality-Diversity Search
토론
이 논문과 연결된 포럼 글이 아직 없습니다.