Zixin Zhong

Orcid: 0000-0002-9810-7599

According to our database1, Zixin Zhong authored at least 12 papers between 2018 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Fast Beam Alignment via Pure Exploration in Multi-Armed Bandits.
IEEE Trans. Wirel. Commun., May, 2023

Almost Optimal Variance-Constrained Best Arm Identification.
IEEE Trans. Inf. Theory, April, 2023

Stochastic Gradient Succeeds for Bandits.
Proceedings of the International Conference on Machine Learning, 2023

Probably Anytime-Safe Stochastic Combinatorial Semi-Bandits.
Proceedings of the International Conference on Machine Learning, 2023

2022
Optimal Clustering with Bandit Feedback.
CoRR, 2022

Fast Beam Alignment via Pure Exploration in Multi-armed Bandits.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
Thompson Sampling Algorithms for Cascading Bandits.
J. Mach. Learn. Res., 2021

On the Pareto Frontier of Regret Minimization and Best Arm Identification in Stochastic Bandits.
CoRR, 2021

Probabilistic Sequential Shrinking: A Best Arm Identification Algorithm for Stochastic Bandits with Corruptions.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
Best Arm Identification for Cascading Bandits in the Fixed Confidence Setting.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
A Thompson Sampling Algorithm for Cascading Bandits.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018
Thompson Sampling for Cascading Bandits.
CoRR, 2018


  Loading...