research
∙
07/22/2021
Designing a Location Trace Anonymization Contest
For a better understanding of anonymization methods for location traces,...
share
research
∙
05/05/2016
Copeland Dueling Bandit Problem: Regret Lower Bound, Optimal Algorithm, and Computationally Efficient Algorithm
We study the K-armed dueling bandit problem, a variation of the standard...
research
∙
09/30/2015
Regret Lower Bound and Optimal Algorithm in Finite Stochastic Partial Monitoring
Partial monitoring is a general model for sequential learning with limit...
research
∙
06/08/2015
Regret Lower Bound and Optimal Algorithm in Dueling Bandit Problem
We study the K-armed dueling bandit problem, a variation of the standard...
research
∙
06/02/2015
Optimal Regret Analysis of Thompson Sampling in Stochastic Multi-armed Bandit Problem with Multiple Plays
We discuss a multiple-play multi-armed bandit (MAB) problem in which sev...
research
∙
08/09/2014
Quantum Annealing for Variational Bayes Inference
This paper presents studies on a deterministic annealing algorithm based...
research
∙
05/19/2013
Quantum Annealing for Dirichlet Process Mixture Models with Applications to Network Clustering
We developed a new quantum annealing (QA) algorithm for Dirichlet proces...
research
∙
06/27/2012
