← All authors Junpei Komiyama New York University (from arXiv:2109.08229, 2021) · ORCID · OpenAlex
14 papers in scope · 11 published · 3 on the econ.EM arXiv · 149 citations · h-index 6 (over the papers listed here)
Related authors The 20 authors closest to this one in our weighted citation graph, most related first.
Daniel Russo Chao Qin Art B. Owen Masaaki Imaizumi Toru Kitagawa Jeff Rowley Takuya Ishihara Masahiro Kato Masayoshi Mase Benjamin B. Seiler Tim P. Morrison Harrison H. Li Shunya Noda Kaito Ariu Dan M. Kluger Karun Adusumilli Kenichiro McAlinn Junya Honda Hugo Enrique Sánchez López Gabriel Saco Proximity is measured over citations between two papers we both hold, weighted by how heavily one leans on the other, and is symmetric — it does not distinguish citing from being cited. Authors without a profile here are skipped, and a genuinely close colleague can be missing simply because their work is not in our arXiv corpus. Method: docs/06-citations-pipeline.md .
Papers Show only papers in our arXiv econ.EM corpus (3 of 14)
Strategic choices of migrants and smugglers in the Central Mediterranean sea
published 2024 · PLoS ONE · 6 citations · first circulated 2022
with Katherine Hoffmann Pham
On Statistical Discrimination as a Failure of Social Learning: A Multiarmed Bandit Approach
published 2024 · Management Science · 8 citations
Rate-Optimal Bayesian Simple Regret in Best Arm Identification
published 2023 · Mathematics of Operations Research · 2 citations · first circulated 2021
Anytime Capacity Expansion in Medical Residency Match by Monte Carlo Tree Search
published 2022 · Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence · 6 citations
working paper 2021 · arXiv · 3 citations
working paper 2020 · arXiv · 9 citations
RIC-NN: Deep Transfer Learning for Multi-Factor Investment Strategy
published 2020 · The Japanese Society for Artificial Intelligence
no link
working paper 2018 · arXiv · 2 citations
Nonconvex Optimization for Regression with Fairness Constraints.
published 2018 · International Conference on Machine Learning · 62 citations
no link
UCB-SC: A Fast Variant of KL-UCB-SC for Budgeted Multi-Armed Bandit Problem
published 2018 · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 1 citations
with Ryo Watanabe, Atsuyoshi Nakamura, Mineichi Kudo
Position-based Multiple-play Bandit Problem with Unknown Position Bias
published 2017 · Neural Information Processing Systems · 13 citations
no link
KL-UCB-Based Policy for Budgeted Multi-Armed Bandits with Stochastic Action Costs
published 2017 · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 6 citations
with Ryo Watanabe, Atsuyoshi Nakamura, Mineichi Kudo
Copeland dueling bandit problem: regret lower bound, optimal algorithm, and computationally efficient algorithm
published 2016 · International Conference on Machine Learning · 20 citations · first circulated 2015
Regret lower bound and optimal algorithm in finite stochastic partial monitoring
published 2015 · Neural Information Processing Systems · 11 citations
Assembled from arXiv and OpenAlex. Duplicate records for the same paper are merged, and the published version is shown where we could identify one. Corrections welcome.
Built from arXiv and OpenAlex. Supported by UKRI grant APP47921 (Martin Weidner, UCL · Francis J. DiTraglia, Oxford).