Quantum bandit with amplitude amplification exploration in an adversarial environment

• URL: http://arxiv.org/abs/2208.07144v2
• Date: Sat, 20 May 2023 18:57:19 GMT
• Title: Quantum bandit with amplitude amplification exploration in an adversarial environment
• Authors: Byungjin Cho, Yu Xiao, Pan Hui, and Daoyi Dong
• Abstract summary: We propose a quantum-inspired bandit learning approach for the learning-and-adapting-based offloading problem. A new action update strategy and novel probabilistic action selection are adopted, provoked by the amplitude amplification and collapse in quantum theory. The proposed algorithm is generalized, via the devised mapping, for better learning weight adjustments on favourable/unfavourable actions.
• Score: 9.563657204041682
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The rapid proliferation of learning systems in an arbitrarily changing environment mandates the need for managing 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, respectively. 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 favourable/unfavourable actions and its effectiveness is verified via simulation.

Related papers

• A Novel Quantum Algorithm for Efficient Attractor Search in Gene Regulatory Networks [0.0978224644130106]
  We demonstrate a novel quantum search algorithm inspired by Grover's algorithm to be implemented on quantum computing platforms. The algorithm performs an iterative suppression of states belonging to basins of previously discovered attractors from a uniform superposition. Tests of its resistance to noise have also shown promising performance on devices from the current Noise Intermediate Scale Quantum Computing (NISQ) era.
  arXiv  Detail & Related papers  (2024-08-16T15:48:45Z)
• Latent Exploration for Reinforcement Learning [87.42776741119653]
  In Reinforcement Learning, agents learn policies by exploring and interacting with the environment. We propose LATent TIme-Correlated Exploration (Lattice), a method to inject temporally-correlated noise into the latent state of the policy network.
  arXiv  Detail & Related papers  (2023-05-31T17:40:43Z)
• Optimal fidelity in implementing Grover's search algorithm on open quantum system [0.0]
  We investigate the fidelity of Grover's search algorithm by implementing it on an open quantum system. We include the environmental effects on the system dynamics by using a recently reported fluctuation-regulated quantum master equation (FRQME) We find that the fidelity is found to depend on both the drive-induced dissipative terms and the relaxation terms.
  arXiv  Detail & Related papers  (2023-03-03T07:48:26Z)
• Safe Multi-agent Learning via Trapping Regions [89.24858306636816]
  We apply the concept of trapping regions, known from qualitative theory of dynamical systems, to create safety sets in the joint strategy space for decentralized learning. We propose a binary partitioning algorithm for verification that candidate sets form trapping regions in systems with known learning dynamics, and a sampling algorithm for scenarios where learning dynamics are not known.
  arXiv  Detail & Related papers  (2023-02-27T14:47:52Z)
• Bandit approach to conflict-free multi-agent Q-learning in view of photonic implementation [0.0]
  Previous studies have used quantum interference of photons to solve the competitive multi-armed bandit problem. This study extends the conventional approach to a more general multi-agent reinforcement learning. A successful photonic reinforcement learning scheme requires both a photonic system that contributes to the quality of learning and a suitable algorithm.
  arXiv  Detail & Related papers  (2022-12-20T00:27:29Z)
• Exploring the role of parameters in variational quantum algorithms [59.20947681019466]
  We introduce a quantum-control-inspired method for the characterization of variational quantum circuits using the rank of the dynamical Lie algebra. A promising connection is found between the Lie rank, the accuracy of calculated energies, and the requisite depth to attain target states via a given circuit architecture.
  arXiv  Detail & Related papers  (2022-09-28T20:24:53Z)
• Optimal quantum control via genetic algorithms for quantum state engineering in driven-resonator mediated networks [68.8204255655161]
  We employ a machine learning-enabled approach to quantum state engineering based on evolutionary algorithms. We consider a network of qubits -- encoded in the states of artificial atoms with no direct coupling -- interacting via a common single-mode driven microwave resonator. We observe high quantum fidelities and resilience to noise, despite the algorithm being trained in the ideal noise-free setting.
  arXiv  Detail & Related papers  (2022-06-29T14:34:00Z)
• Large-Scale Sequential Learning for Recommender and Engineering Systems [91.3755431537592]
  In this thesis, we focus on the design of an automatic algorithms that provide personalized ranking by adapting to the current conditions. For the former, we propose novel algorithm called SAROS that take into account both kinds of feedback for learning over the sequence of interactions. The proposed idea of taking into account the neighbour lines shows statistically significant results in comparison with the initial approach for faults detection in power grid.
  arXiv  Detail & Related papers  (2022-05-13T21:09:41Z)
• Grover search revisited; application to image pattern matching [0.8367938108534343]
  We propose a quantum algorithm that approximately executes the entire Grover database search or pattern matching algorithm. The key idea is to use the recently proposed approximate amplitude encoding method on a shallow quantum circuit.
  arXiv  Detail & Related papers  (2021-08-24T17:30:41Z)
• Noise-Robust End-to-End Quantum Control using Deep Autoregressive Policy Networks [2.5946789143276447]
  Variational quantum eigensolvers have recently received increased attention, as they enable the use of quantum computing devices. We present a hybrid policy gradient algorithm capable of simultaneously optimizing continuous and discrete degrees of freedom in an uncertainty-resilient way. Our work exhibits the beneficial synergy between reinforcement learning and quantum control.
  arXiv  Detail & Related papers  (2020-12-12T02:13:28Z)
• A black-box adversarial attack for poisoning clustering [78.19784577498031]
  We propose a black-box adversarial attack for crafting adversarial samples to test the robustness of clustering algorithms. We show that our attacks are transferable even against supervised algorithms such as SVMs, random forests, and neural networks.
  arXiv  Detail & Related papers  (2020-09-09T18:19:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.