Shinji Ito

Trans. Mach. Learn. Res., 2024

A Simple and Adaptive Learning Rate for FTRL in Online Learning with Minimax Regret of θ(T<sup>2/3</sup>) and its Application to Best-of-Both-Worlds.

[BibT_eX]

[DOI]

CoRR, 2024

Online L<sup>♮</sup>-Convex Minimization.

[BibT_eX]

[DOI]

CoRR, 2024

LC-Tsalis-INF: Generalized Best-of-Both-Worlds Linear Contextual Bandits.

[BibT_eX]

[DOI]

Masahiro Kato

CoRR, 2024

Fast Rates in Online Convex Optimization by Exploiting the Curvature of Feasible Sets.

[BibT_eX]

[DOI]

CoRR, 2024

Replicability is Asymptotically Free in Multi-armed Bandits.

[BibT_eX]

[DOI]

CoRR, 2024

Online $\textrm{L}^{\natural }$-Convex Minimization.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning and Knowledge Discovery in Databases. Research Track, 2024

Learning with Posterior Sampling for Revenue Management under Time-varying Demand.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

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

[BibT_eX]

[DOI]

Proceedings of the Forty-first International Conference on Machine Learning, 2024

Follow-the-Perturbed-Leader with Fréchet-type Tail Distributions: Optimality in Adversarial Bandits and Best-of-Both-Worlds.

[BibT_eX]

[DOI]

Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

Adaptive Learning Rate for Follow-the-Regularized-Leader: Competitive Analysis and Best-of-Both-Worlds.

[BibT_eX]

[DOI]

Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Stability-penalty-adaptive follow-the-regularized-leader: Sparsity, game-dependency, and best-of-both-worlds.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

An Exploration-by-Optimization Approach to Best of Both Worlds in Linear Bandits.

[BibT_eX]

[DOI]

Kei Takemura

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Bandit Task Assignment with Unknown Processing Time.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Best-of-Three-Worlds Linear Bandit Algorithm with Variance-Adaptive Regret Bounds.

[BibT_eX]

[DOI]

Kei Takemura

Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Best-of-Both-Worlds Algorithms for Partial Monitoring.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Algorithmic Learning Theory, 2023

Follow-the-Perturbed-Leader Achieves Best-of-Both-Worlds for Bandit Problems.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Algorithmic Learning Theory, 2023

Further Adaptive Best-of-Both-Worlds Algorithm for Combinatorial Semi-Bandits.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

Maximization of Minimum Weighted Hamming Distance between Set Pairs.

[BibT_eX]

[DOI]

Tatsuya Matsuoka

Proceedings of the Asian Conference on Machine Learning, 2023

2022

Average Sensitivity of Euclidean k-Clustering.

[BibT_eX]

[DOI]

Yuichi Yoshida

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Single Loop Gaussian Homotopy Method for Non-convex Optimization.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Revisiting Online Submodular Minimization: Gap-Dependent Regret Bounds, Best of Both Worlds and Adversarial Robustness.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2022

Adversarially Robust Multi-Armed Bandit Algorithm with Variance-Dependent Regret Bounds.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

Online Task Assignment Problems with Reusable Resources.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

On Optimal Robustness to Adversarial Corruption in Online Decision Problems.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Hybrid Regret Bounds for Combinatorial Semi-Bandits and Adversarial Linear Bandits.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Parameter-Free Multi-Armed Bandit Algorithms with Hybrid Data-Dependent Regret Bounds.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2021

A Parameter-Free Algorithm for Misspecified Linear Contextual Bandits.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

Tracking Regret Bounds for Online Submodular Optimization.

[BibT_eX]

[DOI]

Tatsuya Matsuoka

Naoto Ohsaka

Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Tight First- and Second-Order Regret Bounds for Adversarial Linear Bandits.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Delay and Cooperation in Nonstochastic Linear Bandits.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

A Tight Lower Bound and Efficient Reduction for Swap Regret.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

An Optimal Algorithm for Bandit Convex Optimization with Strongly-Convex and Smooth Loss.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019

Improved Regret Bounds for Bandit Combinatorial Optimization.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Submodular Function Minimization with Noisy Evaluation Oracle.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

An Arm-Wise Randomization Approach to Combinatorial Linear Semi-Bandits.

[BibT_eX]

[DOI]

Kei Takemura

Proceedings of the 2019 IEEE International Conference on Data Mining, 2019

2018

Stable polefinding and rational least-squares fitting via eigenvalues.

[BibT_eX]

[DOI]

Yuji Nakatsukasa

Numerische Mathematik, 2018

Compressed Vector Set: A Fast and Space-Efficient Data Mining Framework.

[BibT_eX]

[DOI]

J. Inf. Process., 2018

Regret Bounds for Online Portfolio Selection with a Cardinality Constraint.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Causal Bandits with Propagating Inference.

[BibT_eX]

[DOI]

Proceedings of the 35th International Conference on Machine Learning, 2018

Unbiased Objective Estimation in Predictive Optimization.

[BibT_eX]

[DOI]

Akihiro Yabe

Proceedings of the 35th International Conference on Machine Learning, 2018

Online Regression with Partial Information: Generalization and Linear Projection.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

2017

Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Optimization Beyond Prediction: Prescriptive Price Optimization.

[BibT_eX]

[DOI]

Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, August 13, 2017

Robust Quadratic Programming for Price Optimization.

[BibT_eX]

[DOI]

Akihiro Yabe

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016

An Algorithm for the Generalized Eigenvalue Problem for Nonsquare Matrix Pencils by Minimal Perturbation Approach.

[BibT_eX]

[DOI]

Kazuo Murota

SIAM J. Matrix Anal. Appl., 2016

Large-Scale Price Optimization via Network Flow.

[BibT_eX]

[DOI]