Junpei Komiyama
16 papers · 2013–2025 · 7 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+5 more ↓ Show less ↑
π Interdisciplinary Bridge πΊοΈ Taxonomy Completionist (12) π§ Keyword Pioneer π£ Hot Topic Early Bird π Conference Polyglot (7)
π
Academic Marathon
(12)
π
Cross-Pollinator
(13)
π¬
Deep Specialist
(10)
π
Century Club
(16)
ποΈ
Keyword Collector
(66)
Conferences
NIPS (5)
AISTATS (3)
ICML (3)
COLT (2)
ACML (1)
IJCAI (1)
JMLR (1)
Top co-authors
Keywords
multi-armed bandit
(10)
regret bound
(8)
stochastic optimization
(4)
online learning
(4)
optimal algorithm
(3)
bayesian inference
(2)
sample complexity
(2)
best arm identification
(2)
dueling bandit
(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
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
NIPS 2024
Learning Fair Division from Bandit Feedback
AISTATS 2024
Posterior Tracking Algorithm for Classification Bandits
AISTATS 2023
High-dimensional Contextual Bandit Problem without Sparsity
NIPS 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
NIPS 2022
Nonconvex Optimization for Regression with Fairness Constraints
ICML 2018
Position-based Multiple-play Bandit Problem with Unknown Position Bias
NIPS 2017
Copeland Dueling Bandit Problem: Regret Lower Bound, Optimal Algorithm, and Computationally Efficient Algorithm
ICML 2016
Regret Lower Bound and Optimal Algorithm in Dueling Bandit Problem
COLT 2015
Optimal Regret Analysis of Thompson Sampling in Stochastic Multi-armed Bandit Problem with Multiple Plays
ICML 2015
Regret Lower Bound and Optimal Algorithm in Finite Stochastic Partial Monitoring
NIPS 2015
Multi-armed Bandit Problem with Lock-up Periods
ACML 2013