Junpei Komiyama

Kazutoshi Yamazaki

CoRR, 2024

Replicability is Asymptotically Free in Multi-armed Bandits.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Learning Fair Division from Bandit Feedback.

[BibT_eX]

[DOI]

CoRR, 2023

High-dimensional Contextual Bandit Problem without Sparsity.

[BibT_eX]

[DOI]

Masaaki Imaizumi

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Posterior Tracking Algorithm for Classification Bandits.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

Thresholded linear bandits.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022

Bridging Offline and Online Experimentation: Constraint Active Search for Deployed Performance Optimization.

[BibT_eX]

[DOI]

Trans. Mach. Learn. Res., 2022

Strategic Choices of Migrants and Smugglers in the Central Mediterranean Sea.

[BibT_eX]

[DOI]

Katherine Hoffmann Pham

CoRR, 2022

Globally Optimal Algorithms for Fixed-Budget Best Arm Identification.

[BibT_eX]

[DOI]

Taira Tsuchiya

CoRR, 2022

Bayes Optimal Algorithm is Suboptimal in Frequentist Best Arm Identification.

[BibT_eX]

[DOI]

CoRR, 2022

Minimax Optimal Algorithms for Fixed-Budget Best Arm Identification.

[BibT_eX]

[DOI]

Taira Tsuchiya

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Anytime Capacity Expansion in Medical Residency Match by Monte Carlo Tree Search.

[BibT_eX]

[DOI]

Kenshi Abe

Atsushi Iwasaki

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021

Optimal Simple Regret in Bayesian Best Arm Identification.

[BibT_eX]

[DOI]

CoRR, 2021

Deviation-Based Learning.

[BibT_eX]

[DOI]

Shunya Noda

CoRR, 2021

Policy Choice and Best Arm Identification: Comments on "Adaptive Treatment Assignment in Experiments for Policy Choice".

[BibT_eX]

[DOI]

CoRR, 2021

Finite-time Analysis of Globally Nonstationary Multi-Armed Bandits.

[BibT_eX]

[DOI]

Edouard Fouché

CoRR, 2021

Controlling False Discovery Rates Using Null Bootstrapping.

[BibT_eX]

[DOI]

CoRR, 2021

2020

On Statistical Discrimination as a Failure of Social Learning: A Multi-Armed Bandit Approach.

[BibT_eX]

[DOI]

Shunya Noda

CoRR, 2020

RIC-NN: A Robust Transferable Deep Learning Framework for Cross-sectional Investment Strategy.

[BibT_eX]

[DOI]

Kei Nakagawa

Masaya Abe

Proceedings of the 7th IEEE International Conference on Data Science and Advanced Analytics, 2020

2019

A Robust Transferable Deep Learning Framework for Cross-sectional Investment Strategy.

[BibT_eX]

[DOI]

Kei Nakagawa

Masaya Abe

CoRR, 2019

Scaling Multi-Armed Bandit Algorithms.

[BibT_eX]

[DOI]

Edouard Fouché

Klemens Böhm

Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2019

2018

UCB-SC: A Fast Variant of KL-UCB-SC for Budgeted Multi-Armed Bandit Problem.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

A Simple Way to Deal with Cherry-picking.

[BibT_eX]

[DOI]

Takanori Maehara

CoRR, 2018

Comparing Fairness Criteria Based on Social Outcome.

[BibT_eX]

[DOI]

Hajime Shimao

CoRR, 2018

Nonconvex Optimization for Regression with Fairness Constraints.

[BibT_eX]

[DOI]

Proceedings of the 35th International Conference on Machine Learning, 2018

2017

KL-UCB-Based Policy for Budgeted Multi-Armed Bandits with Stochastic Action Costs.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

Two-stage Algorithm for Fairness-aware Machine Learning.

[BibT_eX]

[DOI]

Hajime Shimao

CoRR, 2017

Position-based Multiple-play Bandit Problem with Unknown Position Bias.

[BibT_eX]

[DOI]

Akiko Takeda

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Statistical Emerging Pattern Mining with Multiple Testing Correction.

[BibT_eX]

[DOI]

Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, August 13, 2017

Road safety estimation utilizing big and heterogeneous vehicle recorder data.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Conference on Big Data (IEEE BigData 2017), 2017

2016

Copeland Dueling Bandit Problem: Regret Lower Bound, Optimal Algorithm, and Computationally Efficient Algorithm.

[BibT_eX]

[DOI]

Proceedings of the 33nd International Conference on Machine Learning, 2016

2015

Regret Lower Bound and Optimal Algorithm in Finite Stochastic Partial Monitoring.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Optimal Regret Analysis of Thompson Sampling in Stochastic Multi-armed Bandit Problem with Multiple Plays.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Conference on Machine Learning, 2015

Regret Lower Bound and Optimal Algorithm in Dueling Bandit Problem.

[BibT_eX]

[DOI]

Proceedings of The 28th Conference on Learning Theory, 2015

2014

Time-Decaying Bandits for Non-stationary Systems.

[BibT_eX]

[DOI]

Tao Qin

Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Robust Distributed Training of Linear Classifiers Based on Divergence Minimization Principle.

[BibT_eX]

[DOI]

Hidekazu Oiwa

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2014

2013

Multi-armed Bandit Problem with Lock-up Periods.

[BibT_eX]

[DOI]

Issei Sato