Uncovering Coresets for Classification With Multi-Objective Evolutionary Algorithms
A coreset is a subset of the training set, using which a machine learning algorithm obtains performances similar to what it would deliver if trained over the whole original data. Coreset discovery is an active and open line of research as it allows improving training speed for the algorithms and may help human understanding the results. Building on previous works, a novel approach is presented: candidate corsets are iteratively optimized, adding and removing samples. As there is an obvious trade-off between limiting training size and quality of the results, a multi-objective evolutionary algorithm is used to minimize simultaneously the number of points in the set and the classification error. Experimental results on non-trivial benchmarks show that the proposed approach is able to deliver results that allow a classifier to obtain lower error and better ability of generalizing on unseen data than state-of-the-art coreset discovery techniques.
Code (1)
Tasks
ClassificationCore set discoveryEvolutionary AlgorithmsGeneral ClassificationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Simple Weak Coresets for Non-Decomposable Classification Measures
While coresets have been growing in terms of their application, barring few exceptions, they have mostly been limited to unsupervised settings. We consider supervised classification problems, and non-decomposable evaluat…
ClassificationNo Dimensional Sampling Coresets for Classification
We refine and generalize what is known about coresets for classification problems via the sensitivity sampling framework. Such coresets seek the smallest possible subsets of input data, so one can optimize a loss functio…
ClassificationSensitivityCoresets for Regressions with Panel Data
This paper introduces the problem of coresets for regression problems to panel data settings. We first define coresets for several variants of regression problems with panel data and then present efficient algorithms to …
regressionA Survey of Decomposition-Based Evolutionary Multi-Objective Optimization: Part II -- A Data Science Perspective
This paper presents the second part of the two-part survey series on decomposition-based evolutionary multi-objective optimization where we mainly focus on discussing the literature related to multi-objective evolutionar…
AnatomyDescriptiveEvolutionary AlgorithmsPreselection via Classification: A Case Study on Evolutionary Multiobjective Optimization
In evolutionary algorithms, a preselection operator aims to select the promising offspring solutions from a candidate offspring set. It is usually based on the estimated or real objective values of the candidate offsprin…
ClassificationEvolutionary AlgorithmsGeneral ClassificationMultiobjective Optimization