Quick Navigation

Topics

Quantum Optimization Quantum Machine Learning

Quantum Algorithm for Online Exp-concave Optimization

arXiv
Authors: Jianhao He, Chengchang Liu, Xutong Liu, Lvzhou Li, John C. S. Lui

Year

2024

Paper ID

37633

Status

Preprint

Abstract Read

~2 min

Abstract Words

99

Citations

N/A

Abstract

We explore whether quantum advantages can be found for the zeroth-order feedback online exp-concave optimization problem, which is also known as bandit exp-concave optimization with multi-point feedback. We present quantum online quasi-Newton methods to tackle the problem and show that there exists quantum advantages for such problems. Our method approximates the Hessian by quantum estimated inexact gradient and can achieve O\(nlog T\) regret with O(1) queries at each round, where n is the dimension of the decision set and T is the total decision rounds. Such regret improves the optimal classical algorithm by a factor of T2/3.

Why This Paper Matters

  • This paper contributes to the Quantum Machine Learning research area in the Quantum Articles archive.
  • It adds a 2024 reference point for readers tracking recent quantum research.
  • We explore whether quantum advantages can be found for the zeroth-order feedback online exp-concave optimization problem, which is also known as bandit exp-concave optimization...

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

Local Citation Graph (Related-Paper Links)

Current Paper #37633 #78828 Verifiable Sampling for Delegat... #78813 Large-Scale Benchmarking of Qua... #78775 On linearity or non-linearity i...

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0
Likes: 0 Dislikes: 0

Sign in to react to this paper.

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.