.png){kind=icon}
.png){kind=icon}
Return
Quantum algorithm for online convex optimization
.png){kind=icon}
OA
AI
DOI：10.1088/2058-9565/ac5919.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We explore whether quantum advantages can be found for the zeroth-order online convex optimization (OCO) problem, which is also known as bandit convex optimization with multi-point feedback. In this setting, given access to zeroth-order oracles (that is, the loss function is accessed as a black box that returns the function value for any queried input), a player attempts to minimize a sequence of adversarially generated convex loss functions. This procedure can be described as a T round iterative game between the player and the adversary. In this paper, we present quantum algorithms for the problem and show for the first time that potential quantum advantages are possible for problems of OCO. Specifically, our contributions are as follows. (i) When the player is allowed to query zeroth-order oracles O(1) times in each round as feedback, we give a quantum algorithm that achieves O(root T) regret without additional dependence of the dimension n, which outperforms the already known optimal classical algorithm only achieving O(root nT) regret. Note that the regret of our quantum algorithm has achieved the lower bound of classical first-order methods. (ii) We show that for strongly convex loss functions, the quantum algorithm can achieve O(log T) regret with O(1) queries as well, which means that the quantum algorithm can achieve the same regret bound as the classical algorithms in the full information setting.
Keywords:
online convex optimization
bandit convex optimization
multi-point bandit feedback
quantum optimization algorithms
query complexity
Journal
IF:
5
Papers:
1.4K
Citations:
5.1K