4 citations · 7 across the 9 of their papers we have counts for
4 papers · 1 filter
Variational Quantum Optimization with Continuous Bandits
Marc Wanner, Johan Jonasson, Emil Carlsson +1
We introduce a novel approach to variational Quantum algorithms (VQA) via continuous bandits. VQA are a class of hybrid Quantum-classical algorithms where the parameters of Quantum…
Active Preference Learning for Ordering Items In- and Out-of-sample
Herman Bergström, Emil Carlsson, Devdatt Dubhashi +1
Learning an ordering of items based on pairwise comparisons is useful when items are difficult to rate consistently on an absolute scale, for example, when annotators have to make…
Pure Exploration in Bandits with Linear Constraints
Emil Carlsson, Debabrota Basu, Fredrik D. Johansson +1
We address the problem of identifying the optimal policy with a fixed confidence level in a multi-armed bandit setup, when \emph{the arms are subject to linear constraints}. Unlike…
Thompson Sampling for Bandits with Clustered Arms
Emil Carlsson, Devdatt Dubhashi, Fredrik D. Johansson
We propose algorithms based on a multi-level Thompson sampling scheme, for the stochastic multi-armed bandit and its contextual variant with linear expected rewards, in the setting…