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

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

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

New Approximation Results and Optimal Estimation for Fully Connected Deep Neural Networks

全连接深度神经网络的新逼近结果与最优估计

\citet{farrell2021deep} establish non-asymptotic high-probability bounds for general deep feedforward neural network (with rectified linear unit activation function) estimators, with \citet[Theorem 1]{farrell2021deep} achieving a suboptimal convergence rate for fully connected feedforward networks. The authors suggest that improved approximation of fully connected networks could yield sharper versions of \citet[Theorem 1]{farrell2021deep} without altering the theoretical…

AI 解读阅读原文 ↗BibTeX ↓

Kernel Three Pass Regression Filter

核三遍回归滤波器

We forecast a single time series using a high-dimensional set of predictors. When these predictors share common underlying dynamics, an approximate latent factor model provides a powerful characterization of their co-movements Bai(2003). These latent factors succinctly summarize the data and can also be used for prediction, alleviating the curse of dimensionality in high-dimensional prediction exercises, see Stock & Watson (2002a). However, forecasting using these latent…

AI 解读阅读原文 ↗BibTeX ↓

STARK denoises spatial transcriptomics images via adaptive regularization

STARK:用自适应正则化对空间转录组图像去噪

We present an approach to denoising spatial transcriptomics images that is particularly effective for uncovering cell identities in the regime of ultra-low sequencing depths, and also allows for interpolation of gene expression. The method -- Spatial Transcriptomics via Adaptive Regularization and Kernels (STARK) -- augments kernel ridge regression with an incrementally adaptive graph Laplacian regularizer. In each iteration, we (1) perform kernel ridge regression with a…

AI 解读阅读原文 ↗BibTeX ↓

Balancing Weights for Causal Mediation Analysis

因果中介分析的平衡权重

This paper develops methods for estimating the natural direct and indirect effects in causal mediation analysis. The efficient influence function-based estimator (EIF-based estimator) and the inverse probability weighting estimator (IPW estimator), which are standard in causal mediation analysis, both rely on the inverse of the estimated propensity scores, and thus they are vulnerable to two key issues (i) instability and (ii) finite-sample covariate imbalance. We propose…

AI 解读阅读原文 ↗BibTeX ↓

Debiased Bayesian Inference for High-dimensional Regression Models

高维回归模型的去偏贝叶斯推断

There has been significant progress in Bayesian inference based on sparsity-inducing (e.g., spike-and-slab and horseshoe-type) priors for high-dimensional regression models. The resulting posteriors, however, in general do not possess desirable frequentist properties, and the credible sets thus cannot serve as valid confidence sets even asymptotically. We introduce a novel debiasing approach that corrects the bias for the entire Bayesian posterior distribution. We establish…

AI 解读阅读原文 ↗BibTeX ↓

Automatic Debiased Machine Learning of Structural Parameters with General Conditional Moments

一般条件矩下结构参数的自动去偏机器学习

This paper proposes a method to automatically construct or estimate Neyman-orthogonal moments in general models defined by a finite number of conditional moment restrictions (CMRs), with possibly different conditioning variables and endogenous regressors. CMRs are allowed to depend on non-parametric components, which might be flexibly modeled using Machine Learning tools, and non-linearly on finite-dimensional parameters. The key step in this construction is the estimation…

AI 解读阅读原文 ↗BibTeX ↓

A Latent Variable Approach to Learning High-dimensional Multivariate longitudinal Data

高维多元纵向数据的潜变量学习方法

High-dimensional multivariate longitudinal data, which arise when many outcome variables are measured repeatedly over time, are becoming increasingly common in social, behavioral and health sciences. We propose a latent variable model for drawing statistical inferences on covariate effects and predicting future outcomes based on high-dimensional multivariate longitudinal data. This model introduces unobserved factors to account for the between-variable and across-time…

AI 解读阅读原文 ↗BibTeX ↓

Covariate-Elaborated Robust Partial Information Transfer with Conditional Spike-and-Slab Prior

协变量细化的稳健部分信息迁移:条件尖峰-平板先验

The popularity of transfer learning stems from the fact that it can borrow information from useful auxiliary datasets. Existing statistical transfer learning methods usually adopt a global similarity measure between the source data and the target data, which may lead to inefficiency when only partial information is shared. In this paper, we propose a novel Bayesian transfer learning method named ``CONCERT'' to allow robust partial information transfer for high-dimensional…

AI 解读阅读原文 ↗BibTeX ↓

Variational Regularized Bilevel Estimation for Exponential Random Graph Models

指数随机图模型的变分正则化双层估计

I propose an estimation algorithm for Exponential Random Graph Models (ERGM), a popular statistical network model for estimating the structural parameters of strategic network formation in economics and finance. Existing methods often produce unreliable estimates of parameters for the triangle, a key network structure that captures the tendency of two individuals with friends in common to connect. Such unreliable estimates may lead to untrustworthy policy recommendations for…

AI 解读阅读原文 ↗BibTeX ↓

AR-sieve Bootstrap for High-dimensional Time Series

高维时间序列的自回归筛自助法

This paper proposes a new AR-sieve bootstrap approach to high-dimensional time series. The major challenge of classical bootstrap methods on high-dimensional time series is two-fold: curse of dimensionality and temporal dependence. To address such a difficulty, we utilize factor modeling to reduce dimension and capture temporal dependence simultaneously. A factor-based bootstrap procedure is constructed, which performs an AR-sieve bootstrap on the extracted low-dimensional…

AI 解读阅读原文 ↗BibTeX ↓

A Unified Framework for Estimation of High-dimensional Conditional Factor Models

高维条件因子模型估计的统一框架

This paper presents a general framework for estimating high-dimensional conditional latent factor models via constrained nuclear norm regularization. We establish large sample properties of the estimators and provide efficient algorithms for their computation. To improve practical applicability, we propose a cross-validation procedure for selecting the regularization parameter. Our framework unifies the estimation of various conditional factor models, enabling the derivation…

AI 解读阅读原文 ↗BibTeX ↓

Estimation of Semiparametric Factor Models with Missing Data

缺失数据下半参数因子模型的估计

We study semiparametric factor models in high-dimensional panels where the factor loadings consist of a nonparametric component explained by observed covariates and an idiosyncratic component capturing unobserved heterogeneity. A key challenge in empirical applications is the presence of missing observations, which can distort both factor recovery and loading estimation. To address this issue, we develop a projected principal component analysis (PPCA) procedure that…

AI 解读阅读原文 ↗BibTeX ↓

Efficient adjustment for complex covariates: Gaining efficiency with DOPE

复杂协变量的高效调整:利用 DOPE 提升效率

Covariate adjustment is a ubiquitous method used to estimate the average treatment effect (ATE) from observational data. Assuming a known graphical structure of the data generating model, recent results give graphical criteria for optimal adjustment, which enables efficient estimation of the ATE. However, graphical approaches are challenging for high-dimensional and complex data, and it is not straightforward to specify a meaningful graphical model of non-Euclidean data such…

AI 解读阅读原文 ↗BibTeX ↓

Interpretable additive model for analyzing high-dimensional functional time series

分析高维函数型时间序列的可解释加性模型

High-dimensional functional time series offers a powerful framework for extending functional time series analysis to settings with multiple simultaneous dimensions, capturing both temporal dynamics and cross-sectional dependencies. We propose a novel, interpretable additive model tailored for such data, designed to deliver both high predictive accuracy and clear interpretability. The model features bivariate coefficient surfaces to represent relationships across panel…

AI 解读阅读原文 ↗BibTeX ↓

Text Rationalization for Robust Causal Effect Estimation

面向稳健因果效应估计的文本信息筛选

Recent advances in natural language processing have enabled the increasing use of text data in causal inference, particularly for adjusting confounding factors in treatment effect estimation. Although high-dimensional text can encode rich contextual information, it also poses unique challenges for causal identification and estimation. In particular, the positivity assumption, which requires sufficient treatment overlap across confounder values, is often violated at the…

AI 解读阅读原文 ↗BibTeX ↓

Lecture Notes on High Dimensional Linear Regression

高维线性回归讲义

These lecture notes cover advanced topics in linear regression, with an in-depth exploration of the existence, uniqueness, relations, computation, and non-asymptotic properties of the most prominent estimators in this setting. The covered estimators include least squares, ridgeless, ridge, and lasso. The content follows a proposition-proof structure, making it suitable for students seeking a formal and rigorous understanding of the statistical theory underlying machine…

AI 解读阅读原文 ↗BibTeX ↓

Amortized Causal Discovery with Prior-Fitted Networks

利用先验拟合网络实现摊销式因果发现

In recent years, differentiable penalized likelihood methods have gained popularity, optimizing the causal structure by maximizing its likelihood with respect to the data. However, recent research has shown that errors in likelihood estimation, even on relatively large sample sizes, disallow the discovery of proper structures. We propose a new approach to amortized causal discovery that addresses the limitations of likelihood estimator accuracy. Our method leverages…

AI 解读阅读原文 ↗BibTeX ↓

High-dimensional sliced inverse regression with endogeneity

存在内生性时的高维切片逆回归

Sliced inverse regression (SIR) is a popular sufficient dimension reduction method that identifies a few linear transformations of the covariates without losing regression information with the response. In high-dimensional settings, SIR can be combined with sparsity penalties to achieve sufficient dimension reduction and variable selection simultaneously. Nevertheless, both classical and sparse estimators assume the covariates are exogenous. However, endogeneity can arise in…

AI 解读阅读原文 ↗BibTeX ↓

Change Point Detection for Functional Autoregressive Processes on the Sphere

球面函数自回归过程的变点检测

We introduce a novel framework for change point detection in spherical functional autoregressive (SPHAR) processes, enabling the identification of structural breaks in spatio-temporal random fields on the sphere. Our LASSO-regularized estimator, based on penalized dynamic programming in the harmonic domain, operates without knowledge of the number or locations of change points and offers non-asymptotic theoretical guarantees. This approach provides a new tool for analyzing…

AI 解读阅读原文 ↗BibTeX ↓

On Statistical Inference for High-Dimensional Binary Time Series

高维二元时间序列的统计推断

The analysis of non-real-valued data, such as binary time series, has attracted great interest in recent years. This manuscript proposes a post-selection estimator for estimating the coefficient matrices of a high-dimensional generalized binary vector autoregressive process and establishes a Gaussian approximation theorem for the proposed estimator. Furthermore, it introduces a second-order wild bootstrap algorithm to enable statistical inference on the coefficient matrices.…

AI 解读阅读原文 ↗BibTeX ↓

Opening the Black Box: Nowcasting Singapore's GDP Growth and its Explainability

打开黑箱:新加坡 GDP 增长的即时预测与可解释性

Timely assessment of current conditions is essential especially for small, open economies such as Singapore, where external shocks transmit rapidly to domestic activity. We develop a real-time nowcasting framework for quarterly GDP growth using a high-dimensional panel of approximately 70 indicators, encompassing economic and financial indicators over 1990Q1-2023Q2. The analysis covers penalized regressions, dimensionality-reduction methods, ensemble learning algorithms, and…

AI 解读阅读原文 ↗BibTeX ↓

Bayesian Synthetic Control with a Soft Simplex Constraint

带软单纯形约束的贝叶斯合成控制

The challenges posed by high-dimensional data and use of the simplex constraint are two major concerns in the empirical application of the synthetic control method (SCM) in econometric studies. To address both issues simultaneously, we propose a Bayesian SCM that integrates a soft simplex constraint within spike-and-slab variable selection. The hierarchical prior structure captures the extent to which the data supports the simplex constraint, allowing for more efficient and…

AI 解读阅读原文 ↗BibTeX ↓

Data-Driven Policy Learning for Continuous Treatments

连续处理的数据驱动政策学习

This paper studies policy learning for continuous treatments from observational data. Continuous treatments present more significant challenges than discrete ones because population welfare may need nonparametric estimation, and policy space may be infinite-dimensional and may satisfy shape restrictions. We propose to approximate the policy space with a sequence of finite-dimensional spaces and, for any given policy, obtain the empirical welfare by applying the kernel…

AI 解读阅读原文 ↗BibTeX ↓

Convergence Analysis of function-on-function Polynomial regression model

函数对函数多项式回归模型的收敛性分析

In this article, we study the convergence behavior of the regularization-based algorithm for solving the polynomial regression model when both input data and responses are from infinite-dimensional Hilbert spaces. We derive convergence rates for estimation and prediction error by employing general (spectral) regularization under a general smoothness condition without imposing any additional conditions on the index function. We also establish lower bounds for any learning…

AI 解读阅读原文 ↗BibTeX ↓