Picture for Tianyuan Jin

Tianyuan Jin

Optimal Streaming Algorithms for Multi-Armed Bandits

Add code
Oct 23, 2024
Figure 1 for Optimal Streaming Algorithms for Multi-Armed Bandits
Viaarxiv icon

Best Arm Identification with Minimal Regret

Add code
Sep 27, 2024
Viaarxiv icon

Optimal Batched Linear Bandits

Add code
Jun 06, 2024
Viaarxiv icon

Sparsity-Agnostic Linear Bandits with Adaptive Adversaries

Add code
Jun 03, 2024
Viaarxiv icon

Multi-Armed Bandits with Abstention

Add code
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

Add code
Oct 21, 2023
Viaarxiv icon

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

Add code
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

Add code
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

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