Picture for Tianyuan Jin

Tianyuan Jin

Optimal Batched Linear Bandits

Add code
Jun 06, 2024
Viaarxiv icon

Sparsity-Agnostic Linear Bandits with Adaptive Adversaries

Jun 03, 2024
Viaarxiv icon

Multi-Armed Bandits with Abstention

Feb 23, 2024
Viaarxiv icon

Finite-Time Frequentist Regret Bounds of Multi-Agent Thompson Sampling on Sparse Hypergraphs

Add code
Dec 24, 2023
Viaarxiv icon

Optimal Batched Best Arm Identification

Oct 21, 2023
Figure 1 for Optimal Batched Best Arm Identification
Figure 2 for Optimal Batched Best Arm Identification
Figure 3 for Optimal Batched Best Arm Identification
Figure 4 for Optimal Batched Best Arm Identification
Viaarxiv icon

Finite-Time Regret of Thompson Sampling Algorithms for Exponential Family Multi-Armed Bandits

Jun 07, 2022
Figure 1 for Finite-Time Regret of Thompson Sampling Algorithms for Exponential Family Multi-Armed Bandits
Figure 2 for Finite-Time Regret of Thompson Sampling Algorithms for Exponential Family Multi-Armed Bandits
Viaarxiv icon

MOTS: Minimax Optimal Thompson Sampling

Mar 03, 2020
Figure 1 for MOTS: Minimax Optimal Thompson Sampling
Figure 2 for MOTS: Minimax Optimal Thompson Sampling
Viaarxiv icon

Double Explore-then-Commit: Asymptotic Optimality and Beyond

Feb 21, 2020
Figure 1 for Double Explore-then-Commit: Asymptotic Optimality and Beyond
Viaarxiv icon

Realtime Index-Free Single Source SimRank Processing on Web-Scale Graphs

Feb 19, 2020
Figure 1 for Realtime Index-Free Single Source SimRank Processing on Web-Scale Graphs
Figure 2 for Realtime Index-Free Single Source SimRank Processing on Web-Scale Graphs
Figure 3 for Realtime Index-Free Single Source SimRank Processing on Web-Scale Graphs
Figure 4 for Realtime Index-Free Single Source SimRank Processing on Web-Scale Graphs
Viaarxiv icon