Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2104.10746 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917581526401024 |
|---|---|
| author | Cironis, Lukas Palczewski, Jan Aivaliotis, Georgios |
| author_facet | Cironis, Lukas Palczewski, Jan Aivaliotis, Georgios |
| contents | We develop a hyperparameter optimisation algorithm, Automated Budget Constrained Training (AutoBCT), which balances the quality of a model with the computational cost required to tune it. The relationship between hyperparameters, model quality and computational cost must be learnt and this learning is incorporated directly into the optimisation problem. At each training epoch, the algorithm decides whether to terminate or continue training, and, in the latter case, what values of hyperparameters to use. This decision weighs optimally potential improvements in the quality with the additional training time and the uncertainty about the learnt quantities. The performance of our algorithm is verified on a number of machine learning problems encompassing random forests and neural networks. Our approach is rooted in the theory of Markov decision processes with partial information and we develop a numerical method to compute the value function and an optimal strategy. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2104_10746 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Automatic model training under restrictive time constraints Cironis, Lukas Palczewski, Jan Aivaliotis, Georgios Machine Learning 93E35, 93E24 We develop a hyperparameter optimisation algorithm, Automated Budget Constrained Training (AutoBCT), which balances the quality of a model with the computational cost required to tune it. The relationship between hyperparameters, model quality and computational cost must be learnt and this learning is incorporated directly into the optimisation problem. At each training epoch, the algorithm decides whether to terminate or continue training, and, in the latter case, what values of hyperparameters to use. This decision weighs optimally potential improvements in the quality with the additional training time and the uncertainty about the learnt quantities. The performance of our algorithm is verified on a number of machine learning problems encompassing random forests and neural networks. Our approach is rooted in the theory of Markov decision processes with partial information and we develop a numerical method to compute the value function and an optimal strategy. |
| title | Automatic model training under restrictive time constraints |
| topic | Machine Learning 93E35, 93E24 |
| url | https://arxiv.org/abs/2104.10746 |