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

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

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

How Many Samples Are Needed to Determine Causal Direction? Sharp Minimax Bounds for Bivariate LiNGAM

确定因果方向需要多少样本?双变量 LiNGAM 的尖锐极小极大界

We study how many observations are needed to determine the causal direction between two linearly related variables. Classical LiNGAM theory shows that independent non-Gaussian disturbances identify the direction, but does not quantify the difficulty when the causal effect is weak or the disturbances are nearly Gaussian. Let $β$ bound the absolute structural coefficient from below, let $ν$ measure each standardized disturbance's distance from Gaussianity, and let the…

AI 解读阅读原文 ↗BibTeX ↓

The Partial Testimony of Logs: Evaluation of Language Model Generation under Confounded Model Choice

日志的有限证词:模型选择受混杂影响时的语言模型生成评估

Offline evaluation of language models from usage logs is biased when model choice is confounded: the same user-side factors that influence which model is used can also influence how its output is judged, so raw comparisons of logged scores mix self-selected populations rather than estimating a common quantity of interest. A small randomized experiment can break this bias by overriding model choice, but in practice such experiments are scarce and costly. We study a…

AI 解读阅读原文 ↗BibTeX ↓

Policy Learning with Abstention

允许弃权的政策学习

Policy learning algorithms are widely used in areas such as personalized medicine and advertising to develop individualized treatment regimes. However, most methods force a decision even when predictions are uncertain, which is risky in high-stakes settings. We study policy learning with abstention, where a policy may defer to a safe default or an expert. When a policy abstains, it receives a small additive reward on top of the value of a random guess. We propose a two-stage…

AI 解读阅读原文 ↗BibTeX ↓

Sharp Structure-Agnostic Lower Bounds for General Linear Functional Estimation

一般线性泛函估计的尖锐结构无关下界

We establish a general statistical optimality theory for estimation problems where the target parameter is a linear functional of an unknown nuisance component that must be estimated from data. This formulation covers many causal and predictive parameters and has applications to numerous disciplines. We adopt the structure-agnostic framework introduced by \citet{balakrishnan2023fundamental}, which poses no structural properties on the nuisance functions other than access to…

AI 解读阅读原文 ↗BibTeX ↓

It's Hard to Be Normal: The Impact of Noise on Structure-agnostic Estimation

正态性并不容易:噪声对不依赖结构的估计的影响

Structure-agnostic causal inference studies how well one can estimate a treatment effect given black-box machine learning estimates of nuisance functions (like the impact of confounders on treatment and outcomes). Here, we find that the answer depends in a surprising way on the distribution of the treatment noise. Focusing on the partially linear model of \citet{robinson1988root}, we first show that the widely adopted double machine learning (DML) estimator is minimax…

AI 解读阅读原文 ↗BibTeX ↓

Structure-agnostic Optimality of Doubly Robust Learning for Treatment Effect Estimation

处理效应估计中双重稳健学习的结构无关最优性

Average treatment effect estimation is the most central problem in causal inference with application to numerous disciplines. While many estimation strategies have been proposed in the literature, the statistical optimality of these methods has still remained an open area of investigation, especially in regimes where these methods do not achieve parametric rates. In this paper, we adopt the recently introduced structure-agnostic framework of statistical lower bounds, which…

AI 解读阅读原文 ↗BibTeX ↓

Learning Causal Representations from General Environments: Identifiability and Intrinsic Ambiguity

从一般环境学习因果表征:可识别性与内在歧义

We study causal representation learning, the task of recovering high-level latent variables and their causal relationships in the form of a causal graph from low-level observed data (such as text and images), assuming access to observations generated from multiple environments. Prior results on the identifiability of causal representations typically assume access to single-node interventions which is rather unrealistic in practice, since the latent variables are unknown in…

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 ↓