Pith

open record

sign in
Browse

arxiv: 1810.05934 · v5 · pith:BBHKOZCJ · submitted 2018-10-13 · cs.LG · stat.ML

A System for Massively Parallel Hyperparameter Tuning

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 reserved pith:BBHKOZCJrecord.jsonopen to challenge →

classification cs.LG stat.ML
keywords hyperparameteroptimizationashalearningcomputingdistributedmachineparallel
0
0 comments X
read the original abstract

Modern learning models are characterized by large hyperparameter spaces and long training times. These properties, coupled with the rise of parallel computing and the growing demand to productionize machine learning workloads, motivate the need to develop mature hyperparameter optimization functionality in distributed computing settings. We address this challenge by first introducing a simple and robust hyperparameter optimization algorithm called ASHA, which exploits parallelism and aggressive early-stopping to tackle large-scale hyperparameter optimization problems. Our extensive empirical results show that ASHA outperforms existing state-of-the-art hyperparameter optimization methods; scales linearly with the number of workers in distributed settings; and is suitable for massive parallelism, as demonstrated on a task with 500 workers. We then describe several design decisions we encountered, along with our associated solutions, when integrating ASHA in Determined AI's end-to-end production-quality machine learning system that offers hyperparameter tuning as a service.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. A Systematic Evaluation of Molecular Mixture Behavior Prediction

    cs.LG 2026-05 unverdicted novelty 7.0

    Strong absolute accuracy on mixture properties often masks poor recovery of non-ideal behavior, with large drops under strict molecule splits, making transfer to unseen molecules the central challenge.

  2. QuickScope: Certifying Hard Questions in Dynamic LLM Benchmarks

    cs.CL 2026-04 unverdicted novelty 6.0

    QuickScope uses modified COUP Bayesian optimization to find truly difficult questions in dynamic LLM benchmarks more sample-efficiently than baselines while cutting false positives.

  3. Unveiling Hidden Lyman Alpha Emitters in the DESI DR1 Data

    astro-ph.GA 2026-05 unverdicted novelty 5.0

    A CNN detects 19,685 LAEs at z=2-3.5 in DESI DR1 spectra with 95% purity and completeness.

  4. Quantifying the Carbon Emissions of Machine Learning

    cs.CY 2019-10 unverdicted novelty 5.0

    Presents a calculator tool for estimating carbon emissions from ML model training along with mitigation actions.

  5. Staged Factorial Screening for Budget-Constrained Micro-Pretraining

    cs.LG 2026-04 unverdicted novelty 3.0

    Staged factorial screening recovers stable early penalties from total batch, depth, and width in 2-10 minute pretraining runs and supports a bridge-centered recommendation through 24-hour continuations on two hosts.