Deep reinforcement learning in computer vision: a comprehensive survey
Deep reinforcement learning augments the reinforcement learning framework and utilizes
the powerful representation of deep neural networks. Recent works have demonstrated the …
the powerful representation of deep neural networks. Recent works have demonstrated the …
Deep reinforcement learning in medical imaging: A literature review
Deep reinforcement learning (DRL) augments the reinforcement learning framework, which
learns a sequence of actions that maximizes the expected reward, with the representative …
learns a sequence of actions that maximizes the expected reward, with the representative …
Dive into deep learning
This open-source book represents our attempt to make deep learning approachable,
teaching readers the concepts, the context, and the code. The entire book is drafted in …
teaching readers the concepts, the context, and the code. The entire book is drafted in …
Nearly minimax optimal reinforcement learning for linear mixture markov decision processes
We study reinforcement learning (RL) with linear function approximation where the
underlying transition probability kernel of the Markov decision process (MDP) is a linear …
underlying transition probability kernel of the Markov decision process (MDP) is a linear …
Nearly minimax optimal reinforcement learning for linear markov decision processes
We study reinforcement learning (RL) with linear function approximation. For episodic time-
inhomogeneous linear Markov decision processes (linear MDPs) whose transition …
inhomogeneous linear Markov decision processes (linear MDPs) whose transition …
Reward-free rl is no harder than reward-aware rl in linear markov decision processes
AJ Wagenmaker, Y Chen… - International …, 2022 - proceedings.mlr.press
Reward-free reinforcement learning (RL) considers the setting where the agent does not
have access to a reward function during exploration, but must propose a near-optimal policy …
have access to a reward function during exploration, but must propose a near-optimal policy …
Logarithmic regret for reinforcement learning with linear function approximation
Reinforcement learning (RL) with linear function approximation has received increasing
attention recently. However, existing work has focused on obtaining $\sqrt {T} $-type regret …
attention recently. However, existing work has focused on obtaining $\sqrt {T} $-type regret …
Provably efficient reinforcement learning for discounted mdps with feature mapping
Modern tasks in reinforcement learning have large state and action spaces. To deal with
them efficiently, one often uses predefined feature mapping to represent states and actions …
them efficiently, one often uses predefined feature mapping to represent states and actions …
Computationally efficient horizon-free reinforcement learning for linear mixture mdps
Recent studies have shown that episodic reinforcement learning (RL) is not more difficult
than bandits, even with a long planning horizon and unknown state transitions. However …
than bandits, even with a long planning horizon and unknown state transitions. However …
Nearly minimax optimal reinforcement learning with linear function approximation
We study reinforcement learning with linear function approximation where the transition
probability and reward functions are linear with respect to a feature mapping $\boldsymbol …
probability and reward functions are linear with respect to a feature mapping $\boldsymbol …