Follow
Shinji Ito
Shinji Ito
Verified email at mist.i.u-tokyo.ac.jp - Homepage
Title
Cited by
Cited by
Year
Optimization beyond prediction: Prescriptive price optimization
S Ito, R Fujimaki
Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge …, 2017
532017
Large-scale price optimization via network flow
S Ito, R Fujimaki
Advances in Neural Information Processing Systems 29, 3855-3863, 2016
482016
Parameter-Free Multi-Armed Bandit Algorithms with Hybrid Data-Dependent Regret Bounds
S Ito
Conference on Learning Theory, 2552-2583, 2021
362021
Causal bandits with propagating inference
A Yabe, D Hatano, H Sumita, S Ito, N Kakimura, T Fukunaga, ...
International Conference on Machine Learning, 5512-5520, 2018
342018
Delay and cooperation in nonstochastic linear bandits
S Ito, D Hatano, H Sumita, K Takemura, T Fukunaga, N Kakimura, ...
Advances in Neural Information Processing Systems 33, 4872-4883, 2020
262020
Unbiased objective estimation in predictive optimization
S Ito, A Yabe, R Fujimaki
International Conference on Machine Learning, 2176-2185, 2018
262018
Nearly Optimal Best-of-Both-Worlds Algorithms for Online Learning with Feedback Graphs
S Ito, T Tsuchiya, J Honda
arXiv preprint arXiv:2206.00873, 2022
252022
An algorithm for the generalized eigenvalue problem for nonsquare matrix pencils by minimal perturbation approach
S Ito, K Murota
SIAM Journal on Matrix Analysis and Applications 37 (1), 409-419, 2016
212016
Best-of-both-worlds algorithms for partial monitoring
T Tsuchiya, S Ito, J Honda
International Conference on Algorithmic Learning Theory, 1484-1515, 2023
202023
On optimal robustness to adversarial corruption in online decision problems
S Ito
Advances in Neural Information Processing Systems 34, 7409-7420, 2021
202021
Robust Quadratic Programming for Price Optimization.
A Yabe, S Ito, R Fujimaki
IJCAI, 4648-4654, 2017
172017
Adversarially Robust Multi-Armed Bandit Algorithm with Variance-Dependent Regret Bounds
S Ito, T Tsuchiya, J Honda
Conference on Learning Theory, 1421-1422, 2022
162022
Hybrid regret bounds for combinatorial semi-bandits and adversarial linear bandits
S Ito
Advances in Neural Information Processing Systems 34, 2654-2667, 2021
162021
A Parameter-Free Algorithm for Misspecified Linear Contextual Bandits
K Takemura, S Ito, D Hatano, H Sumita, T Fukunaga, N Kakimura, ...
International Conference on Artificial Intelligence and Statistics, 3367-3375, 2021
162021
A tight lower bound and efficient reduction for swap regret
S Ito
Advances in Neural Information Processing Systems 33, 18550-18559, 2020
162020
Stable polefinding and rational least-squares fitting via eigenvalues
S Ito, Y Nakatsukasa
Numerische Mathematik 139, 633-682, 2018
162018
Tight first-and second-order regret bounds for adversarial linear bandits
S Ito, S Hirahara, T Soma, Y Yoshida
Advances in Neural Information Processing Systems 33, 2028-2038, 2020
142020
Submodular function minimization with noisy evaluation oracle
S Ito
Advances in Neural Information Processing Systems 32, 12103-12113, 2019
122019
Single Loop Gaussian Homotopy Method for Non-convex Optimization
H Iwakiri, Y Wang, S Ito, A Takeda
Advances in Neural Information Processing Systems 35, 7065-7076, 2022
112022
An Optimal Algorithm for Bandit Convex Optimization with Strongly-Convex and Smooth Loss
S Ito
International Conference on Artificial Intelligence and Statistics, 2229-2239, 2020
112020
The system can't perform the operation now. Try again later.
Articles 1–20