Follow
Shinji Ito
Shinji Ito
Verified email at nec.com
Title
Cited by
Cited by
Year
Large-scale price optimization via network flow
S Ito, R Fujimaki
Advances in Neural Information Processing Systems 29, 3855-3863, 2016
332016
Optimization beyond prediction: Prescriptive price optimization
S Ito, R Fujimaki
Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge …, 2017
312017
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
172018
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
172016
Robust Quadratic Programming for Price Optimization.
A Yabe, S Ito, R Fujimaki
IJCAI, 4648-4654, 2017
142017
Unbiased objective estimation in predictive optimization
S Ito, A Yabe, R Fujimaki
International Conference on Machine Learning, 2176-2185, 2018
102018
Stable polefinding and rational least-squares fitting via eigenvalues
S Ito, Y Nakatsukasa
Numerische mathematik 139 (3), 633-682, 2018
102018
Parameter-Free Multi-Armed Bandit Algorithms with Hybrid Data-Dependent Regret Bounds
S Ito
Conference on Learning Theory, 2552-2583, 2021
92021
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
92020
Submodular function minimization with noisy evaluation oracle
S Ito
Advances in Neural Information Processing Systems 32, 12103-12113, 2019
82019
Regret bounds for online portfolio selection with a cardinality constraint
S Ito, D Hatano, H Sumita, A Yabe, T Fukunaga, N Kakimura, ...
Advances in Neural Information Processing Systems, 10588-10597, 2018
82018
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
72020
On optimal robustness to adversarial corruption in online decision problems
S Ito
Advances in Neural Information Processing Systems 34, 7409-7420, 2021
62021
Improved regret bounds for bandit combinatorial optimization
S Ito, D Hatano, H Sumita, K Takemura, T Fukunaga, N Kakimura, ...
Advances in Neural Information Processing Systems 32, 2019
62019
Oracle-efficient algorithms for online linear optimization with bandit feedback
S Ito, D Hatano, H Sumita, K Takemura, T Fukunaga, N Kakimura, ...
Advances in Neural Information Processing Systems 32, 10590-10599, 2019
62019
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
42020
Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation
S Ito, D Hatano, H Sumita, A Yabe, T Fukunaga, N Kakimura, ...
Advances in Neural Information Processing Systems, 4099-4108, 2017
42017
Hybrid regret bounds for combinatorial semi-bandits and adversarial linear bandits
S Ito
Advances in Neural Information Processing Systems 34, 2654-2667, 2021
32021
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
32021
A tight lower bound and efficient reduction for swap regret
S Ito
Advances in Neural Information Processing Systems 33, 18550-18559, 2020
22020
The system can't perform the operation now. Try again later.
Articles 1–20