Skip to content

Latest commit

 

History

History
55 lines (55 loc) · 2.24 KB

2024-04-18-deng24a.md

File metadata and controls

55 lines (55 loc) · 2.24 KB
title abstract layout series publisher issn id month tex_title firstpage lastpage page order cycles bibtex_author author date address container-title volume genre issued pdf extras
Sample Complexity Characterization for Linear Contextual MDPs
Contextual Markov decision processes (CMDPs) describe a class of reinforcement learning problems in which the transition kernels and reward functions can change over time with different MDPs indexed by a context variable. While CMDPs serve as an important framework to model many real-world applications with time-varying environments, they are largely unexplored from theoretical perspective. In this paper, we study CMDPs under two linear function approximation models: Model I with context-varying representations and common linear weights for all contexts; and Model II with common representations for all contexts and context-varying linear weights. For both models, we propose novel model-based algorithms and show that they enjoy guaranteed $\epsilon$-suboptimality gap with desired polynomial sample complexity. In particular, instantiating our result for the first model to the tabular CMDP improves the existing result by removing the reachability assumption. Our result for the second model is the first-known result for such a type of function approximation models. Comparison between our results for the two models further indicates that having context-varying features leads to much better sample efficiency than having common representations for all contexts under linear CMDPs.
inproceedings
Proceedings of Machine Learning Research
PMLR
2640-3498
deng24a
0
Sample Complexity Characterization for Linear Contextual {MDP}s
1693
1701
1693-1701
1693
false
Deng, Junze and Cheng, Yuan and Zou, Shaofeng and Liang, Yingbin
given family
Junze
Deng
given family
Yuan
Cheng
given family
Shaofeng
Zou
given family
Yingbin
Liang
2024-04-18
Proceedings of The 27th International Conference on Artificial Intelligence and Statistics
238
inproceedings
date-parts
2024
4
18