Quantum bandit with amplitude amplification exploration in an adversarial environment

The rapid proliferation of learning systems in an arbitrarily changing environment mandates the need to manage tensions between exploration and exploitation. This work proposes a quantum-inspired bandit learning approach for the learning-and-adapting-based offloading problem where a client observes and learns the costs of each task offloaded to the candidate resource providers, e.g., fog nodes. In this approach, a new action update strategy and novel probabilistic action selection are adopted, provoked by the amplitude amplification and collapse postulate in quantum computation theory. We devise a locally linear mapping between a quantum-mechanical phase in a quantum domain, e.g., Grover-type search algorithm, and a distilled probability-magnitude in a value-based decision-making domain, e.g., adversarial multi-armed bandit algorithm. The proposed algorithm is generalized, via the devised mapping, for better learning weight adjustments on favorable/unfavorable actions, and its effectiveness is verified via simulation.

Keywords

Costs, Task analysis, Decision making, Uncertainty, Quantum algorithm, Qubit, Quantum state

DOI

10.1109/TKDE.2023.3279207

Citation

Cho, B, Xiao, Y, Hui, P & Dong, D 2024, 'Quantum bandit with amplitude amplification exploration in an adversarial environment', IEEE Transactions on Knowledge and Data Engineering, vol. 36, no. 1, 10136755, pp. 311-317. https://doi.org/10.1109/TKDE.2023.3279207

Permanent link to this item

https://urn.fi/URN:NBN:fi:aalto-202401041145

Collections

[article-cris] Palvelut / Services

Show all metadata

Quantum bandit with amplitude amplification exploration in an adversarial environment

Access rights

URL

Journal Title

Journal ISSN

Volume Title

Authors

Date

Department

Major/Subject

Mcode

Degree programme

Language

Pages

Series

Abstract

Description

Keywords

Other note

DOI

Citation

Permanent link to this item

Collections