Следене
Lin F. Yang (杨林)
Lin F. Yang (杨林)
Assistant Professor, Department of Electrical and Computer Engineering @ UCLA
Потвърден имейл адрес: ee.ucla.edu - Начална страница
Заглавие
Позовавания
Позовавания
Година
Sample-optimal parametric q-learning using linearly additive features
L Yang, M Wang
International conference on machine learning, 6995-7004, 2019
3352019
Model-based reinforcement learning with value-targeted regression
A Ayoub, Z Jia, C Szepesvari, M Wang, L Yang
International Conference on Machine Learning, 463-474, 2020
2972020
Reinforcement learning in feature space: Matrix bandit, kernels, and regret bound
L Yang, M Wang
International Conference on Machine Learning, 10746-10756, 2020
2972020
Near-optimal time and sample complexities for solving Markov decision processes with a generative model
A Sidford, M Wang, X Wu, L Yang, Y Ye
Advances in Neural Information Processing Systems 31, 2018
246*2018
Is a good representation sufficient for sample efficient reinforcement learning?
SS Du, SM Kakade, R Wang, LF Yang
arXiv preprint arXiv:1910.03016, 2019
2172019
Model-based reinforcement learning with a generative model is minimax optimal
A Agarwal, S Kakade, LF Yang
Conference on Learning Theory, 67-83, 2020
200*2020
Reinforcement learning with general value function approximation: Provably efficient approach via bounded eluder dimension
R Wang, RR Salakhutdinov, L Yang
Advances in Neural Information Processing Systems 33, 6123-6135, 2020
1512020
Model-based multi-agent rl in zero-sum markov games with near-optimal sample complexity
K Zhang, S Kakade, T Basar, L Yang
Advances in Neural Information Processing Systems 33, 1166-1178, 2020
1312020
The hierarchical nature of the spin alignment of dark matter haloes in filaments
MA Aragon-Calvo, LF Yang
Monthly Notices of the Royal Astronomical Society: Letters 440 (1), L46-L50, 2014
1102014
On reward-free reinforcement learning with linear function approximation
R Wang, SS Du, L Yang, RR Salakhutdinov
Advances in neural information processing systems 33, 17816-17826, 2020
1082020
Solving discounted stochastic two-player games with near-optimal time and sample complexity
A Sidford, M Wang, L Yang, Y Ye
International Conference on Artificial Intelligence and Statistics, 2992-3002, 2020
772020
Provably efficient reinforcement learning with general value function approximation
R Wang, R Salakhutdinov, LF Yang
arXiv preprint arXiv:2005.10804, 2020
622020
Toward the fundamental limits of imitation learning
N Rajaraman, L Yang, J Jiao, K Ramchandran
Advances in Neural Information Processing Systems 33, 2914-2924, 2020
622020
Warmth elevating the depths: shallower voids with warm dark matter
LF Yang, MC Neyrinck, MA Aragón-Calvo, B Falck, J Silk
Monthly Notices of the Royal Astronomical Society 451 (4), 3606-3614, 2015
562015
Q-learning with logarithmic regret
K Yang, L Yang, S Du
International Conference on Artificial Intelligence and Statistics, 1576-1584, 2021
552021
Clustering high dimensional dynamic data streams
V Braverman, G Frahling, H Lang, C Sohler, LF Yang
International Conference on Machine Learning, 576-585, 2017
552017
Feature-based q-learning for two-player stochastic games
Z Jia, LF Yang, M Wang
arXiv preprint arXiv:1906.00423, 2019
542019
Preference-based reinforcement learning with finite-time guarantees
Y Xu, R Wang, L Yang, A Singh, A Dubrawski
Advances in Neural Information Processing Systems 33, 18784-18794, 2020
442020
Is long horizon reinforcement learning more difficult than short horizon reinforcement learning?
R Wang, SS Du, LF Yang, SM Kakade
arXiv preprint arXiv:2005.00527, 2020
432020
A provably efficient algorithm for linear markov decision process with low switching cost
M Gao, T Xie, SS Du, LF Yang
arXiv preprint arXiv:2101.00494, 2021
422021
Системата не може да изпълни операцията сега. Опитайте отново по-късно.
Статии 1–20