Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2303.14281 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913451890180096 |
|---|---|
| author | Ma, Tao Zhu, Jin Cai, Hengrui Qi, Zhengling Chen, Yunxiao Shi, Chengchun Laber, Eric B. |
| author_facet | Ma, Tao Zhu, Jin Cai, Hengrui Qi, Zhengling Chen, Yunxiao Shi, Chengchun Laber, Eric B. |
| contents | In real-world applications of reinforcement learning, it is often challenging to obtain a state representation that is parsimonious and satisfies the Markov property without prior knowledge. Consequently, it is common practice to construct a state larger than necessary, e.g., by concatenating measurements over contiguous time points. However, needlessly increasing the dimension of the state may slow learning and obfuscate the learned policy. We introduce the notion of a minimal sufficient state in a Markov decision process (MDP) as the subvector of the original state under which the process remains an MDP and shares the same reward function as the original process. We propose a novel SEquEntial Knockoffs (SEEK) algorithm that estimates the minimal sufficient state in a system with high-dimensional complex nonlinear dynamics. In large samples, the proposed method achieves selection consistency. As the method is agnostic to the reinforcement learning algorithm being applied, it benefits downstream tasks such as policy learning. Empirical experiments verify theoretical results and show the proposed approach outperforms several competing methods regarding variable selection accuracy and regret. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2303_14281 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Sequential Knockoffs for Variable Selection in Reinforcement Learning Ma, Tao Zhu, Jin Cai, Hengrui Qi, Zhengling Chen, Yunxiao Shi, Chengchun Laber, Eric B. Machine Learning In real-world applications of reinforcement learning, it is often challenging to obtain a state representation that is parsimonious and satisfies the Markov property without prior knowledge. Consequently, it is common practice to construct a state larger than necessary, e.g., by concatenating measurements over contiguous time points. However, needlessly increasing the dimension of the state may slow learning and obfuscate the learned policy. We introduce the notion of a minimal sufficient state in a Markov decision process (MDP) as the subvector of the original state under which the process remains an MDP and shares the same reward function as the original process. We propose a novel SEquEntial Knockoffs (SEEK) algorithm that estimates the minimal sufficient state in a system with high-dimensional complex nonlinear dynamics. In large samples, the proposed method achieves selection consistency. As the method is agnostic to the reinforcement learning algorithm being applied, it benefits downstream tasks such as policy learning. Empirical experiments verify theoretical results and show the proposed approach outperforms several competing methods regarding variable selection accuracy and regret. |
| title | Sequential Knockoffs for Variable Selection in Reinforcement Learning |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2303.14281 |