Подписаться
Botao Hao
Botao Hao
Deepmind
Подтвержден адрес электронной почты в домене google.com - Главная страница
Название
Процитировано
Процитировано
Год
Simultaneous clustering and estimation of heterogeneous graphical models
B Hao, WW Sun, Y Liu, G Cheng
Journal of Machine Learning Research, 2018
702018
Adaptive exploration in linear contextual bandit
B Hao, T Lattimore, C Szepesvari
International Conference on Artificial Intelligence and Statistics, 3536-3545, 2020
592020
Sparse and low-rank tensor estimation via cubic sketchings
B Hao, AR Zhang, G Cheng
International Conference on Artificial Intelligence and Statistics, 1319-1330, 2020
562020
High-dimensional sparse linear bandits
B Hao, T Lattimore, M Wang
34th Conference on Neural Information Processing Systems, 2020
552020
Bootstrapping upper confidence bound
B Hao, Y Abbasi-Yadkori, Z Wen, G Cheng
33rd Conference on Neural Information Processing Systems, 2019
552019
Sparse feature selection makes batch reinforcement learning more sample efficient
B Hao, Y Duan, T Lattimore, C Szepesvári, M Wang
International Conference on Machine Learning, 4063-4073, 2021
332021
Bootstrapping fitted q-evaluation for off-policy inference
B Hao, X Ji, Y Duan, H Lu, C Szepesvari, M Wang
International Conference on Machine Learning, 4074-4084, 2021
312021
Online sparse reinforcement learning
B Hao, T Lattimore, C Szepesvári, M Wang
International Conference on Artificial Intelligence and Statistics, 316-324, 2021
272021
Sparse tensor additive regression
B Hao, B Wang, P Wang, J Zhang, J Yang, WW Sun
The Journal of Machine Learning Research 22 (1), 2989-3031, 2021
272021
Adaptive approximate policy iteration
B Hao, N Lazic, Y Abbasi-Yadkori, P Joulani, C Szepesvari
Proceedings of the 24th International Conference on Artificial Intelligence …, 2020
26*2020
Efficient local planning with linear function approximation
D Yin, B Hao, Y Abbasi-Yadkori, N Lazić, C Szepesvári
International Conference on Algorithmic Learning Theory, 1165-1192, 2022
192022
Residual bootstrap exploration for bandit algorithms
CH Wang, Y Yu, B Hao, G Cheng
arXiv preprint arXiv:2002.08436, 2020
182020
Information directed sampling for sparse linear bandits
B Hao, T Lattimore, W Deng
Advances in Neural Information Processing Systems 34, 16738-16750, 2021
162021
Bootstrapping Statistical Inference for Off-Policy Evaluation
B Hao, X Ji, Y Duan, H Lu, C Szepesvári, M Wang
arXiv preprint arXiv:2102.03607, 2021
162021
The neural testbed: Evaluating joint predictions
I Osband, Z Wen, SM Asghari, V Dwaracherla, X Lu, M Ibrahimi, ...
Advances in Neural Information Processing Systems 35, 12554-12565, 2022
142022
Optimization issues in kl-constrained approximate policy iteration
N Lazić, B Hao, Y Abbasi-Yadkori, D Schuurmans, C Szepesvári
arXiv preprint arXiv:2102.06234, 2021
122021
Regret Bounds for Information-Directed Reinforcement Learning
B Hao, T Lattimore
Advances in Neural Information Processing Systems, 2022
112022
Bandit phase retrieval
T Lattimore, B Hao
Advances in Neural Information Processing Systems 34, 18801-18811, 2021
112021
Tensors in modern statistical learning
WW Sun, B Hao, L Li
Wiley StatsRef: Statistics Reference Online [Internet]. Wiley, 1-25, 2021
112021
Contextual information-directed sampling
B Hao, T Lattimore, C Qin
International Conference on Machine Learning, 8446-8464, 2022
102022
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20