跳到正文
← 返回论文列表与筛选
阅读说明

本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。

DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。

引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。

关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。

分类依据与纠错

AI 根据所提供的论文材料归类:摘要聚焦强化学习策略价值推断,未明确给出因果识别或所列其他经济计量细分方向的依据。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

正在核对对应版本的资源…

关注这篇论文的作者
Chengchun Shi
Sheng Zhang
Wenbin Lu
Rui Song

无限时域强化学习中价值函数的统计推断

研究问题
无限时域强化学习中,如何为策略价值构造置信区间,并在目标策略依赖观测数据或最优策略不唯一时维持有效覆盖?
方法与思路
作者用级数或筛方法建模策略的 Q 函数并构造区间;对于数据依赖策略,提出 SAVE 方法递归更新策略及其价值估计。
材料陈述的贡献
摘要称在轨迹数或决策点数趋于无穷时,所提区间可达到名义覆盖率,并以模拟和移动健康研究数据展示方法的应用。
阅读关注点
应核对轨迹与时点渐近框架、Q 函数近似条件、SAVE 如何处理数据依赖,以及健康应用中策略价值的定义和评估依据。
阅读边界
仅据 Crossref 摘要。摘要未列出覆盖结论的完整条件,也未说明健康改善的效应大小或识别依据,不能据此确认临床效果或推断版本变化。

原文摘要

Abstract Reinforcement learning is a general technique that allows an agent to learn an optimal policy and interact with an environment in sequential decision-making problems. The goodness of a policy is measured by its value function starting from some initial state. The focus of this paper was to construct confidence intervals (CIs) for a policy’s value in infinite horizon settings where the number of decision points diverges to infinity. We propose to model the action-value state function (Q-function) associated with a policy based on series/sieve method to derive its confidence interval. When the target policy depends on the observed data as well, we propose a SequentiAl Value Evaluation (SAVE) method to recursively update the estimated policy and its value estimator. As long as either the number of trajectories or the number of decision points diverges to infinity, we show that the proposed CI achieves nominal coverage even in cases where the optimal policy is not unique. Simulation studies are conducted to back up our theoretical findings. We apply the proposed method to a dataset from mobile health studies and find that reinforcement learning algorithms could help improve patient’s health status. A Python implementation of the proposed procedure is available at https://github.com/shengzhang37/SAVE.

笔记与分组