Junya Honda

According to our database1, Junya Honda authored at least 65 papers between 2010 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Exploration by Optimization with Hybrid Regularizers: Logarithmic Regret with Adversarial Robustness in Partial Monitoring.
CoRR, 2024

2023
Thompson Exploration with Best Challenger Rule in Best Arm Identification.
CoRR, 2023

A General Recipe for the Analysis of Randomized Multi-Armed Bandit Algorithms.
CoRR, 2023

Stability-penalty-adaptive follow-the-regularized-leader: Sparsity, game-dependency, and best-of-both-worlds.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Optimality of Thompson Sampling with Noninformative Priors for Pareto Bandits.
Proceedings of the International Conference on Machine Learning, 2023

Best-of-Both-Worlds Algorithms for Partial Monitoring.
Proceedings of the International Conference on Algorithmic Learning Theory, 2023

Follow-the-Perturbed-Leader Achieves Best-of-Both-Worlds for Bandit Problems.
Proceedings of the International Conference on Algorithmic Learning Theory, 2023

Further Adaptive Best-of-Both-Worlds Algorithm for Combinatorial Semi-Bandits.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
Bayesian optimization with partially specified queries.
Mach. Learn., 2022

Globally Optimal Algorithms for Fixed-Budget Best Arm Identification.
CoRR, 2022

The Survival Bandit Problem.
CoRR, 2022

Minimax Optimal Algorithms for Fixed-Budget Best Arm Identification.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Nearly Optimal Best-of-Both-Worlds Algorithms for Online Learning with Feedback Graphs.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Adversarially Robust Multi-Armed Bandit Algorithm with Variance-Dependent Regret Bounds.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021
Finite-time Analysis of Globally Nonstationary Multi-Armed Bandits.
CoRR, 2021

Mediated Uncoupled Learning: Learning Functions without Direct Input-output Correspondences.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
Polynomial-Time Algorithms for Multiple-Arm Identification with Full-Bandit Feedback.
Neural Comput., 2020

A bad arm existence checking problem: How to utilize asymmetric problem structure?
Mach. Learn., 2020

Combinatorial Pure Exploration with Full-bandit Feedback and Beyond: Solving Combinatorial Optimization under Uncertainty with Limited Observation.
CoRR, 2020

Time-varying Gaussian Process Bandit Optimization with Non-constant Evaluation Time.
CoRR, 2020

Adaptive Experimental Design for Efficient Treatment Effect Estimation: Randomized Allocation via Contextual Bandit Algorithm.
CoRR, 2020

Analysis and Design of Thompson Sampling for Stochastic Partial Monitoring.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Online Dense Subgraph Discovery via Blurred-Graph Feedback.
Proceedings of the 37th International Conference on Machine Learning, 2020

Bandit Algorithms Based on Thompson Sampling for Bounded Reward Distributions.
Proceedings of the Algorithmic Learning Theory, 2020

2019
Good arm identification via bandit feedback.
Mach. Learn., 2019

A Note on KL-UCB+ Policy for the Stochastic Bandit.
CoRR, 2019

Polynomial-time Algorithms for Combinatorial Pure Exploration with Full-bandit Feedback.
CoRR, 2019

A Bad Arm Existence Checking Problem.
CoRR, 2019

On Possibility and Impossibility of Multiclass Classification with Rejection.
CoRR, 2019

Uncoupled Regression from Pairwise Comparison Data.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

On the Calibration of Multiclass Classification with Rejection.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Learning from Positive and Unlabeled Data with a Selection Bias.
Proceedings of the 7th International Conference on Learning Representations, 2019

Dueling Bandits with Qualitative Feedback.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Unsupervised Domain Adaptation Based on Source-Guided Discrepancy.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Exact Asymptotics of Random Coding Error Probability for General Memoryless Channels.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Nonconvex Optimization for Regression with Fairness Constraints.
Proceedings of the 35th International Conference on Machine Learning, 2018

A fully adaptive algorithm for pure exploration in linear bandits.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

2017
Worst-case Redundancy of Optimal Binary AIFV Codes and Their Extended Codes.
IEEE Trans. Inf. Theory, 2017

Normal Bandits of Unknown Means and Variances.
J. Mach. Learn. Res., 2017

Variable-to-Fixed Length Homophonic Coding Suitable for Asymmetric Channel Coding.
CoRR, 2017

Comprehensive Analysis on Exact Asymptotics of Random Coding Error Probability.
CoRR, 2017

Position-based Multiple-play Bandit Problem with Unknown Position Bias.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Yariable-to-fixed length homophonie coding suitable for asymmetric channel coding.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Variable-to-Fixed Length Homophonic Coding with a Modified Shannon-Fano-Elias Code.
CoRR, 2016

Variable-to-fixed length homophonie coding with a modified Shannon-Fano-Elias code.
Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

Tight upper bounds on the redundancy of optimal binary AIFV codes.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Copeland Dueling Bandit Problem: Regret Lower Bound, Optimal Algorithm, and Computationally Efficient Algorithm.
Proceedings of the 33nd International Conference on Machine Learning, 2016

2015
Almost Instantaneous Fixed-to-Variable Length Codes.
IEEE Trans. Inf. Theory, 2015

Non-asymptotic analysis of a new bandit algorithm for semi-bounded rewards.
J. Mach. Learn. Res., 2015

Almost Instantaneous Fix-to-Variable Length Codes.
CoRR, 2015

Regret Lower Bound and Optimal Algorithm in Finite Stochastic Partial Monitoring.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Construction of polar codes for channels with memory.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

FV polar coding for lossy compression with an improved exponent.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Exact asymptotics for the random coding error probability.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Optimal Regret Analysis of Thompson Sampling in Stochastic Multi-armed Bandit Problem with Multiple Plays.
Proceedings of the 32nd International Conference on Machine Learning, 2015

Regret Lower Bound and Optimal Algorithm in Dueling Bandit Problem.
Proceedings of The 28th Conference on Learning Theory, 2015

2014
Variable Length Lossy Coding Using an LDPC Code.
IEEE Trans. Inf. Theory, 2014

RSA meets DPA: Recovering RSA Secret Keys from Noisy Analog Data.
IACR Cryptol. ePrint Arch., 2014

Optimality of Thompson Sampling for Gaussian Bandits Depends on Priors.
Proceedings of the Seventeenth International Conference on Artificial Intelligence and Statistics, 2014

2013
Polar Coding Without Alphabet Extension for Asymmetric Models.
IEEE Trans. Inf. Theory, 2013

2012
Stochastic Bandit Based on Empirical Moments.
Proceedings of the Fifteenth International Conference on Artificial Intelligence and Statistics, 2012

Fast Linear-Programming decoding of LDPC codes over GF(2<sup>m</sup>).
Proceedings of the International Symposium on Information Theory and its Applications, 2012

Polar coding without alphabet extension for asymmetric channels.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
An asymptotically optimal policy for finite support models in the multiarmed bandit problem.
Mach. Learn., 2011

2010
An Asymptotically Optimal Bandit Algorithm for Bounded Support Models.
Proceedings of the COLT 2010, 2010


  Loading...