Pith. sign in

REVIEW 3 cited by

PolyThrottle: Energy-efficient Neural Network Inference on Edge Devices

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2310.19991 v2 pith:IIZ4QAS3 submitted 2023-10-30 cs.LG cs.AR

classification cs.LGcs.AR
keywords energyinferencepolythrottleacrossconsumptionduringneuralprior
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

As neural networks (NN) are deployed across diverse sectors, their energy demand correspondingly grows. While several prior works have focused on reducing energy consumption during training, the continuous operation of ML-powered systems leads to significant energy use during inference. This paper investigates how the configuration of on-device hardware-elements such as GPU, memory, and CPU frequency, often neglected in prior studies, affects energy consumption for NN inference with regular fine-tuning. We propose PolyThrottle, a solution that optimizes configurations across individual hardware components using Constrained Bayesian Optimization in an energy-conserving manner. Our empirical evaluation uncovers novel facets of the energy-performance equilibrium showing that we can save up to 36 percent of energy for popular models. We also validate that PolyThrottle can quickly converge towards near-optimal settings while satisfying application constraints.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Formally Verifying Analog Neural Networks Under Process Variations Using Polynomial Zonotopes

    cs.LG 2026-05 unverdicted novelty 6.0 of 10

    A polynomial-based circuit model combined with polynomial zonotope reachability analysis verifies analog neural networks under process variations, reducing verification time from days to seconds while enclosing 99% of...

  2. Formally Verifying Analog Neural Networks Under Process Variations Using Polynomial Zonotopes

    cs.LG 2026-05 conditional novelty 6.0 of 10

    A polynomial-zonotope reachability method verifies small analog neural networks under process variations in seconds, enclosing about 99% of Monte Carlo samples.

  3. Strait: Perceiving Priority and Interference in ML Inference Serving

    cs.LG 2026-04 unverdicted novelty 5.0 of 10

    Strait cuts high-priority deadline violations in ML inference serving by 1-11 percentage points through contention modeling and priority scheduling under high GPU load.

Pith tools