Junya Honda - RankMe

103 papers A* 22A 6B 10C 3Journal 58Unranked 4

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