A Bandit Approach With Evolutionary Operators For Model Selection

# A Bandit Approach with Evolutionary Operators for Model Selection

**arXiv ID:** 2402.05144
**Authors:** Margaux Brégère, Julie Keisler
**Published:** 2024-02-07T08:01:45Z
**Abstract:**
This work formulates model selection as an infinite-armed bandit problem, namely, a problem in which a decision maker iteratively selects one of an infinite number of fixed choices (i.e., arms) when the properties of each choice are only partially known at the time of allocation and may become better understood over time, via the attainment of rewards.Here, the arms are machine learning models to train and selecting an arm corresponds to a partial training of the model (resource allocation).The reward is the accuracy of the selected model after its partial training.We aim to identify the best model at the end of a finite number of resource allocations and thus consider the best arm identification setup. We propose the algorithm Mutant-UCB that incorporates operators from evolutionary algorithms into the UCB-E (Upper Confidence Bound Exploration) bandit algorithm introduced by Audiber et al.Tests carried out on three open source image classification data sets attest to the relevance of this novel combining approach, which outperforms the state-of-the-art for a fixed budget.

## Skill Description

This skill is generated from the arXiv paper: A Bandit Approach with Evolutionary Operators for Model Selection (2402.05144).

## How to Use

[To be filled in by the user or by future automation]

## References

- [arXiv:2402.05144](http://arxiv.org/abs/2402.05144v2)