Tianyuan Jin
Cited by
Cited by
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
Mots: Minimax optimal thompson sampling
T Jin, P Xu, J Shi, X Xiao, Q Gu
International Conference on Machine Learning, 5074-5083, 2021
Efficient Pure Exploration in Adaptive Round model
T Jin, J Shi, X Xiao, E Chen
Advances in Neural Information Processing Systems, 6605-6614, 2019
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
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
Double explore-then-commit: Asymptotic optimality and beyond
T Jin, P Xu, X Xiao, Q Gu
Conference on Learning Theory, 2584-2633, 2021
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
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
Optimal streaming algorithms for multi-armed bandits
T Jin, K Huang, J Tang, X Xiao
International Conference on Machine Learning, 5045-5054, 2021
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
Finite-Time Regret of Thompson Sampling Algorithms for Exponential Family Multi-Armed Bandits
T Jin, P Xu, X Xiao, A Anandkumar
arXiv preprint arXiv:2206.03520, 2022
The system can't perform the operation now. Try again later.
Articles 1–11