2019/06/28 by Henry B. Moss, Moss, Henry B., Andrew Moore +5 · 1 citation
Computer Science · Decision Sciences · Mathematics · #Advanced Bandit Algorithms Research #Computation and Language (cs.CL) #Data Stream Mining Techniques #FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Machine Learning and Data Classification #cs.CL #cs.LG #stat.ML
paper · pdf · doi:10.48550/arxiv.1906.12230
ACL 2019. Code available at: https://github.com/apmoore1/fiesta
arxiv created 2019/06/28 · openalex publication_date 2019/06/28 · arxiv updated 2019/07/01 · openalex created_date 2022/07/28 · openalex updated_date 2026/07/28
We present FIESTA, a model selection approach that significantly reduces the computational resources required to reliably identify state-of-the-art performance from large collections of candidate models. Despite being known to produce unreliable comparisons, it is still common practice to compare model evaluations based on single choices of random seeds. We show that reliable model selection also requires evaluations based on multiple train-test splits (contrary to common practice in many shared tasks). Using bandit theory from the statistics literature, we are able to adaptively determine appropriate numbers of data splits and random seeds used to evaluate each model, focusing computational resources on the evaluation of promising models whilst avoiding wasting evaluations on models with lower performance. Furthermore, our user-friendly Python implementation produces confidence guarantees of correctly selecting the optimal model. We evaluate our algorithms by selecting between 8 target-dependent sentiment analysis methods using dramatically fewer model evaluations than current model selection approaches.