Rapid Selection of Machine Learning Models Using Greedy Cross Validation

dc.contributor.authorSoper, Daniel
dc.date.accessioned2021-12-24T18:28:43Z
dc.date.available2021-12-24T18:28:43Z
dc.date.issued2022-01-04
dc.description.abstractThis paper introduces a greedy method of performing k-fold cross validation and shows how the proposed greedy method can be used to rapidly identify optimal or near-optimal machine learning (ML) models. Although many methods have been proposed that apply metaheuristic and other search methods to the hyperparameter space as a means of accelerating ML model selection, the cross-validation process itself has been overlooked as a means of rapidly identifying optimal ML models. The current study remedies this oversight by describing a simple, greedy cross validation algorithm and demonstrating that even in its simplest form, the greedy cross validation method can vastly reduce the average time required to identify an optimal or near-optimal ML model within a large set of candidate models. This substantially reduced search time is shown to hold across a variety of different ML algorithms and real-world datasets.
dc.format.extent10 pages
dc.identifier.doi10.24251/HICSS.2022.903
dc.identifier.isbn978-0-9981331-5-7
dc.identifier.urihttp://hdl.handle.net/10125/80245
dc.language.isoeng
dc.relation.ispartofProceedings of the 55th Hawaii International Conference on System Sciences
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 International
dc.rights.urihttps://creativecommons.org/licenses/by-nc-nd/4.0/
dc.subjectComputational Intelligence and State-of-the-Art Data Analytics
dc.subjectgreedy cross validation
dc.subjecthyperparameter optimization
dc.subjectmachine learning
dc.subjectmodel selection
dc.titleRapid Selection of Machine Learning Models Using Greedy Cross Validation
dc.type.dcmitext

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
0734.pdf
Size:
809.29 KB
Format:
Adobe Portable Document Format