20 citations · 63 across the 9 of their papers we have counts for
14 papers
Online Dense Subgraph Discovery via Blurred-Graph Feedback
Yuko Kuroki, Atsushi Miyauchi, Junya Honda +1
Dense subgraph discovery aims to find a dense component in edge-weighted graphs. This is a fundamental graph-mining task with a variety of applications and thus has received much a…
Time-varying Gaussian Process Bandit Optimization with Non-constant Evaluation Time
Hideaki Imamura, Nontawat Charoenphakdee, Futoshi Futami +3
The Gaussian process bandit is a problem in which we want to find a maximizer of a black-box function with the minimum number of function evaluations. If the black-box function var…
Uncoupled Regression from Pairwise Comparison Data
Liyuan Xu, Junya Honda, Gang Niu +1
Uncoupled regression is the problem to learn a model from unlabeled data and the set of target values while the correspondence between them is unknown. Such a situation arises in p…
A Note on KL-UCB+ Policy for the Stochastic Bandit
Junya Honda
A classic setting of the stochastic K-armed bandit problem is considered in this note. In this problem it has been known that KL-UCB policy achieves the asymptotically optimal regr…
A Bad Arm Existence Checking Problem
Koji Tabata, Atsuyoshi Nakamura, Junya Honda +1
We study a bad arm existing checking problem in which a player's task is to judge whether a positive arm exists or not among given K arms by drawing as small number of arms as poss…
On the Calibration of Multiclass Classification with Rejection
Chenri Ni, Nontawat Charoenphakdee, Junya Honda +1
We investigate the problem of multiclass classification with rejection, where a classifier can choose not to make a prediction to avoid critical misclassification. First, we consid…