Tianyuan Jin

According to our database1, Tianyuan Jin authored at least 21 papers between 2017 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Breaking the log(1/Δ<sub>2</sub>) Barrier: Better Batched Best Arm Identification with Adaptive Grids.
CoRR, January, 2025

2024
Best Arm Identification with Minimal Regret.
CoRR, 2024

Multi-Armed Bandits with Abstention.
CoRR, 2024

Sparsity-Agnostic Linear Bandits with Adaptive Adversaries.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

Optimal Batched Best Arm Identification.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

Optimal Batched Linear Bandits.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Finite-Time Frequentist Regret Bounds of Multi-Agent Thompson Sampling on Sparse Hypergraphs.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Thompson Sampling with Less Exploration is Fast and Optimal.
Proceedings of the International Conference on Machine Learning, 2023

2022
Finite-Time Regret of Thompson Sampling Algorithms for Exponential Family Multi-Armed Bandits.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021
Unconstrained Submodular Maximization with Modular Costs: Tight Approximation and Application to Profit Maximization.
Proc. VLDB Endow., 2021

Almost Optimal Anytime Algorithm for Batched Multi-Armed Bandits.
Proceedings of the 38th International Conference on Machine Learning, 2021

Optimal Streaming Algorithms for Multi-Armed Bandits.
Proceedings of the 38th International Conference on Machine Learning, 2021

MOTS: Minimax Optimal Thompson Sampling.
Proceedings of the 38th International Conference on Machine Learning, 2021

Double Explore-then-Commit: Asymptotic Optimality and Beyond.
Proceedings of the Conference on Learning Theory, 2021

2020
Realtime Index-Free Single Source SimRank Processing on Web-Scale Graphs.
Proc. VLDB Endow., 2020

2019
Realtime Top-k Personalized PageRank over Large Graphs on GPUs.
Proc. VLDB Endow., 2019

Efficient Pure Exploration in Adaptive Round model.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Tracking Top-k Influential Users with Relative Errors.
Proceedings of the 28th ACM International Conference on Information and Knowledge Management, 2019

2018
Tracking Top-K Influential Vertices in Dynamic Networks.
CoRR, 2018

Maximizing the Effect of Information Adoption: A General Framework.
Proceedings of the 2018 SIAM International Conference on Data Mining, 2018

2017
A Markov Chain Monte Carlo Approach for Source Detection in Networks.
Proceedings of the Social Media Processing - 6th National Conference, 2017


  Loading...