A Comparative Analysis on the Performance of Upper Confidence Bound Algorithms in Adaptive Deep Neural Networks
Grigorios Papanikolaou, Ioannis Kontopoulos, Konstantinos Tserpes

TL;DR
This paper compares five Upper Confidence Bound strategies within Adaptive Deep Neural Networks for edge computing, analyzing their efficiency in balancing accuracy, energy, and latency across multiple datasets.
Contribution
Introduces four new UCB strategies for ADNNs and provides the first comparative analysis of their performance in edge scenarios.
Findings
All strategies achieve sub-linear regret.
UCB-Bayes converges fastest among the strategies.
UCB-V and UCB-Tuned optimize accuracy-latency and accuracy-energy trade-offs.
Abstract
Edge computing environments impose strict constraints on energy consumption and latency, making the deployment of deep neural networks a significant challenge. Therefore, smart and adaptive inference strategies that dynamically balance computational cost or latency with predictive accuracy are critical in edge computing scenarios. In this work, we build on Adaptive Deep Neural Networks (ADNNs) that employ the Multi-Armed Bandit (MAB) framework. Current literature leverages the first version of the Upper Confidence Bound (UCB1) strategy to dynamically select the optimal confidence threshold, enabling efficient early exits without sacrificing accuracy. However, we introduce four additional Upper Confidence Bound strategies in ADNNs, namely UCB-V, UCB-Tuned, UCB-Bayes, and UCB-BwK, and perform, for the first time, a comparative study of these strategies with respect to trade-offs between…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
