paper-with-me

Papers

On Online Learning in Kernelized Markov Decision Processes

2019-11-04 · Sayak Ray Chowdhury, Aditya Gopalan

We develop algorithms with low regret for learning episodic Markov decision processes based on kernel approximation techniques. The algorithms are based on both the Upper Confidence Bound (UCB) as well as Posterior or Thompson Sampling (PSRL) philosophies, and work in the general setting of continuous state and action spaces when the true unknown transition dynamics are assumed to have smoothness induced by an appropriate Reproducing Kernel Hilbert Space (RKHS).

📄 PDF Abstract BibTeX arXiv:1911.01871

Code (0)

등록된 구현이 없습니다.

Tasks

Thompson Sampling

Similar Papers 제목 키워드 기반

Online Learning in Kernelized Markov Decision Processes

2018-05-21 · Sayak Ray Chowdhury, Aditya Gopalan

We consider online learning for minimizing regret in unknown, episodic Markov decision processes (MDPs) with continuous states and actions. We develop variants of the UCRL and posterior sampling algorithms that employ no…

Vector-valued self-normalized concentration inequalities beyond sub-Gaussianity

2025-11-05 · Diego Martinez-Taboada, Tomas Gonzalez, Aaditya Ramdas arxiv

The study of self-normalized processes plays a crucial role in a wide range of applications, from sequential decision-making to econometrics. While the behavior of self-normalized concentration has been widely investigat…

PC-MLP: Model-based Reinforcement Learning with Policy Cover Guided Exploration

2021-07-15 · Yuda Song, Wen Sun

Model-based Reinforcement Learning (RL) is a popular learning paradigm due to its potential sample efficiency compared to model-free RL. However, existing empirical model-based RL approaches lack the ability to explore. …

Model-based Reinforcement Learningreinforcement-learningReinforcement Learning (RL)

Online Markov decision processes with policy iteration

2015-10-15 · Yao Ma, Hao Zhang, Masashi Sugiyama

The online Markov decision process (MDP) is a generalization of the classical Markov decision process that incorporates changing reward functions. In this paper, we propose practical online MDP algorithms with policy ite…

Regular Decision Processes for Grid Worlds

2021-11-05 · Nicky Lenaers, Martijn van Otterlo

Markov decision processes are typically used for sequential decision making under uncertainty. For many aspects however, ranging from constrained or safe specifications to various kinds of temporal (non-Markovian) depend…

Decision MakingDecision Making Under UncertaintyIncremental LearningSequential Decision Making