70 citations · 880 across the 62 of their papers we have counts for
10 papers · 1 filter
Sparse Feature Selection Makes Batch Reinforcement Learning More Sample Efficient
Botao Hao, Yaqi Duan, Tor Lattimore +2
This paper provides a statistical analysis of high-dimensional batch Reinforcement Learning (RL) using sparse linear function approximation. When there is a large number of candida…
High-Dimensional Sparse Linear Bandits
Botao Hao, Tor Lattimore, Mengdi Wang
Stochastic linear bandits with high-dimensional sparse features are a practical model for a variety of domains, including personalized medicine and online advertising. We derive a…
Online Sparse Reinforcement Learning
Botao Hao, Tor Lattimore, Csaba Szepesvári +1
We investigate the hardness of online reinforcement learning in fixed horizon, sparse linear Markov decision process (MDP), with a special focus on the high-dimensional regime wher…
Generalized Leverage Score Sampling for Neural Networks
Jason D. Lee, Ruoqi Shen, Zhao Song +2
Leverage score sampling is a powerful technique that originates from theoretical computer science, which can be used to speed up a large number of fundamental questions, e.g. linea…
Variational Policy Gradient Method for Reinforcement Learning with General Utilities
Junyu Zhang, Alec Koppel, Amrit Singh Bedi +2
In recent years, reinforcement learning (RL) systems with general goals beyond a cumulative sum of rewards have gained traction, such as in constrained problems, exploration, and a…
Picasso: A Sparse Learning Library for High Dimensional Data Analysis in R and Python
Jason Ge, Xingguo Li, Haoming Jiang +4
We describe a new library named picasso, which implements a unified framework of pathwise coordinate optimization for a variety of sparse learning problems (e.g., sparse linear reg…