Cited by 67Machine Learning and Data ClassificationParallel Computing and Optimization TechniquesAdvanced Neural Network Applications

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

HyperPower: Power- and memory-constrained hyper-parameter optimization for neural networks

Open access
Stamoulis, Dimitrios, Cai, Ermao, Juan, Da-Cheng, Marculescu, Diana·2018·2018 Design, Automation & Test in Europe Conference & Exhibition (DATE)

Abstract

While selecting the hyper-parameters of Neural Networks (NNs) has been so far treated as an art, the emergence of more complex, deeper architectures poses increasingly more challenges to designers and Machine Learning (ML) practitioners, especially when power and memory constraints need to be considered. In this work, we propose HyperPower, a framework that enables efficient Bayesian optimization and random search in the context of power- and memory-constrained hyperparameter optimization for NNs running on a given hardware platform. HyperPower is the first work (i) to show that power consumption can be used as a low-cost, a priori known constraint, and (ii) to propose predictive models for the power and memory of NNs executing on GPUs. Thanks to HyperPower, the number of function evaluations and the best test error achieved by a constraint-unaware method are reached up to 112.99× and 30.12× faster, respectively, while never considering invalid configurations. HyperPower significantly speeds up the hyper-parameter optimization, achieving up to 57.20× more function evaluations compared to constraint-unaware methods for a given time interval, effectively yielding significant accuracy improvements by up to 67.6%.

Overview

Integrity signals

Registry

Crossref · 10.23919/date.2018.8341973

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Energy efficiency of inference in deep neural networks is an active area of research with methods such as quantization aware training, energy-aware pruning, and power- and memory-constrained hyperparameter optimization like HyperPower.

    “Energy efficiency of inference in deep neural networks (DNNs) is also an active area of research with methods such as quantization aware training, energy-aware pruning (Yang et al., 2017), and power- and memory-constrained hyperparameter optimization like HyperPower (Stamoulis et al., 2018).”

Citations

Cites

Flagged first, then by citations

Research works printed but not linked: 17

  1. cai, 2017, Neuralpower Predict and deploy energy-efficient convolutional neural networks
  2. 10.1145/2934583.2934641 · DOI
  3. 10.1145/2966986.2967039 · DOI
  4. 10.1145/2742060.2742079 · DOI
  5. hernández-lobato, 2016, A general framework for constrained bayesian optimization using information-based search, JMLR
  6. hernandez-lobato, 2016, Designing neural network hardware accelerators with decoupled objective evaluations, NIPS
  7. 10.1109/ISLPED.2017.8009208 · DOI
  8. gramacy, 2010, Optimization under unknown constraints
  9. domhan, 2015, Speeding up automatic hyperparameter optimization of deep neural networks by extrapolation of learning curves, IJCAI, 3460
  10. jia, 2014, Caffe Convolutional Architecture for Fast Feature Embedding
  11. gelbart, 2014, Bayesian Optimization with Unknown Constraints
  12. bergstra, 2012, Random search for hyper-parameter optimization, JMLR, 13, 281
  13. 10.1145/2966986.2967058 · DOI
  14. 10.1145/2934583.2934599 · DOI
  15. swersky, 2013, Multi-task bayesian optimization, NIPS, 2004
  16. 10.1109/JPROC.2015.2494218 · DOI
  17. han, 2015, Learning both weights and connections for efficient neural network, NIPS

Cited by

Sorted by citations

Metadata

Authors
Stamoulis, D., Cai, E., Juan, D.-C., & Marculescu, D.
Affiliations
  • Carnegie Mellon University (US)
  • Google (United States) (US)
Venue
2018 Design, Automation & Test in Europe Conference & Exhibition (DATE)
Publisher
IEEE
Published
2018-03
Pages
19-24
OpenAlex
W2772857490
Cited by
67
References
1
Citations by year
2026: 1 · 2025: 5 · 2024: 7 · 2023: 9 · 2022: 7 · 2021: 11 · 2020: 18 · 2019: 6 · 2018: 3
FWCI
3.88
Type
conference paper
Language
en
Open access
Locations
  • Design, Automation, and Test in Europe (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • National Science Foundation (1564022)
  • Canadian Institute for Advanced Research
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
  • Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Neural Network Applications
Keywords
hyperparameter optimization, artificial neural networks, power constraints, memory constraints, Bayesian optimization, random search, hardware-aware optimization, energy-efficient machine learning

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review