| An efficient algorithm for generalized linear bandit: Online stochastic gradient descent and thompson sampling Q Ding, CJ Hsieh, J Sharpnack International Conference on Artificial Intelligence and Statistics, 1585-1593, 2021 | 40 | 2021 |
| Robust stochastic linear contextual bandits under adversarial attacks Q Ding, CJ Hsieh, J Sharpnack International Conference on Artificial Intelligence and Statistics, 7111-7123, 2022 | 35 | 2022 |
| A fast sampling algorithm for maximum inner product search Q Ding, HF Yu, CJ Hsieh The 22nd International Conference on Artificial Intelligence and Statistics …, 2019 | 30 | 2019 |
| Syndicated bandits: A framework for auto tuning hyper-parameters in contextual bandit algorithms Q Ding, Y Kang, YW Liu, TCM Lee, CJ Hsieh, J Sharpnack Advances in Neural Information Processing Systems 35, 1170-1181, 2022 | 7 | 2022 |
| Multiscale non-stationary stochastic bandits Q Ding, CJ Hsieh, J Sharpnack arXiv preprint arXiv:2002.05289, 2020 | 2 | 2020 |
| Bivariate Binomial Moments and Bonferroni-Type Inequalities Q Ding, E Seneta Methodology and Computing in Applied Probability 19, 331-348, 2017 | 1 | 2017 |
| Advances in Stochastic Contextual Bandits Q Ding University of California, Davis, 2021 | | 2021 |
