AdaEE: Adaptive Early-Exit DNN Inference Through Multi-Armed Bandits

被引:1
|
作者
Pacheco, Roberto G. [1 ]
Shifrin, Mark [2 ]
Couto, Rodrigo S. [1 ]
Menasche, Daniel S. [1 ]
Hanawal, Manjesh K. [3 ]
Campista, Miguel Elias M. [1 ]
机构
[1] Univ Fed Rio de Janeiro, Rio De Janeiro, Brazil
[2] Ben Gurion Univ Negev, Beer Sheva, Israel
[3] Indian Inst Technol, Bombay, Maharashtra, India
基金
巴西圣保罗研究基金会;
关键词
D O I
10.1109/ICC45041.2023.10279243
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
Deep Neural Networks (DNNs) are widely used to solve a growing number of tasks, such as image classification. However, their deployment at resource-constrained devices still poses challenges related to energy consumption and delay overheads. Early-Exit DNNs (EE-DNNs) address the challenges by adding side branches through their architecture. Under an edge-cloud co-inference, if the confidence at a side branch is larger than a fixed confidence threshold, the inference is performed completely at the edge device, saving computation for more difficult observations. Otherwise, the edge device offloads the inference task to the cloud, incurring overhead. Despite its success, EE-DNNs for image classification have to cope with distorted images. The baseline distortion level depends on the environmental context, e.g., time of the day, lighting, and weather conditions. To cope with varying distortion, we propose Adaptive Early-Exit in Deep Neural Networks (AdaEE), a novel algorithm to dynamically adjust the confidence threshold based on context, leveraging the Upper Confidence Bound (UCB) for that matter. AdaEE provably achieves logarithmic regret under mild conditions. We experimentally verify that 1) convergence occurs after collecting a few thousand observations for images with different distortion levels and overhead values, and 2) AdaEE obtains a lower cumulative regret when compared against alternatives using the Caltech-256 dataset subject to varying distortion.
引用
收藏
页码:3726 / 3731
页数:6
相关论文
共 50 条
  • [31] Are Multi-Armed Bandits Susceptible to Peeking?
    Loecher, Markus
    ZAGREB INTERNATIONAL REVIEW OF ECONOMICS & BUSINESS, 2018, 21 (01): : 95 - 104
  • [32] Secure Outsourcing of Multi-Armed Bandits
    Ciucanu, Radu
    Lafourcade, Pascal
    Lombard-Platet, Marius
    Soare, Marta
    2020 IEEE 19TH INTERNATIONAL CONFERENCE ON TRUST, SECURITY AND PRIVACY IN COMPUTING AND COMMUNICATIONS (TRUSTCOM 2020), 2020, : 202 - 209
  • [33] Decentralized Exploration in Multi-Armed Bandits
    Feraud, Raphael
    Alami, Reda
    Laroche, Romain
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 97, 2019, 97
  • [34] Multi-armed bandits with episode context
    Rosin, Christopher D.
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2011, 61 (03) : 203 - 230
  • [35] Introduction to Multi-Armed Bandits Preface
    Slivkins, Aleksandrs
    FOUNDATIONS AND TRENDS IN MACHINE LEARNING, 2019, 12 (1-2): : 1 - 286
  • [36] UCBEE: A Multi Armed Bandit Approach for Early-Exit in Neural Networks
    Pacheco, Roberto G.
    Bajpai, Divya J.
    Shifrin, Mark
    Couto, Rodrigo S.
    Menasche, Daniel Sadoc
    Hanawal, Manjesh K.
    Campista, Miguel Elias M.
    IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, 2025, 22 (01): : 107 - 120
  • [37] Federated Multi-armed Bandits with Personalization
    Shi, Chengshuai
    Shen, Cong
    Yang, Jing
    24TH INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS (AISTATS), 2021, 130
  • [38] Active Inference for Autonomous Decision-Making with Contextual Multi-Armed Bandits
    Wakayama, Shohei
    Ahmed, Nisar
    2023 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA 2023), 2023, : 7916 - 7922
  • [39] Adaptive Monte Carlo Multiple Testing via Multi-Armed Bandits
    Zhang, Martin J.
    Zou, James
    Tse, David
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 97, 2019, 97
  • [40] Extreme Compass and Dynamic Multi-Armed Bandits for Adaptive Operator Selection
    Maturana, Jorge
    Fialho, Alvaro
    Saubion, Frederic
    Schoenauer, Marc
    Sebag, Michele
    2009 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-5, 2009, : 365 - +