Reconfigurable and Computationally Efficient Architecture for Multi-armed Bandit Algorithms

被引:0
|
作者
Santosh, S. V. Sai [1 ]
Darak, S. J. [1 ]
机构
[1] IIIT Delhi, ECE Dept, Algorithms Architectures Lab, New Delhi 110020, India
关键词
AD-HOC;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Multi-armed bandit (MAB) algorithms are designed to identify the best arm among several arms in an unknown environment. They guarantee optimal balance between exploration (select all arms sufficient number of times) and exploitation (select best arm as many times as possible). They are widely used in applications such as website advertisement, robotics, healthcare, finance, and wireless radios. Robotics and radio applications need integration of MAB algorithms with the PHY on the hardware to meet the stringent area, power and latency constraints. Moreover, a single MAB algorithm may not be suitable for various scenarios and hence, the application needs to switch between MAB algorithms on-the-fly. In this paper, we efficiently map the MAB algorithms on Zynq System on Chip (ZSoC) and make it reconfigurable such that the number of arms, as well as type of algorithm, can be changed on-the fly. We validate the functional correctness and usefulness of the proposed architectures via realistic wireless application and detailed complexity analysis demonstrates the feasibility of the proposed solution in realizing intelligent radios/robots.
引用
收藏
页数:5
相关论文
共 50 条
  • [1] Intelligent and Reconfigurable Architecture for KL Divergence-Based Multi-Armed Bandit Algorithms
    Santosh, S. V. Sai
    Darak, Sumit J.
    [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2021, 68 (03) : 1008 - 1012
  • [2] Scaling Multi-Armed Bandit Algorithms
    Fouche, Edouard
    Komiyama, Junpei
    Boehm, Klemens
    [J]. KDD'19: PROCEEDINGS OF THE 25TH ACM SIGKDD INTERNATIONAL CONFERENCCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2019, : 1449 - 1459
  • [3] Multi-armed bandit algorithms and empirical evaluation
    Vermorel, J
    Mohri, M
    [J]. MACHINE LEARNING: ECML 2005, PROCEEDINGS, 2005, 3720 : 437 - 448
  • [4] Anytime Algorithms for Multi-Armed Bandit Problems
    Kleinberg, Robert
    [J]. PROCEEDINGS OF THE SEVENTHEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2006, : 928 - 936
  • [5] Multi-armed Bandit Algorithms for Adaptive Learning: A Survey
    Mui, John
    Lin, Fuhua
    Dewan, M. Ali Akber
    [J]. ARTIFICIAL INTELLIGENCE IN EDUCATION (AIED 2021), PT II, 2021, 12749 : 273 - 278
  • [6] Fair Link Prediction with Multi-Armed Bandit Algorithms
    Wang, Weixiang
    Soundarajan, Sucheta
    [J]. PROCEEDINGS OF THE 15TH ACM WEB SCIENCE CONFERENCE, WEBSCI 2023, 2023, : 219 - 228
  • [7] Online Optimization Algorithms for Multi-Armed Bandit Problem
    Kamalov, Mikhail
    Dobrynin, Vladimir
    Balykina, Yulia
    [J]. 2017 CONSTRUCTIVE NONSMOOTH ANALYSIS AND RELATED TOPICS (DEDICATED TO THE MEMORY OF V.F. DEMYANOV) (CNSA), 2017, : 141 - 143
  • [8] THE MULTI-ARMED BANDIT PROBLEM: AN EFFICIENT NONPARAMETRIC SOLUTION
    Chan, Hock Peng
    [J]. ANNALS OF STATISTICS, 2020, 48 (01): : 346 - 373
  • [9] The multi-armed bandit, with constraints
    Eric V. Denardo
    Eugene A. Feinberg
    Uriel G. Rothblum
    [J]. Annals of Operations Research, 2013, 208 : 37 - 62
  • [10] Multi-armed bandit games
    Gursoy, Kemal
    [J]. ANNALS OF OPERATIONS RESEARCH, 2024,