Arm order recognition in multi-armed bandit problem with laser chaos time series

• Published in: Scientific reports 2021-02, Vol.11 (1), p.4459-4459, Article 4459
• Main Authors: Narisawa, Naoki, Chauvet, Nicolas, Hasegawa, Mikio, Naruse, Makoto
• Format: Article
• Language: English
• Subjects: 639/624/1075; 639/705; 639/705/258; Algorithms; Humanities and Social Sciences; Lasers; multidisciplinary; Reinforcement; Resource allocation; Science; Science (multidisciplinary); Time series
• ISSN: 2045-2322; 2045-2322
• DOI: 10.1038/s41598-021-83726-8

By exploiting ultrafast and irregular time series generated by lasers with delayed feedback, we have previously demonstrated a scalable algorithm to solve multi-armed bandit (MAB) problems utilizing the time-division multiplexing of laser chaos time series. Although the algorithm detects the arm with the highest reward expectation, the correct recognition of the order of arms in terms of reward expectations is not achievable. Here, we present an algorithm where the degree of exploration is adaptively controlled based on confidence intervals that represent the estimation accuracy of reward expectations. We have demonstrated numerically that our approach did improve arm order recognition accuracy significantly, along with reduced dependence on reward environments, and the total reward is almost maintained compared with conventional MAB methods. This study applies to sectors where the order information is critical, such as efficient allocation of resources in information and communications technology.