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

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

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

Estimation of High Dimensional Bounded Discrete Graphical Models via Regularized Generalized Score Matching

高维有界离散图模型的正则化广义得分匹配估计

Graphical models for multivariate count data are widely used to characterize conditional dependence structures. For count variables with unbounded support, however, ensuring a finite normalizing constant typically imposes restrictive constraints on interaction parameters. We propose bounded discrete graphical models for multivariate discrete responses with finite support, which remove such constraints by construction while retaining interpretable dependence on the observed…

AI 解读阅读原文 ↗BibTeX ↓

Causal Inference with the Napkin Graph

Napkin 因果图下的因果推断

Unmeasured confounding can render identification strategies based on adjustment functionals invalid. We study the "Napkin" graph, a causal structure that encapsulates features of M-bias, instrumental variables, and classical back-door and front-door settings, yet identifies the average treatment effect through a nonstandard ratio of two g-formulas. We develop influence-function-based estimators for this functional, including doubly-robust one-step and targeted minimum…

AI 解读阅读原文 ↗BibTeX ↓

XMSE-Aware Adaptive Empirical Bayes Estimation

XMSE 感知的自适应经验贝叶斯估计

Empirical Bayes (EB) estimators can match the first-order asymptotic risk of maximum likelihood (ML) while behaving very differently at second order: recent excess mean squared error (XMSE) analysis shows that kernel-based EB estimation may be worse than ML when the kernel is poorly aligned with the true parameter. This paper turns that diagnostic into a design principle. We propose an XMSE-aware mixed estimator that interpolates between ML and EB shrinkage. Its fixed-weight…

AI 解读阅读原文 ↗BibTeX ↓

Learning from a Biased Sample

从有偏样本中学习

The empirical risk minimization approach to data-driven decision making requires access to training data drawn under the same conditions as those that will be faced when the decision rule is deployed. However, in a number of settings, we may be concerned that our training sample is biased in the sense that some groups (characterized by either observable or unobservable attributes) may be under- or over-represented relative to the general population; and in this setting…

AI 解读阅读原文 ↗BibTeX ↓

Orthogonalized Synthetic Controls

正交化合成控制

When conducting inference for the average treatment effect on the treated with a Synthetic Control Estimator, the vector of control weights is a nuisance parameter that is often constrained, high-dimensional, and may be only partially identified even when the average treatment effect on the treated is point-identified. All three of these features of a nuisance parameter can lead to failure of asymptotic normality for the estimate of the parameter of interest when using…

AI 解读阅读原文 ↗BibTeX ↓

Robust Estimation of Polychoric Correlation for Complex Survey Designs Using Minimum Divergence Methods

复杂抽样设计下多分格相关的稳健最小散度估计

Standard maximum likelihood estimation of polychoric correlations is highly sensitive to contamination in survey data, including response errors, interviewer effects, and careless responding, yet assigns equal weight to all observations regardless of data quality. We develop robust estimators for polychoric correlation under complex survey designs based on two minimum divergence criteria -- Hellinger distance (HD) and negative exponential disparity (NED) -- incorporating…

AI 解读阅读原文 ↗BibTeX ↓

Asymptotic Theory of $K$-fold Cross-validation in Lasso and the validity of Bootstrap

Lasso 中 K 折交叉验证的渐近理论与 Bootstrap 有效性

Least absolute shrinkage and selection operator or Lasso is one of the widely used regularization methods in regression. Statisticians usually implement Lasso in practice by choosing the penalty parameter in a data-dependent way, the most popular being the $K-$fold cross-validation (or $K-$fold CV). However, inferential properties, such as the variable selection consistency and $n^{1/2}-$consistency, of the $K-$fold CV based Lasso estimator and validity of the Bootstrap…

AI 解读阅读原文 ↗BibTeX ↓

Incomplete Matrix Regression

不完整矩阵回归

Matrix completion seeks to recover a low-rank matrix from a sparse and noisy subset of its entries. In many applications, such as recommendation systems and urban mobility, the observed matrix is accompanied by auxiliary covariates on its rows and columns and exhibits dependence across them. We propose Incomplete Matrix Regression (IMR), a distribution-free penalized regression framework that integrates such information into matrix completion. The target matrix is modeled as…

AI 解读阅读原文 ↗BibTeX ↓

Inference on summaries of a model-agnostic longitudinal variable importance trajectory with application to suicide prevention

模型无关的纵向变量重要性轨迹摘要推断及其自杀预防应用

Risk of suicide attempt varies over time. Understanding the importance of risk factors measured at a mental health visit can help clinicians evaluate future risk and provide appropriate care during the visit. In prediction settings where data are collected over time, such as in mental health care, it is often of interest to understand both the importance of variables for predicting the response at each time point and the importance summarized over the time series. Building…

AI 解读阅读原文 ↗BibTeX ↓

Finite-sample bounds for regularized optimal transport

正则化最优传输的有限样本界

We study the sample complexity of regularized optimal transport for general convex regularizations including the Kullback--Leibler divergence and $L^p$ penalties. Our main results are non-asymptotic bias and variance bounds for the empirical cost, with explicit dependence on the regularization parameter and on the intrinsic dimension of the marginals. Our approach simultaneously improves, unifies, and extends existing finite-sample bounds. In particular, we improve the state…

AI 解读阅读原文 ↗BibTeX ↓

Elliptical Regularized Hotelling Testing for High Dimensional Data

高维数据的椭圆正则化Hotelling检验

We consider one-sample testing of a high-dimensional location parameter under elliptically symmetric distributions with heavy tails and pervasive cross-sectional dependence. We propose an elliptical regularized Hotelling test with Cauchy combination (ERHT--CC), based on the sample spatial median and the spatial-sign covariance matrix centered at that median. We derive its null asymptotic normality, consistent estimators of the centering and variance, and an explicit local…

AI 解读阅读原文 ↗BibTeX ↓

Weak Moment Methods for Statistical Inference: with an Application to Robust Estimation

弱矩方法用于统计推断:兼论稳健估计应用

A companion paper develops a generalised framework in which a probability law is represented by a tempered distribution $T\in\mathcal{S}'$ - on the same footing as a density or characteristic function - and information is extracted by pairing $T$ with a positive Schwartz kernel $\varphi$ that acts as a measurement instrument rather than as part of the law; the resulting weak moments of all orders exist unconditionally. The present paper turns this into a methodology for…

AI 解读阅读原文 ↗BibTeX ↓

Closed-form solutions to some generalized variational inference problems

若干广义变分推断问题的闭式解

The Donsker--Varadhan formula characterizes the ordinary Bayesian posterior as the solution of an unrestricted $\mathsf{KL}$-regularized variational problem. Generalized variational inference replaces this regularizer by other divergences, but the resulting measure-valued optimization problem is often studied only after restriction to a parametric variational family. This paper studies the unrestricted measure-level problem. Given a measurable space $(\mathcal{Z},\mathfrak{Z})$…

AI 解读阅读原文 ↗BibTeX ↓

Time-Varying Model Averaging of Multi-layer Network Vector Autoregressions

多层网络向量自回归的时变模型平均

In this paper, we introduce a flexible time-varying multi-layer network vector autoregression (VAR) model framework for large-scale time series, allowing agents in dynamic systems to interact through multiple channels and incorporating multiple adjacency matrices to capture network spillover effects. We propose a penalized model averaging method to determine a time-varying optimal combination of multi-layer network VAR candidate models whose number may be divergent. Under…

AI 解读阅读原文 ↗BibTeX ↓

Group-Level Treatment Effect Heterogeneity in Difference-in-Differences: A Balanced Approach

双重差分中的组间处理效应异质性:一种平衡方法

Understanding how treatment effects vary across groups is central to policy evaluation. In Difference-in-Differences designs, heterogeneity is often studied using subgroup or triple-difference analyses, which can suffer from conservative inference, reliance on parametric interaction structures, and sensitivity to differences in covariate distributions across groups. We propose the Balanced Group Average Treatment Effect on the Treated (BGATT), a new estimand that isolates…

AI 解读阅读原文 ↗BibTeX ↓

Bayesian Estimation of the Eigenstructure in High-Dimensional Approximate Factor Models

高维近似因子模型中特征结构的贝叶斯估计

High-dimensional economic datasets often display strong co-movement driven by a small number of latent factors, which are typically modeled using approximate factor models. When the number of variables is large relative to the sample size, the eigenvalues and eigenvectors of the sample covariance matrix are severely distorted, which in turn makes principal component based estimators of the factor structure unstable. To address the high-dimensional problem, we propose a…

AI 解读阅读原文 ↗BibTeX ↓

Sample complexity of unbalanced entropic OT

非平衡熵正则最优传输的样本复杂度

Optimal transport (OT) has become a central language for comparing probability measures, but exact balanced OT is often both too rigid for data with missing, created, or destroyed mass and subject to unfavorable high-dimensional sample complexity. Entropic regularization and unbalanced relaxations address these limitations in complementary ways. Entropy smooths the geometry, improves statistical behavior, and enables fast Sinkhorn-type algorithms, while unbalanced marginal…

AI 解读阅读原文 ↗BibTeX ↓

Partial Wavelet Canonical Coherence for Nonstationary Signals with High Dimensional Confounders

高维混杂调整下非平稳信号的偏小波典型相干

We develop Partial Wavelet Canonical Coherence for measuring the direct canonical association between two multivariate nonstationary time series after adjustment for possibly high-dimensional confounders. To the best of our knowledge, this is the first method that establishes a frequency-domain formulation of the partial canonical correlation analysis for time series. Through a wavelet approach, the proposed method yields a scale-specific, time-varying measure of association…

AI 解读阅读原文 ↗BibTeX ↓

Bayesian inference in high-dimensional models

高维模型中的贝叶斯推断

Models with dimension more than the available sample size are now commonly used in various applications. A sensible inference is possible using a lower-dimensional structure. In regression problems with a large number of predictors, the model is often assumed to be sparse, with only a few predictors active. Interdependence between a large number of variables is succinctly described by a graphical model, where variables are represented by nodes on a graph and an edge between…

AI 解读阅读原文 ↗BibTeX ↓

Distributional Statistical Models: Weak Moments, Cumulants, and a Central Limit Theorem

分布统计模型:弱矩、累积量与中心极限定理

Many important statistical models fall outside classical moment-based methods due to the non-existence of moments or moment generating functions. We propose a generalised probabilistic framework in which a probability law is represented by a tempered distribution $T \in \mathcal{S}'$, on the same footing as a density, a distribution function, or a characteristic function. Information about the law is extracted by evaluating $T$ on test functions regularised by a given…

AI 解读阅读原文 ↗BibTeX ↓

Matrix-valued Network Autoregression Model with Latent Group Structure

具有潜在组结构的矩阵值网络自回归模型

Matrix-valued time series data are frequently observed in a broad range of areas and have attracted great attention recently. In this work, we model network effects for high dimensional matrix-valued time series data in a matrix autoregression framework. To characterize the potential heterogeneity of the subjects and handle the high dimensionality simultaneously, we assume that each subject has a latent group label, which enables us to cluster the subject into the…

AI 解读阅读原文 ↗BibTeX ↓

Separating Oblivious and Adaptive Models of Variable Selection

稀疏恢复中遗忘模型与自适应模型的可分离性

Sparse recovery is among the most well-studied problems in learning theory and high-dimensional statistics. In this work, we investigate the statistical and computational landscapes of sparse recovery with $\ell_\infty$ error guarantees. This variant of the problem is motivated by \emph{variable selection} tasks, where the goal is to estimate the support of a $k$-sparse signal in $\mathbb{R}^d$. Our main contribution is a provable separation between the \emph{oblivious}…

AI 解读阅读原文 ↗BibTeX ↓

GRACE: Gated Refinement for Accurate Causal Edge Discovery in High-Dimensional Time Series

GRACE:高维时间序列因果边发现的门控精炼方法

From climate teleconnections to gene regulation, modern time-series datasets encompass tens or hundreds of interacting variables, making causal discovery increasingly challenging. Constraint-based methods offer statistical rigor but their nonlinear CI tests are infeasible at scale, while score-based alternatives avoid CI testing but require arbitrary thresholds to binarize continuous edge scores. We propose GRACE ($\textbf{G}$ated $\textbf{R}$efinement for $\textbf{A}$ccurate…

AI 解读阅读原文 ↗BibTeX ↓

Exact Schur-Sylvester Dimensionality Reductions for Non-Smooth Stochastic Complexity and Manifold Sampling

非光滑随机复杂度的精确 Schur-Sylvester 降维与流形采样

The exact computation of the Normalized Maximum Likelihood (NML) codelength for regular non-smooth estimators (e.g., Lasso) has been historically limited by the cubic scaling walls of manifold-constrained projection and volume integration. At each step of the geometric Propose-and-Project Metropolis--Hastings (PPMH) sampler, evaluating the projection operator requires inverting an $(N+k) \times (N+k)$ generalized KKT matrix, while calculating the volume factor requires the…

AI 解读阅读原文 ↗BibTeX ↓