activity
20182026
most citedFeature selection as Monte-Carlo Search in Growing Single Rooted Directed Acyclic Graph by Best Leaf Identification

5 citations · 5 across the 5 of their papers we have counts for

collaborators

6 papers

cs.LG2026

SAVER: Stochastic Adaptive Variance-Driven Exploration and Reconstruction for Low-Dose Computed Tomography

Shunta Nonaga, Koji Tabata, Junya Honda +3

Computed Tomography (CT) is indispensable in clinical diagnostics, yet minimizing radiation dose without compromising image quality remains a critical challenge. Conventional low-d…

stat.ML2026

An Efficient Algorithm for Thresholding Monte Carlo Tree Search

Shoma Nameki, Atsuyoshi Nakamura, Junpei Komiyama +1

We introduce the Thresholding Monte Carlo Tree Search problem, in which, given a tree and a threshold , a player must answer whether the root node value of $\mathc…

cs.LG2025

Risk-Averse Best Arm Set Identification with Fixed Budget and Fixed Confidence

Shunta Nonaga, Koji Tabata, Yuta Mizuno +1

Decision making under uncertain environments in the maximization of expected reward while minimizing its risk is one of the ubiquitous problems in many subjects. Here, we introduce…

cs.LG2022

Gaussian Process Classification Bandits

Tatsuya Hayashi, Naoki Ito, Koji Tabata +4

Classification bandits are multi-armed bandit problems whose task is to classify a given set of arms into either positive or negative class depending on whether the rate of the arm…

cs.LG2019

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…

cs.LG2018★ 5 cited

Feature selection as Monte-Carlo Search in Growing Single Rooted Directed Acyclic Graph by Best Leaf Identification

Aurelien Pelissier, Atsuyoshi Nakamura, Koji Tabata

Monte Carlo tree search (MCTS) has received considerable interest due to its spectacular success in the difficult problem of computer Go and also proved beneficial in a range of ot…