Demo Data from VLDB 2026 / reviewers in the wild / expert
Naima Elosegui
dblp:384/4130
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Optimization for machine learning · 100% | |
| Theoretical computer science
1 paper |
Quantum computing and quantum information · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Optimization for machine learning › model-based optimization
bayesian optimization |
0.8 | 1 | 2024 | Adaptive Observation Cost Control for Variational Quantum Eigensolvers · ICML 2024 |
Machine learning › Optimization for machine learning
model-based optimization |
0.8 | 1 | 2024 | Adaptive Observation Cost Control for Variational Quantum Eigensolvers · ICML 2024 |
Quantum computing and quantum information
quantum algorithms |
0.8 | 1 | 2024 | Adaptive Observation Cost Control for Variational Quantum Eigensolvers · ICML 2024 |
Quantum computing and quantum information › quantum algorithms
variational quantum eigensolver |
0.8 | 1 | 2024 | Adaptive Observation Cost Control for Variational Quantum Eigensolvers · ICML 2024 |
Methods — techniques the papers use, named apart from their topics
sequential minimal optimization · 1.5gaussian process · 1.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Adaptive Observation Cost Control for Variational Quantum EigensolversabstractThe objective to be minimized in the variational quantum eigensolver (VQE) has a restricted form, which allows a specialized sequential minimal optimization (SMO) that requires only a few observations in each iteration. However, the SMO iteration is still costly due to the observation noise—one observation at a point typically requires averaging over hundreds to thousands of repeated quantum measurement shots for achieving a reasonable noise level. In this paper, we propose an adaptive cost control method, named subspace in confident region (SubsCoRe), for SMO. SubsCoRe uses the Gaussian process (GP) surrogate, and requires it to have low uncertainty over the subspace being updated, so that optimization in each iteration is performed with guaranteed accuracy. Adaptive cost control is performed by setting the required accuracy according to the progress of the optimization, and identifying the minimum number of measurement shots, as well as their distribution, satisfying the SubsCoRe requirement. Christopher J. Anders, Kim Nicoli, Bingting Wu, Naima Elosegui, Samuele Pedrielli, Lena Funcke, Karl Jansen, Stefan Kühn, Shinichi Nakajima |
ICML | 4 |