IDEAS home Printed from https://ideas.repec.org/a/hin/complx/5205580.html
   My bibliography  Save this article

Theory of Acceleration of Decision-Making by Correlated Time Sequences

Author

Listed:
  • Norihiro Okada
  • Tomoki Yamagami
  • Nicolas Chauvet
  • Yusuke Ito
  • Mikio Hasegawa
  • Makoto Naruse
  • Hiroki Sayama

Abstract

Photonic accelerators have been intensively studied to provide enhanced information processing capability to benefit from the unique attributes of physical processes. Recently, it has been reported that chaotically oscillating ultrafast time series from a laser, called laser chaos, provides the ability to solve multi-armed bandit (MAB) problems or decision-making problems at GHz order. Furthermore, it has been confirmed that the negatively correlated time-domain structure of laser chaos contributes to the acceleration of decision-making. However, the underlying mechanism of why decision-making is accelerated by correlated time series is unknown. In this study, we demonstrate a theoretical model to account for accelerating decision-making by correlated time sequence. We first confirm the effectiveness of the negative autocorrelation inherent in time series for solving two-armed bandit problems using Fourier transform surrogate methods. We propose a theoretical model that concerns the correlated time series subjected to the decision-making system and the internal status of the system therein in a unified manner, inspired by correlated random walks. We demonstrate that the performance derived analytically by the theory agrees well with the numerical simulations, which confirms the validity of the proposed model and leads to optimal system design. This study paves the way for improving the effectiveness of correlated time series for decision-making, impacting artificial intelligence and other applications.

Suggested Citation

  • Norihiro Okada & Tomoki Yamagami & Nicolas Chauvet & Yusuke Ito & Mikio Hasegawa & Makoto Naruse & Hiroki Sayama, 2022. "Theory of Acceleration of Decision-Making by Correlated Time Sequences," Complexity, Hindawi, vol. 2022, pages 1-13, August.
  • Handle: RePEc:hin:complx:5205580
    DOI: 10.1155/2022/5205580
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2022/5205580.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2022/5205580.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2022/5205580?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:complx:5205580. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.