Quantum greedy algorithms for multi-armed bandits
From MaRDI portal
Recommendations
- Quantum reinforcement learning. Comparing quantum annealing and gate-based quantum computing with classical deep reinforcement learning
- Quantum-enhanced least-square support vector machine: simplified quantum algorithm and sparse solutions
- Quantum kernel logistic regression based Newton method
- Quantum context-aware recommendation systems based on tensor singular value decomposition
- Quantum support vector machine based on gradient descent
Cites work
- A Tutorial on Thompson Sampling
- Fast state tomography with optimal error bounds
- Finite-time analysis of the multiarmed bandit problem
- Grover's Quantum Algorithm Applied to Global Optimization
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 2103524 (Why is no real title available?)
- Introduction to multi-armed bandits
- Quantum speedup of Monte Carlo methods
- Reinforcement learning. An introduction
- Supervised learning with quantum computers
- Transformation of quantum states using uniformly controlled rotations
- Variable time amplitude amplification and quantum algorithms for linear algebra problems
Cited in
(2)
This page was built for publication: Quantum greedy algorithms for multi-armed bandits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2693852)