Junpei Komiyama
17 papers · 2013–2026 · 8 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+5 more ↓ Show less ↑
π£ Hot Topic Early Bird π Conference Polyglot Β· Silver π Academic Marathon Β· Half π Interdisciplinary Bridge Β· Silver πΊοΈ Taxonomy Completionist (24)
π§
Keyword Pioneer
π¬
Deep Specialist
(11)
ποΈ
Keyword Collector
(77)
π
Century Club Β· Bronze
π₯
Unstoppable Β· Bronze
Top co-authors
Research topics
Keywords
multi-armed bandit
(10)
regret bound
(9)
online learning
(4)
stochastic optimization
(4)
optimal algorithm
(3)
best arm identification
(3)
bayesian inference
(2)
dueling bandit
(2)
sample complexity
(2)
stochastic bandit
(2)
online advertising
(1)
arm selection
(1)
high-dimensional regression
(1)
sequential learning
(1)
global optimization
(1)
sample efficiency
(1)
posterior sampling
(1)
finite-time analysis
(1)
minimax optimality
(1)
thompson sampling
(1)
Papers
Fixed-Confidence Best-Arm Identification for Causal Mediation Analysis
UAI 2026
Data-dependent Bounds with T-Optimal Best-of-Both-Worlds Guarantees in Multi-Armed Bandits using Stability-Penalty Matching
COLT 2025
Finite-time Analysis of Globally Nonstationary Multi-Armed Bandits
JMLR 2024
Fixed Confidence Best Arm Identification in the Bayesian Setting
NeurIPS 2024
Learning Fair Division from Bandit Feedback
AISTATS 2024
High-dimensional Contextual Bandit Problem without Sparsity
NeurIPS 2023
Posterior Tracking Algorithm for Classification Bandits
AISTATS 2023
Thresholded linear bandits
AISTATS 2023
Anytime Capacity Expansion in Medical Residency Match by Monte Carlo Tree Search
IJCAI 2022
Minimax Optimal Algorithms for Fixed-Budget Best Arm Identification
NeurIPS 2022
Nonconvex Optimization for Regression with Fairness Constraints
ICML 2018
Position-based Multiple-play Bandit Problem with Unknown Position Bias
NeurIPS 2017
Copeland Dueling Bandit Problem: Regret Lower Bound, Optimal Algorithm, and Computationally Efficient Algorithm
ICML 2016
Optimal Regret Analysis of Thompson Sampling in Stochastic Multi-armed Bandit Problem with Multiple Plays
ICML 2015
Regret Lower Bound and Optimal Algorithm in Dueling Bandit Problem
COLT 2015
Regret Lower Bound and Optimal Algorithm in Finite Stochastic Partial Monitoring
NeurIPS 2015
Multi-armed Bandit Problem with Lock-up Periods
ACML 2013