default search action
Tianyuan Jin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c12]Tianyuan Jin, Hao-Lun Hsu, William Chang, Pan Xu:
Finite-Time Frequentist Regret Bounds of Multi-Agent Thompson Sampling on Sparse Hypergraphs. AAAI 2024: 12956-12964 - [c11]Xuanfei Ren, Tianyuan Jin, Pan Xu:
Optimal Batched Linear Bandits. ICML 2024 - [i12]Junwen Yang, Tianyuan Jin, Vincent Y. F. Tan:
Multi-Armed Bandits with Abstention. CoRR abs/2402.15127 (2024) - [i11]Tianyuan Jin, Kyoungseok Jang, Nicolò Cesa-Bianchi:
Sparsity-Agnostic Linear Bandits with Adaptive Adversaries. CoRR abs/2406.01192 (2024) - [i10]Xuanfei Ren, Tianyuan Jin, Pan Xu:
Optimal Batched Linear Bandits. CoRR abs/2406.04137 (2024) - [i9]Junwen Yang, Vincent Y. F. Tan, Tianyuan Jin:
Best Arm Identification with Minimal Regret. CoRR abs/2409.18909 (2024) - [i8]Tianyuan Jin, Keke Huang, Jing Tang, Xiaokui Xiao:
Optimal Streaming Algorithms for Multi-Armed Bandits. CoRR abs/2410.17835 (2024) - 2023
- [c10]Tianyuan Jin, Xianglin Yang, Xiaokui Xiao, Pan Xu:
Thompson Sampling with Less Exploration is Fast and Optimal. ICML 2023: 15239-15261 - [i7]Tianyuan Jin, Yu Yang, Jing Tang, Xiaokui Xiao, Pan Xu:
Optimal Batched Best Arm Identification. CoRR abs/2310.14129 (2023) - [i6]Tianyuan Jin, Hao-Lun Hsu, William Chang, Pan Xu:
Finite-Time Frequentist Regret Bounds of Multi-Agent Thompson Sampling on Sparse Hypergraphs. CoRR abs/2312.15549 (2023) - 2022
- [c9]Tianyuan Jin, Pan Xu, Xiaokui Xiao, Anima Anandkumar:
Finite-Time Regret of Thompson Sampling Algorithms for Exponential Family Multi-Armed Bandits. NeurIPS 2022 - [i5]Tianyuan Jin, Pan Xu, Xiaokui Xiao, Anima Anandkumar:
Finite-Time Regret of Thompson Sampling Algorithms for Exponential Family Multi-Armed Bandits. CoRR abs/2206.03520 (2022) - 2021
- [j3]Tianyuan Jin, Yu Yang
, Renchi Yang
Unconstrained Submodular Maximization with Modular Costs: Tight Approximation and Application to Profit Maximization. Proc. VLDB Endow. 14(10): 1756-1768 (2021) - [c8]Tianyuan Jin, Pan Xu, Xiaokui Xiao, Quanquan Gu:
Double Explore-then-Commit: Asymptotic Optimality and Beyond. COLT 2021: 2584-2633 - [c7]Tianyuan Jin, Keke Huang, Jing Tang, Xiaokui Xiao:
Optimal Streaming Algorithms for Multi-Armed Bandits. ICML 2021: 5045-5054 - [c6]Tianyuan Jin, Jing Tang, Pan Xu, Keke Huang, Xiaokui Xiao, Quanquan Gu:
Almost Optimal Anytime Algorithm for Batched Multi-Armed Bandits. ICML 2021: 5065-5073 - [c5]Tianyuan Jin, Pan Xu, Jieming Shi
MOTS: Minimax Optimal Thompson Sampling. ICML 2021: 5074-5083 - 2020
- [j2]Jieming Shi
Realtime Index-Free Single Source SimRank Processing on Web-Scale Graphs. Proc. VLDB Endow. 13(7): 966-978 (2020) - [i4]Jieming Shi, Tianyuan Jin, Renchi Yang, Xiaokui Xiao, Yin Yang:
Realtime Index-Free Single Source SimRank Processing on Web-Scale Graphs. CoRR abs/2002.08082 (2020) - [i3]Tianyuan Jin, Pan Xu, Xiaokui Xiao, Quanquan Gu:
Double Explore-then-Commit: Asymptotic Optimality and Beyond. CoRR abs/2002.09174 (2020) - [i2]Tianyuan Jin, Pan Xu, Jieming Shi, Xiaokui Xiao, Quanquan Gu:
MOTS: Minimax Optimal Thompson Sampling. CoRR abs/2003.01803 (2020)
2010 – 2019
- 2019
- [j1]Jieming Shi
Realtime Top-k Personalized PageRank over Large Graphs on GPUs. Proc. VLDB Endow. 13(1): 15-28 (2019) - [c4]Yu Yang
Tracking Top-k Influential Users with Relative Errors. CIKM 2019: 1783-1792 - [c3]Tianyuan Jin, Jieming Shi, Xiaokui Xiao, Enhong Chen:
Efficient Pure Exploration in Adaptive Round model. NeurIPS 2019: 6605-6614 - 2018
- [c2]Tianyuan Jin, Tong Xu, Hui Zhong, Enhong Chen, Zhefeng Wang, Qi Liu:
Maximizing the Effect of Information Adoption: A General Framework. SDM 2018: 693-701 - [i1]Yu Yang, Zhefeng Wang, Tianyuan Jin, Jian Pei, Enhong Chen:
Tracking Top-K Influential Vertices in Dynamic Networks. CoRR abs/1803.01499 (2018) - 2017
- [c1]Le Zhang, Tianyuan Jin, Tong Xu, Biao Chang, Zhefeng Wang, Enhong Chen:
A Markov Chain Monte Carlo Approach for Source Detection in Networks. SMP 2017: 77-88
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-28 20:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: