Junya Honda

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 80

Top Topics

Asymptotic Analysis

Bandit Problems

Top Venues

Publications

Or Raveh, Junya Honda, Masashi Sugiyama
Multi-Player Approaches for Dueling Bandits. CoRR (2024)
Jongyeong Lee, Junya Honda, Shinji Ito, Min-hwan Oh
Follow-the-Perturbed-Leader with Fréchet-type Tail Distributions: Optimality in Adversarial Bandits and Best-of-Both-Worlds. CoRR (2024)
Jongyeong Lee, Junya Honda, Shinji Ito, Min-hwan Oh
Follow-the-Perturbed-Leader with Fréchet-type Tail Distributions: Optimality in Adversarial Bandits and Best-of-Both-Worlds. COLT (2024)
Kazuma Shimizu, Junya Honda, Shinji Ito, Shinji Nakadai
Learning with Posterior Sampling for Revenue Management under Time-varying Demand. CoRR (2024)
Taira Tsuchiya, Shinji Ito, Junya Honda
Exploration by Optimization with Hybrid Regularizers: Logarithmic Regret with Adversarial Robustness in Partial Monitoring. CoRR (2024)
Shinji Ito, Taira Tsuchiya, Junya Honda
Adaptive Learning Rate for Follow-the-Regularized-Leader: Competitive Analysis and Best-of-Both-Worlds. COLT (2024)
Shinji Ito, Taira Tsuchiya, Junya Honda
Adaptive Learning Rate for Follow-the-Regularized-Leader: Competitive Analysis and Best-of-Both-Worlds. CoRR (2024)
Dorian Baudry, Kazuya Suzuki, Junya Honda
A General Recipe for the Analysis of Randomized Multi-Armed Bandit Algorithms. CoRR (2023)
Jongyeong Lee, Junya Honda, Chao-Kai Chiang, Masashi Sugiyama
Optimality of Thompson Sampling with Noninformative Priors for Pareto Bandits. ICML (2023)
Taira Tsuchiya, Shinji Ito, Junya Honda
Stability-penalty-adaptive follow-the-regularized-leader: Sparsity, game-dependency, and best-of-both-worlds. NeurIPS (2023)
Jongyeong Lee, Junya Honda, Masashi Sugiyama
Thompson Exploration with Best Challenger Rule in Best Arm Identification. CoRR (2023)
Jongyeong Lee, Junya Honda, Chao-Kai Chiang, Masashi Sugiyama
Optimality of Thompson Sampling with Noninformative Priors for Pareto Bandits. CoRR (2023)
Taira Tsuchiya, Shinji Ito, Junya Honda
Best-of-Both-Worlds Algorithms for Partial Monitoring. ALT (2023)
Taira Tsuchiya, Shinji Ito, Junya Honda
Further Adaptive Best-of-Both-Worlds Algorithm for Combinatorial Semi-Bandits. AISTATS (2023)
Junya Honda, Shinji Ito, Taira Tsuchiya
Follow-the-Perturbed-Leader Achieves Best-of-Both-Worlds for Bandit Problems. ALT (2023)
Taira Tsuchiya, Shinji Ito, Junya Honda
Stability-penalty-adaptive Follow-the-regularized-leader: Sparsity, Game-dependency, and Best-of-both-worlds. CoRR (2023)
Jongyeong Lee, Junya Honda, Masashi Sugiyama
Thompson Exploration with Best Challenger Rule in Best Arm Identification. ACML (2023)
Shinji Ito, Taira Tsuchiya, Junya Honda
Nearly Optimal Best-of-Both-Worlds Algorithms for Online Learning with Feedback Graphs. CoRR (2022)
Shinji Ito, Taira Tsuchiya, Junya Honda
Adversarially Robust Multi-Armed Bandit Algorithm with Variance-Dependent Regret Bounds. CoRR (2022)
Shogo Hayashi, Junya Honda, Hisashi Kashima
Bayesian optimization with partially specified queries. Mach. Learn. 111 (3) (2022)
Shinji Ito, Taira Tsuchiya, Junya Honda
Adversarially Robust Multi-Armed Bandit Algorithm with Variance-Dependent Regret Bounds. COLT (2022)
Junpei Komiyama, Taira Tsuchiya, Junya Honda
Globally Optimal Algorithms for Fixed-Budget Best Arm Identification. CoRR (2022)
Charles Riou, Junya Honda, Masashi Sugiyama
The Survival Bandit Problem. CoRR (2022)
Taira Tsuchiya, Shinji Ito, Junya Honda
Best-of-Both-Worlds Algorithms for Partial Monitoring. CoRR (2022)
Junpei Komiyama, Taira Tsuchiya, Junya Honda
Minimax Optimal Algorithms for Fixed-Budget Best Arm Identification. NeurIPS (2022)
Shinji Ito, Taira Tsuchiya, Junya Honda
Nearly Optimal Best-of-Both-Worlds Algorithms for Online Learning with Feedback Graphs. NeurIPS (2022)
Junpei Komiyama, Edouard Fouché, Junya Honda
Finite-time Analysis of Globally Nonstationary Multi-Armed Bandits. CoRR (2021)
Ikko Yamane, Junya Honda, Florian Yger, Masashi Sugiyama
Mediated Uncoupled Learning: Learning Functions without Direct Input-output Correspondences. ICML (2021)
Ikko Yamane, Junya Honda, Florian Yger, Masashi Sugiyama
Mediated Uncoupled Learning: Learning Functions without Direct Input-output Correspondences. CoRR (2021)
Koji Tabata, Atsuyoshi Nakamura, Junya Honda, Tamiki Komatsuzaki
A bad arm existence checking problem: How to utilize asymmetric problem structure? Mach. Learn. 109 (2) (2020)
Hideaki Imamura, Nontawat Charoenphakdee, Futoshi Futami, Issei Sato, Junya Honda, Masashi Sugiyama
Time-varying Gaussian Process Bandit Optimization with Non-constant Evaluation Time. CoRR (2020)
Yuko Kuroki, Atsushi Miyauchi, Junya Honda, Masashi Sugiyama
Online Dense Subgraph Discovery via Blurred-Graph Feedback. CoRR (2020)
Yuko Kuroki, Liyuan Xu, Atsushi Miyauchi, Junya Honda, Masashi Sugiyama
Polynomial-Time Algorithms for Multiple-Arm Identification with Full-Bandit Feedback. Neural Comput. 32 (9) (2020)
Taira Tsuchiya, Junya Honda, Masashi Sugiyama
Analysis and Design of Thompson Sampling for Stochastic Partial Monitoring. CoRR (2020)
Charles Riou, Junya Honda
Bandit Algorithms Based on Thompson Sampling for Bounded Reward Distributions. ALT (2020)
Yuko Kuroki, Atsushi Miyauchi, Junya Honda, Masashi Sugiyama
Online Dense Subgraph Discovery via Blurred-Graph Feedback. ICML (2020)
Yuko Kuroki, Junya Honda, Masashi Sugiyama
Combinatorial Pure Exploration with Full-bandit Feedback and Beyond: Solving Combinatorial Optimization under Uncertainty with Limited Observation. CoRR (2020)
Masahiro Kato, Takuya Ishihara, Junya Honda, Yusuke Narita
Adaptive Experimental Design for Efficient Treatment Effect Estimation: Randomized Allocation via Contextual Bandit Algorithm. CoRR (2020)
Taira Tsuchiya, Junya Honda, Masashi Sugiyama
Analysis and Design of Thompson Sampling for Stochastic Partial Monitoring. NeurIPS (2020)
Chenri Ni, Nontawat Charoenphakdee, Junya Honda, Masashi Sugiyama
On Possibility and Impossibility of Multiclass Classification with Rejection. CoRR (2019)
Seiichi Kuroki, Nontawat Charoenphakdee, Han Bao, Junya Honda, Issei Sato, Masashi Sugiyama
Unsupervised Domain Adaptation Based on Source-Guided Discrepancy. AAAI (2019)
Hideaki Kano, Junya Honda, Kentaro Sakamaki, Kentaro Matsuura, Atsuyoshi Nakamura, Masashi Sugiyama
Good arm identification via bandit feedback. Mach. Learn. 108 (5) (2019)
Yuko Kuroki, Liyuan Xu, Atsushi Miyauchi, Junya Honda, Masashi Sugiyama
Polynomial-time Algorithms for Combinatorial Pure Exploration with Full-bandit Feedback. CoRR (2019)
Liyuan Xu, Junya Honda, Gang Niu, Masashi Sugiyama
Uncoupled Regression from Pairwise Comparison Data. CoRR (2019)
Chenri Ni, Nontawat Charoenphakdee, Junya Honda, Masashi Sugiyama
On the Calibration of Multiclass Classification with Rejection. NeurIPS (2019)
Junya Honda
A Note on KL-UCB+ Policy for the Stochastic Bandit. CoRR (2019)
Liyuan Xu, Junya Honda, Masashi Sugiyama
Dueling Bandits with Qualitative Feedback. AAAI (2019)
Koji Tabata, Atsuyoshi Nakamura, Junya Honda, Tamiki Komatsuzaki
A Bad Arm Existence Checking Problem. CoRR (2019)
Masahiro Kato, Takeshi Teshima, Junya Honda
Learning from Positive and Unlabeled Data with a Selection Bias. ICLR (Poster) (2019)
Liyuan Xu, Junya Honda, Gang Niu, Masashi Sugiyama
Uncoupled Regression from Pairwise Comparison Data. NeurIPS (2019)
Junpei Komiyama, Akiko Takeda, Junya Honda, Hajime Shimao
Nonconvex Optimization for Regression with Fairness Constraints. ICML (2018)
Liyuan Xu, Junya Honda, Masashi Sugiyama
Dueling Bandits with Qualitative Feedback. CoRR (2018)
Seiichi Kuroki, Nontawat Charoenphakdee, Han Bao, Junya Honda, Issei Sato, Masashi Sugiyama
Unsupervised Domain Adaptation Based on Source-guided Discrepancy. CoRR (2018)
Liyuan Xu, Junya Honda, Masashi Sugiyama
A fully adaptive algorithm for pure exploration in linear bandits. AISTATS (2018)
Junya Honda
Exact Asymptotics of Random Coding Error Probability for General Memoryless Channels. ISIT (2018)
Junya Honda, Hirosuke Yamamoto
Yariable-to-fixed length homophonie coding suitable for asymmetric channel coding. ISIT (2017)
Junya Honda
Comprehensive Analysis on Exact Asymptotics of Random Coding Error Probability. CoRR (2017)
Junya Honda, Hirosuke Yamamoto
Variable-to-Fixed Length Homophonic Coding Suitable for Asymmetric Channel Coding. CoRR (2017)
Wesley Cowan, Junya Honda, Michael N. Katehakis
Normal Bandits of Unknown Means and Variances. J. Mach. Learn. Res. 18 (2017)
Junpei Komiyama, Junya Honda, Akiko Takeda
Position-based Multiple-play Bandit Problem with Unknown Position Bias. NIPS (2017)
Weihua Hu, Hirosuke Yamamoto, Junya Honda
Worst-case Redundancy of Optimal Binary AIFV Codes and Their Extended Codes. IEEE Trans. Inf. Theory 63 (8) (2017)
Junpei Komiyama, Junya Honda, Hiroshi Nakagawa
Copeland Dueling Bandit Problem: Regret Lower Bound, Optimal Algorithm, and Computationally Efficient Algorithm. ICML (2016)
Junya Honda, Hirosuke Yamamoto
Variable-to-fixed length homophonie coding with a modified Shannon-Fano-Elias code. ISITA (2016)
Weihua Hu, Hirosuke Yamamoto, Junya Honda
Worst-case Redundancy of Optimal Binary AIFV Codes and their Extended Codes. CoRR (2016)
Junya Honda, Hirosuke Yamamoto
Variable-to-Fixed Length Homophonic Coding with a Modified Shannon-Fano-Elias Code. CoRR (2016)
Junpei Komiyama, Junya Honda, Hiroshi Nakagawa
Copeland Dueling Bandit Problem: Regret Lower Bound, Optimal Algorithm, and Computationally Efficient Algorithm. CoRR (2016)
Weihua Hu, Hirosuke Yamamoto, Junya Honda
Tight upper bounds on the redundancy of optimal binary AIFV codes. ISIT (2016)
Junpei Komiyama, Junya Honda, Hiroshi Nakagawa
Regret Lower Bound and Optimal Algorithm in Finite Stochastic Partial Monitoring. NIPS (2015)
Junpei Komiyama, Junya Honda, Hisashi Kashima, Hiroshi Nakagawa
Regret Lower Bound and Optimal Algorithm in Dueling Bandit Problem. CoRR (2015)
Hirosuke Yamamoto, Masato Tsuchihashi, Junya Honda
Almost Instantaneous Fixed-to-Variable Length Codes. IEEE Trans. Inf. Theory 61 (12) (2015)
Junpei Komiyama, Junya Honda, Hisashi Kashima, Hiroshi Nakagawa
Regret Lower Bound and Optimal Algorithm in Dueling Bandit Problem. COLT (2015)
Junpei Komiyama, Junya Honda, Hiroshi Nakagawa
Regret Lower Bound and Optimal Algorithm in Finite Stochastic Partial Monitoring. CoRR (2015)
Junpei Komiyama, Junya Honda, Hiroshi Nakagawa
Optimal Regret Analysis of Thompson Sampling in Stochastic Multi-armed Bandit Problem with Multiple Plays. ICML (2015)
Junya Honda
Exact asymptotics for the random coding error probability. ISIT (2015)
Runxin Wang, Junya Honda, Hirosuke Yamamoto, Rongke Liu, Yi Hou
Construction of polar codes for channels with memory. ITW Fall (2015)
Junya Honda
Exact Asymptotics for the Random Coding Error Probability. CoRR (2015)
Junya Honda, Akimichi Takemura
Non-asymptotic analysis of a new bandit algorithm for semi-bounded rewards. J. Mach. Learn. Res. 16 (2015)
Junpei Komiyama, Junya Honda, Hiroshi Nakagawa
Optimal Regret Analysis of Thompson Sampling in Stochastic Multi-armed Bandit Problem with Multiple Plays. CoRR (2015)
Runxin Wang, Junya Honda, Hirosuke Yamamoto, Rongke Liu
FV polar coding for lossy compression with an improved exponent. ISIT (2015)
Hirosuke Yamamoto, Masato Tsuchihashi, Junya Honda
Almost Instantaneous Fix-to-Variable Length Codes. CoRR (2015)
Noboru Kunihiro, Junya Honda
RSA meets DPA: Recovering RSA Secret Keys from Noisy Analog Data. IACR Cryptol. ePrint Arch. 2014 (2014)
Junya Honda, Akimichi Takemura
Optimality of Thompson Sampling for Gaussian Bandits Depends on Priors. AISTATS (2014)
Junya Honda, Hirosuke Yamamoto
Variable Length Lossy Coding Using an LDPC Code. IEEE Trans. Inf. Theory 60 (1) (2014)
Noboru Kunihiro, Junya Honda
RSA Meets DPA: Recovering RSA Secret Keys from Noisy Analog Data. CHES (2014)
Junya Honda, Hirosuke Yamamoto
Polar Coding Without Alphabet Extension for Asymmetric Models. IEEE Trans. Inf. Theory 59 (12) (2013)
Junya Honda, Hirosuke Yamamoto
). ISITA (2012)
Junya Honda, Akimichi Takemura
Stochastic Bandit Based on Empirical Moments. AISTATS (2012)
Junya Honda, Hirosuke Yamamoto
Polar coding without alphabet extension for asymmetric channels. ISIT (2012)
Junya Honda, Akimichi Takemura
An asymptotically optimal policy for finite support models in the multiarmed bandit problem. Mach. Learn. 85 (3) (2011)
Junya Honda, Akimichi Takemura
An Asymptotically Optimal Bandit Algorithm for Bounded Support Models. COLT (2010)
Junya Honda, Hirosuke Yamamoto
Variable length lossy coding using an LDPC code. ISIT (2009)