← All authors Junya Honda Kyoto University (from arXiv:2002.05308, 2020) · OpenAlex
23 papers in scope · 22 published · 1 on the econ.EM arXiv · 705 citations · h-index 12 (over the papers listed here)
Related authors The 20 authors closest to this one in our weighted citation graph, most related first.
Harrison H. Li Art B. Owen Gabriel Saco Zachary C. Lipton Shantanu Gupta David Childers Iavor Bojinov Yu-Shiou Willy Lin Dae Woong Ham Ryo Inokuchi Masayoshi Mase Benjamin B. Seiler Yong Cai Waverly Wei Masahiro Kato Jingshen Wang Yusuke Narita Dan M. Kluger Bezirgen Veliyev Ahnaf Rafi 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 (1 of 23)
Active model selection: A variance minimization approach
published 2024 · Machine Learning · 2 citations
with Satoshi Hara, Mitsuru Matsuura, Shinji Ito
Optimal dose escalation methods using deep reinforcement learning in phase I oncology trials
published 2023 · Journal of Biopharmaceutical Statistics · 1 citations
with Kentaro Matsuura, Kentaro Sakamaki, Takashi Sozu
Bayesian optimization with partially specified queries
published 2022 · Machine Learning · 3 citations
with Shogo Hayashi, Hisashi Kashima
Optimal adaptive allocation using deep reinforcement learning in a dose‐response study
published 2021 · Statistics in Medicine · 4 citations
with Kentaro Matsuura, Imad El Hanafi, Takashi Sozu, Kentaro Sakamaki
Polynomial-Time Algorithms for Multiple-Arm Identification with Full-Bandit Feedback
published 2020 · Neural Computation · 12 citations · first circulated 2019
with Yuko Kuroki, Liyuan Xu, Atsushi Miyauchi, Masashi Sugiyama
working paper 2020 · arXiv · 5 citations
Bandit Algorithms Based on Thompson Sampling for Bounded Reward Distributions
published 2020 · Algorithmic Learning Theory · 11 citations
with Charles Riou
no link
A bad arm existence checking problem: How to utilize asymmetric problem structure?
published 2019 · Machine Learning · 7 citations
with Koji Tabata, Atsuyoshi Nakamura, Tamiki Komatsuzaki
Unsupervised Domain Adaptation Based on Source-Guided Discrepancy
published 2019 · Proceedings of the AAAI Conference on Artificial Intelligence · 49 citations · first circulated 2018
with Seiichi Kuroki, Nontawat Charoenphakdee, Han Bao, Issei Sato, Masashi Sugiyama
Dueling Bandits with Qualitative Feedback
published 2019 · Proceedings of the AAAI Conference on Artificial Intelligence · 4 citations · first circulated 2018
with Liyuan Xu, Masashi Sugiyama
Good arm identification via bandit feedback
published 2019 · Machine Learning · 2 citations
with Hideaki Kano, Kentaro Sakamaki, Kentaro Matsuura, Atsuyoshi Nakamura, Masashi Sugiyama
Nonconvex Optimization for Regression with Fairness Constraints.
published 2018 · International Conference on Machine Learning · 62 citations
no link
A fully adaptive algorithm for pure exploration in linear bandits.
published 2018 · International Conference on Artificial Intelligence and Statistics · 37 citations · first circulated 2017
with Liyuan Xu, Masashi Sugiyama
Worst-case Redundancy of Optimal Binary AIFV Codes and Their Extended Codes
published 2017 · IEEE Transactions on Information Theory · 28 citations · first circulated 2016
with Weihua Hu, H. Yamamoto
Position-based Multiple-play Bandit Problem with Unknown Position Bias
published 2017 · Neural Information Processing Systems · 13 citations
no link
Normal bandits of unknown means and variances
published 2017 · Journal of Machine Learning Research · 63 citations · first circulated 2015
with Wesley Cowan, Michael N. Katehakis
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
Almost Instantaneous Fixed-to-Variable Length Codes
published 2015 · IEEE Transactions on Information Theory · 36 citations
with H. Yamamoto, Masato Tsuchihashi
Non-asymptotic analysis of a new bandit algorithm for semi-bounded rewards
published 2015 · Journal of Machine Learning Research · 32 citations
with Akimichi Takemura
no link
Variable Length Lossy Coding Using an LDPC Code
published 2013 · IEEE Transactions on Information Theory · 17 citations · first circulated 2009
with H. Yamamoto
Polar Coding Without Alphabet Extension for Asymmetric Models
published 2013 · IEEE Transactions on Information Theory · 200 citations
with H. Yamamoto
An asymptotically optimal policy for finite support models in the multiarmed bandit problem
published 2011 · Machine Learning · 86 citations · first circulated 2009
with Akimichi Takemura
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).