| Realtime top-k personalized pagerank over large graphs on gpus J Shi, R Yang, T Jin, X Xiao, Y Yang Proceedings of the VLDB Endowment 13 (1), 15-28, 2019 | 42 | 2019 |
| Mots: Minimax optimal thompson sampling T Jin, P Xu, J Shi, X Xiao, Q Gu International Conference on Machine Learning, 5074-5083, 2021 | 39 | 2021 |
| Double explore-then-commit: Asymptotic optimality and beyond T Jin, P Xu, X Xiao, Q Gu Conference on Learning Theory, 2584-2633, 2021 | 25 | 2021 |
| Unconstrained submodular maximization with modular costs: Tight approximation and application to profit maximization T Jin, Y Yang, R Yang, J Shi, K Huang, X Xiao Proceedings of the VLDB Endowment 14 (10), 1756-1768, 2021 | 25 | 2021 |
| Optimal streaming algorithms for multi-armed bandits T Jin, K Huang, J Tang, X Xiao International Conference on Machine Learning, 5045-5054, 2021 | 21 | 2021 |
| Realtime index-free single source simrank processing on web-scale graphs J Shi, T Jin, R Yang, X Xiao, Y Yang arXiv preprint arXiv:2002.08082, 2020 | 21 | 2020 |
| Efficient Pure Exploration in Adaptive Round model T Jin, J Shi, X Xiao, E Chen Advances in Neural Information Processing Systems, 6605-6614, 2019 | 21 | 2019 |
| Almost optimal anytime algorithm for batched multi-armed bandits T Jin, J Tang, P Xu, K Huang, X Xiao, Q Gu International Conference on Machine Learning, 5065-5073, 2021 | 18 | 2021 |
| Finite-Time Regret of Thompson Sampling Algorithms for Exponential Family Multi-Armed Bandits T Jin, P Xu, X Xiao, A Anandkumar Advances in Neural Information Processing Systems, 2022 | 14 | 2022 |
| Thompson sampling with less exploration is fast and optimal T Jin, X Yang, X Xiao, P Xu International Conference on Machine Learning, 15239-15261, 2023 | 11 | 2023 |
| Tracking top-k influential users with relative errors Y Yang, Z Wang, T Jin, J Pei, E Chen Proceedings of the 28th ACM International Conference on Information and …, 2019 | 8* | 2019 |
| Maximizing the effect of information adoption: A general framework T Jin, T Xu, H Zhong, E Chen, Z Wang, Q Liu Proceedings of the 2018 SIAM International Conference on Data Mining, 693-701, 2018 | 5 | 2018 |
| Finite-time frequentist regret bounds of multi-agent thompson sampling on sparse hypergraphs T Jin, HL Hsu, W Chang, P Xu Proceedings of the AAAI Conference on Artificial Intelligence 38 (11), 12956 …, 2024 | 3 | 2024 |
| Optimal batched best arm identification T Jin, Y Yang, J Tang, X Xiao, P Xu arXiv preprint arXiv:2310.14129, 2023 | 3 | 2023 |
| Optimal Batched Linear Bandits X Ren, T Jin, P Xu arXiv preprint arXiv:2406.04137, 2024 | 2 | 2024 |
| Best Arm Identification with Minimal Regret J Yang, VYF Tan, T Jin arXiv preprint arXiv:2409.18909, 2024 | | 2024 |
| Sparsity-Agnostic Linear Bandits with Adaptive Adversaries T Jin, K Jang, N Cesa-Bianchi arXiv preprint arXiv:2406.01192, 2024 | | 2024 |
| Multi-Armed Bandits with Abstention J Yang, T Jin, VYF Tan arXiv preprint arXiv:2402.15127, 2024 | | 2024 |
Xiaokui XiaoNational University of Singapore在 nus.edu.sg 的电子邮件经过验证
