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

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

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

Bayesian Distributionally Robust Merton Problem with Nonlinear Wasserstein Projections

基于非线性 Wasserstein 投影的贝叶斯分布稳健 Merton 问题

We revisit Merton's continuous-time portfolio selection through a data-driven, distributionally robust lens. Our aim is to tap the benefits of frequent trading over short horizons while acknowledging that drift is hard to pin down, whereas volatility can be screened using realized or implied measures for appropriately selected assets. Rather than time-rectangular distributional robust control -- which replenishes adversarial power at every instant and induces over-pessimism…

AI 解读阅读原文 ↗BibTeX ↓

Partial Identification of Policy-Relevant Treatment Effects with Instrumental Variables via Optimal Transport

通过最优传输部分识别工具变量下的政策相关处理效应

Policy-Relevant Treatment Effects (PRTEs) are generally not point-identified under standard Instrumental Variable (IV) assumptions when the instrument generates limited support in treatment propensity. We show that PRTE partial identification in the generalized Roy model can instead be formulated as a Constrained Conditional Optimal Transport (CCOT) problem over the joint conditional law of the potential outcome and the latent resistance. The resulting multidimensional CCOT…

AI 解读阅读原文 ↗BibTeX ↓

Statistical Inference in Causal Partial Identification with Smooth Densities

光滑密度下因果部分识别的统计推断

Many causal quantities are only partially identifiable due to the inherent missingness of potential outcomes, and the associated partial identification (PI) sets can be obtained by solving an optimal transport (OT) problem. Covariates often provide additional information about the potential outcomes and thus yield tighter PI sets, which can be obtained via conditional optimal transport (COT). However, COT-based PI set estimators are susceptible to the curse of dimensionality…

AI 解读阅读原文 ↗BibTeX ↓

Causal Partial Identification via Conditional Optimal Transport

通过条件最优输运实现因果部分识别

We study the estimation of causal estimand involving the joint distribution of treatment and control outcomes for a single unit. In typical causal inference settings, it is impossible to observe both outcomes simultaneously, which places our estimation within the domain of partial identification (PI). Pre-treatment covariates can substantially reduce estimation uncertainty by shrinking the partially identified set. Recent work has shown that covariate-assisted PI sets can be…

AI 解读阅读原文 ↗BibTeX ↓

Estimation of Treatment Effects in Extreme and Unobserved Data

极端与未观测数据中的处理效应估计

Causal effect estimation seeks to determine the impact of an intervention from observational data. However, the existing causal inference literature primarily addresses treatment effects on frequently occurring events. But what if we are interested in estimating the effects of a policy intervention whose benefits, while potentially important, can only be observed and measured in rare yet impactful events, such as extreme climate events? The standard causal inference…

AI 解读阅读原文 ↗BibTeX ↓

Tightening Causal Bounds via Covariate-Aware Optimal Transport

通过纳入协变量的最优传输收紧因果效应界

Causal estimands can vary significantly depending on the relationship between outcomes in treatment and control groups, potentially leading to wide partial identification (PI) intervals that impede decision making. Incorporating covariates can substantially tighten these bounds, but requires determining the range of PI over probability models consistent with the joint distributions of observed covariates and outcomes in treatment and control groups. This problem is known to…

AI 解读阅读原文 ↗BibTeX ↓

Wasserstein-based Minimax Estimation of Dependence in Multivariate Regularly Varying Extremes

基于 Wasserstein 距离的多元正则变动极值依赖极小极大估计

We present the first minimax risk bounds for estimators of the spectral measure in multivariate linear factor models, where observations are linear combinations of regularly varying latent factors. Non-asymptotic convergence rates are derived for the multivariate Peak-over-Threshold estimator in terms of the $p$-th order Wasserstein distance, and information-theoretic lower bounds for the minimax risks are established. The convergence rate of the estimator is shown to be…

AI 解读阅读原文 ↗BibTeX ↓

Automatic Outlier Rectification via Optimal Transport

通过最优传输自动校正异常值

In this paper, we propose a novel conceptual framework to detect outliers using optimal transport with a concave cost function. Conventional outlier detection approaches typically use a two-stage procedure: first, outliers are detected and removed, and then estimation is performed on the cleaned data. However, this approach does not inform outlier removal with the estimation task, leaving room for improvement. To address this limitation, we propose an automatic outlier…

AI 解读阅读原文 ↗BibTeX ↓

Orthogonal Bootstrap: Efficient Simulation of Input Uncertainty

正交 Bootstrap:高效模拟输入不确定性

Bootstrap is a popular methodology for simulating input uncertainty. However, it can be computationally expensive when the number of samples is large. We propose a new approach called \textbf{Orthogonal Bootstrap} that reduces the number of required Monte Carlo replications. We decomposes the target being simulated into two parts: the \textit{non-orthogonal part} which has a closed-form result known as Infinitesimal Jackknife and the \textit{orthogonal part} which is easier…

AI 解读阅读原文 ↗BibTeX ↓

Minimax Optimal Kernel Operator Learning via Multilevel Training

通过多层训练实现极小极大最优核算子学习

Learning mappings between infinite-dimensional function spaces has achieved empirical success in many disciplines of machine learning, including generative modeling, functional data analysis, causal inference, and multi-agent reinforcement learning. In this paper, we study the statistical limit of learning a Hilbert-Schmidt operator between two infinite-dimensional Sobolev reproducing kernel Hilbert spaces. We establish the information-theoretic lower bound in terms of the…

AI 解读阅读原文 ↗BibTeX ↓

Bayesian Imputation with Optimal Look-Ahead-Bias and Variance Tradeoff

平衡前视偏差与方差的贝叶斯缺失值填补

Missing time-series data is a prevalent problem in many prescriptive analytics models in operations management, healthcare and finance. Imputation methods for time-series data are usually applied to the full panel data with the purpose of training a prescriptive model for a downstream out-of-sample task. For example, the imputation of missing asset returns may be applied before estimating an optimal portfolio allocation. However, this practice can result in a look-ahead-bias…

AI 解读阅读原文 ↗BibTeX ↓

Synthetic Principal Component Design: Fast Covariate Balancing with Synthetic Controls

合成主成分设计:利用合成控制快速平衡协变量

The optimal design of experiments typically involves solving an NP-hard combinatorial optimization problem. In this paper, we aim to develop a globally convergent and practically efficient optimization algorithm. Specifically, we consider a setting where the pre-treatment outcome data is available and the synthetic control estimator is invoked. The average treatment effect is estimated via the difference between the weighted average outcomes of the treated and control units,…

AI 解读阅读原文 ↗BibTeX ↓