Follow
Heyang Zhao
Heyang Zhao
Verified email at cs.ucla.edu - Homepage
Title
Cited by
Cited by
Year
Nearly minimax optimal reinforcement learning for linear markov decision processes
J He, H Zhao, D Zhou, Q Gu
International Conference on Machine Learning, 12790-12822, 2023
492023
Variance-dependent regret bounds for linear bandits and reinforcement learning: Adaptivity and computational efficiency
H Zhao, J He, D Zhou, T Zhang, Q Gu
The Thirty Sixth Annual Conference on Learning Theory, 2023
212023
Linear contextual bandits with adversarial corruptions
H Zhao, D Zhou, Q Gu
arXiv preprint arXiv:2110.12615, 2021
212021
Optimal online generalized linear regression with stochastic noise and its application to heteroscedastic bandits
H Zhao, D Zhou, J He, Q Gu
International Conference on Machine Learning, 42259-42279, 2023
11*2023
Variance-aware regret bounds for stochastic contextual dueling bandits
Q Di, T Jin, Y Wu, H Zhao, F Farnoud, Q Gu
arXiv preprint arXiv:2310.00968, 2023
52023
Pessimistic nonlinear least-squares value iteration for offline reinforcement learning
Q Di, H Zhao, J He, Q Gu
arXiv preprint arXiv:2310.01380, 2023
42023
A nearly optimal and low-switching algorithm for reinforcement learning with general function approximation
H Zhao, J He, Q Gu
arXiv preprint arXiv:2311.15238, 2023
32023
Feel-Good Thompson Sampling for Contextual Dueling Bandits
X Li, H Zhao, Q Gu
arXiv preprint arXiv:2404.06013, 2024
12024
The system can't perform the operation now. Try again later.
Articles 1–8