In-Person Poster presentation / poster accept
PASHA: Efficient HPO and NAS with Progressive Resource Allocation
Ondrej Bohdal · Lukas Balles · Martin Wistuba · Beyza Ermis · Cedric Archambeau · Giovanni Zappella
MH1-2-3-4 #87
Keywords: [ COST ] [ neural architecture search ] [ Computational efficiency ] [ Large datasets ] [ hyperparameter optimization ] [ General Machine Learning ]
Hyperparameter optimization (HPO) and neural architecture search (NAS) are methods of choice to obtain the best-in-class machine learning models, but in practice they can be costly to run. When models are trained on large datasets, tuning them with HPO or NAS rapidly becomes prohibitively expensive for practitioners, even when efficient multi-fidelity methods are employed. We propose an approach to tackle the challenge of tuning machine learning models trained on large datasets with limited computational resources. Our approach, named PASHA, extends ASHA and is able to dynamically allocate maximum resources for the tuning procedure depending on the need. The experimental comparison shows that PASHA identifies well-performing hyperparameter configurations and architectures while consuming significantly fewer computational resources than ASHA.