跳到正文
收录说明
收录范围
保留计量方法研究、相关统计基础,以及实质涉及计量方法的应用、教程、比较和综述。书评、刊务及明确无关内容不公开;身份或相关性证据不足的记录保留待核,补充可靠材料后可重新判断。
预印本来自 arXiv 计量经济学及相关统计、金融分类和主题检索。主题检索从 2021 年起回补;关注作者追溯更早年份,部分历史文献按已核验编号补录。收录不表示通过同行评审,仍可能遗漏。
本库首次提交范围:2004-06-23 — 2026-10-14。
阅读范围
默认显示本库全部预印本。可选“优先阅读”:至少一位作者同时满足有可核验的本站覆盖期刊正式发表记录,且 OpenAlex 总引用超过 1,000 次。按同一作者身份匹配,两项缺一不可。此筛选提供阅读线索,不作为论文质量判断。
日期与排序
默认按最近修订排序;年份和日期筛选使用首次提交时间。同一 arXiv 编号的修订会合并。仅有月份或年份时,日期区间相交也会纳入。

日期精度:到日 12 篇 · 到月 0 篇 · 到年 0 篇

分类与引用
领域和方法依据题名、摘要初步分类,可人工修正;分类不代表论文质量。引用数采用 OpenAlex 单条关联记录,不合计版本。
更新与 AI 解读
正常题录、可靠摘要与引用同步继续;日、周、月简报按核实的发表与修订日期汇总,历史补录保留在文献库。AI 解读依据可靠摘要或已核实原文片段,已有解读保留供阅读参考;缺少可靠材料的条目保持待解读,浏览页面不会触发生成。
12 篇论文
导出

Blessing from Human-AI Interaction: Super Reinforcement Learning in Confounded Environments

人机交互的助益:混杂环境中的超级强化学习

As AI becomes more prevalent throughout society, effective methods of integrating humans and AI systems that leverage their respective strengths and mitigate risk have become an important priority. In this paper, we introduce the paradigm of super policy learning that takes advantage of Human-AI interaction for data driven sequential decision making. This approach utilizes the observed action, either from AI or humans, as input for achieving a stronger oracle in policy…

AI 解读阅读原文 ↗BibTeX ↓

Quantile-Optimal Policy Learning under Unmeasured Confounding

未观测混杂下的分位数最优政策学习

We study quantile-optimal policy learning where the goal is to find a policy whose reward distribution has the largest $α$-quantile for some $α\in (0, 1)$. We focus on the offline setting whose generating process involves unobserved confounders. Such a problem suffers from three main challenges: (i) nonlinearity of the quantile objective as a functional of the reward distribution, (ii) unobserved confounding issue, and (iii) insufficient coverage of the offline dataset. To…

AI 解读阅读原文 ↗BibTeX ↓

Reinforcement Learning with Continuous Actions Under Unmeasured Confounding

未测混杂下连续动作空间的强化学习

This paper addresses the challenge of offline policy learning in reinforcement learning with continuous action spaces when unmeasured confounders are present. While most existing research focuses on policy evaluation within partially observable Markov decision processes (POMDPs) and assumes discrete action spaces, we advance this field by establishing a novel identification result to enable the nonparametric estimation of policy value for a given target policy under an…

AI 解读阅读原文 ↗BibTeX ↓

Off-policy Evaluation in Doubly Inhomogeneous Environments

时间与个体双重异质环境中的离策略评估

This work aims to study off-policy evaluation (OPE) under scenarios where two key reinforcement learning (RL) assumptions -- temporal stationarity and individual homogeneity are both violated. To handle the ``double inhomogeneities", we propose a class of latent factor models for the reward and observation transition functions, under which we develop a general OPE framework that consists of both model-based and model-free approaches. To our knowledge, this is the first paper…

AI 解读阅读原文 ↗BibTeX ↓

A Policy Gradient Method for Confounded POMDPs

混杂部分可观测马尔可夫决策过程的策略梯度方法

In this paper, we propose a policy gradient method for confounded partially observable Markov decision processes (POMDPs) with continuous state and observation spaces in the offline setting. We first establish a novel identification result to non-parametrically estimate any history-dependent policy gradient under POMDPs using the offline data. The identification enables us to solve a sequence of conditional moment restrictions and adopt the min-max learning procedure with…

AI 解读阅读原文 ↗BibTeX ↓

Personalized Pricing with Invalid Instrumental Variables: Identification, Estimation, and Policy Learning

无效工具变量下的个性化定价:识别、估计与政策学习

Pricing based on individual customer characteristics is widely used to maximize sellers' revenues. This work studies offline personalized pricing under endogeneity using an instrumental variable approach. Standard instrumental variable methods in causal inference/econometrics either focus on a discrete treatment space or require the exclusion restriction of instruments from having a direct effect on the outcome, which limits their applicability in personalized pricing. In…

AI 解读阅读原文 ↗BibTeX ↓

Offline Reinforcement Learning for Human-Guided Human-Machine Interaction with Private Information

存在私人信息的人类引导人机交互中的离线强化学习

Motivated by the human-machine interaction such as training chatbots for improving customer satisfaction, we study human-guided human-machine interaction involving private information. We model this interaction as a two-player turn-based game, where one player (Alice, a human) guides the other player (Bob, a machine) towards a common goal. Specifically, we focus on offline reinforcement learning (RL) in this game, where the goal is to find a policy pair for Alice and Bob…

AI 解读阅读原文 ↗BibTeX ↓

Proximal Learning for Individualized Treatment Regimes Under Unmeasured Confounding

未测量混杂下个体化处理规则的近端学习

Data-driven individualized decision making has recently received increasing research interests. Most existing methods rely on the assumption of no unmeasured confounding, which unfortunately cannot be ensured in practice especially in observational studies. Motivated by the recent proposed proximal causal inference, we develop several proximal learning approaches to estimating optimal individualized treatment regimes (ITRs) in the presence of unmeasured confounding. In…

AI 解读阅读原文 ↗BibTeX ↓

Off-Policy Evaluation for Episodic Partially Observable Markov Decision Processes under Non-Parametric Models

非参数模型下分回合部分可观测马尔可夫决策过程的离策略评估

We study the problem of off-policy evaluation (OPE) for episodic Partially Observable Markov Decision Processes (POMDPs) with continuous states. Motivated by the recently proposed proximal causal inference framework, we develop a non-parametric identification result for estimating the policy value via a sequence of so-called V-bridge functions with the help of time-dependent proxy variables. We then develop a fitted-Q-evaluation-type algorithm to estimate V-bridge functions…

AI 解读阅读原文 ↗BibTeX ↓

Offline Reinforcement Learning with Instrumental Variables in Confounded Markov Decision Processes

混杂马尔可夫决策过程中的工具变量离线强化学习

We study the offline reinforcement learning (RL) in the face of unmeasured confounders. Due to the lack of online interaction with the environment, offline RL is facing the following two significant challenges: (i) the agent may be confounded by the unobserved state variables; (ii) the offline data collected a prior does not provide sufficient coverage for the environment. To tackle the above challenges, we study the policy learning in the confounded MDPs with the aid of…

AI 解读阅读原文 ↗BibTeX ↓

On Well-posedness and Minimax Optimal Rates of Nonparametric Q-function Estimation in Off-policy Evaluation

离策略评估中非参数 Q 函数估计的适定性与极小极大最优速率

We study the off-policy evaluation (OPE) problem in an infinite-horizon Markov decision process with continuous states and actions. We recast the $Q$-function estimation into a special form of the nonparametric instrumental variables (NPIV) estimation problem. We first show that under one mild condition the NPIV formulation of $Q$-function estimation is well-posed in the sense of $L^2$-measure of ill-posedness with respect to the data generating distribution, bypassing a…

AI 解读阅读原文 ↗BibTeX ↓

Projected State-action Balancing Weights for Offline Reinforcement Learning

离线强化学习中的投影状态—动作平衡权重

Offline policy evaluation (OPE) is considered a fundamental and challenging problem in reinforcement learning (RL). This paper focuses on the value estimation of a target policy based on pre-collected data generated from a possibly different policy, under the framework of infinite-horizon Markov decision processes. Motivated by the recently developed marginal importance sampling method in RL and the covariate balancing idea in causal inference, we propose a novel estimator…

AI 解读阅读原文 ↗BibTeX ↓