Scalable-effort classifiers for energy-efficient machine learning
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
Supervised machine-learning algorithms are used to solve classification problems across the entire spectrum of computing platforms, from data centers to wearable devices, and place significant demand on their computational capabilities. In this paper, we propose scalable-effort classifiers, a new approach to optimizing the energy efficiency of supervised machine-learning classifiers. We observe that the inherent classification difficulty varies widely across inputs in real-world datasets; only a small fraction of the inputs truly require the full computational effort of the classifier, while the large majority can be classified correctly with very low effort. Yet, state-of-the-art classification algorithms expend equal effort on all inputs, irrespective of their difficulty. To address this inefficiency, we introduce the concept of scalable-effort classifiers, or classifiers that dynamically adjust their computational effort depending on the difficulty of the input data, while maintaining the same level of accuracy. Scalable effort classifiers are constructed by utilizing a chain of classifiers with increasing levels of complexity (and accuracy). Scalable effort execution is achieved by modulating the number of stages used for classifying a given input. Every stage in the chain contains an ensemble of biased classifiers, where each biased classifier is trained to detect a single class more accurately. The degree of consensus between the biased classifiers' outputs is used to decide whether classification can be terminated at the current stage or not. Our methodology thus allows us to transform any given classification algorithm into a scalable-effort chain. We build scalable-effort versions of 8 popular recognition applications using 3 different classification algorithms. Our experiments demonstrate that scalable-effort classifiers yield 2.79x reduction in average operations per input, which translates to 2.3x and 1.5x improvement in energy for hardware and software implementations, respectively.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Robust Real-Time Face Detection
Viola, P., & Jones, M. J. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000013087.49260.fb · Cited by 14,097
Cited by
A Survey of Techniques for Approximate Computing
Mittal, S. (2016) · ACM Computing Surveys · doi:10.1145/2893356 · Cited by 1,058
Big/little deep neural network for ultra low power inference
Park, E., Kim, D., Kim, S., Kim, Y.-D., Kim, G., Yoon, S., & Yoo, S. (2015) · 2015 International Conference on Hardware/Software Codesign and System Synthesis (CODES+ISSS) · doi:10.1109/codesisss.2015.7331375 · Cited by 130
Designing adaptive neural networks for energy-constrained image classification
Stamoulis, D., Chin, T.-W. (., Prakash, A. K., Fang, H., Sajja, S., Bognar, M., & Marculescu, D. (2018) · Proceedings of the International Conference on Computer-Aided Design · doi:10.1145/3240765.3240796 · Cited by 63
A Dynamic Deep Neural Network Design for Efficient Workload Allocation in Edge Computing
Lo, C., Su, Y.-Y., Lee, C.-Y., & Chang, S.-C. (2017) · 2017 IEEE International Conference on Computer Design (ICCD) · doi:10.1109/iccd.2017.49 · Cited by 48
“The concept of fast inference is based on the assumption that the number of network layers traversed by an input is positively correlated to its classification accuracy [19].”
BackgroundMethod
Metadata
- Authors
- Venkataramani, S., Raghunathan, A., Liu, J., & Shoaib, M.
- Venue
- Proceedings of the 52nd Annual Design Automation Conference
- Publisher
- ACM
- Published
- 2015-06-07
- Pages
- 1-6
- ISSN
- 0738-100X (ISSN-L)
- OpenAlex
- W1998305460
- Cited by
- 107
- References
- 1
- FWCI
- 3.88
- Type
- conference paper
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Scalable-effort classifiers for energy-efficient machine learning. https://app.cochat.ai/papers/10.1145/2744769.2744904
- The paper
- Venkataramani, S., Raghunathan, A., Liu, J., & Shoaib, M. (2015). Scalable-effort classifiers for energy-efficient machine learning. Proceedings of the 52nd Annual Design Automation Conference. https://doi.org/10.1145/2744769.2744904
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.