跳到正文
收录说明
收录范围
保留计量方法研究、相关统计基础,以及实质涉及计量方法的应用、教程、比较和综述。书评、刊务及明确无关内容不公开;身份或相关性证据不足的记录保留待核,补充可靠材料后可重新判断。
当前期刊来源见下方官网链接及期刊目录。综合经济学与金融期刊逐篇筛查计量方向,证据不足时暂不公开。正刊、在线优先论文和已核实接收稿合并展示;按标题、可靠摘要、目录及身份匹配的出版社 JEL 分类核验相关性;计量类 JEL 与摘要相互印证,无 JEL 不直接排除。历史回补以可取得的注册题录和目录为准,不等于覆盖全部纸本。
日期与排序
默认按最近发表排序:正刊使用刊期,待刊使用上线日期;缺少上线日期时,排序参考登记或首次收录时间,并在卡片注明。更多筛选可选择出版状态和日期口径;卷期依据出版社元数据,不因待刊时间较长而推定已编入正刊。仅有月份或年份时,日期区间相交也会纳入。

日期精度:到日 2471 篇 · 到月 886 篇 · 到年 54 篇 · 未提供 6 篇

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

Feature-splitting algorithms for ultrahigh dimensional quantile regression

超高维分位数回归的特征拆分算法

This paper is concerned with computational issues related to penalized quantile regression (PQR) with ultrahigh dimensional predictors. Various algorithms have been developed for PQR, but they become ineffective and/or infeasible in the presence of ultrahigh dimensional predictors due to the storage and scalability limitations. The variable updating schema of the feature-splitting algorithm that directly applies the ordinary alternating direction method of multiplier (ADMM)…

AI 解读阅读原文 ↗BibTeX ↓

Corrected generalized cross-validation for finite ensembles of penalized estimators

有限惩罚估计集成的修正广义交叉验证

Abstract Generalized cross-validation (GCV) is a widely used method for estimating the squared out-of-sample prediction risk that employs scalar degrees of freedom adjustment (in a multiplicative sense) to the squared training error. In this paper, we examine the consistency of GCV for estimating the prediction risk of arbitrary ensembles of penalized least-squares estimators. We show that GCV is inconsistent for any finite ensemble of size greater than one. Towards…

AI 解读阅读原文 ↗BibTeX ↓

Sparse Bayesian Group Factor Model for Feature Interactions in Multiple Count Tables Data

多计数表特征交互的稀疏贝叶斯组因子模型

Group factor models have been developed to infer relationships between multiple co-occurring multivariate continuous responses. Motivated by complex count data from multi-domain microbiome studies using next-generation sequencing, we develop a sparse Bayesian group factor model (Sp-BGFM) for multiple count table data that captures the interaction between microorganisms in different domains. Sp-BGFM uses a rounded kernel mixture model using a Dirichlet process (DP) prior with…

AI 解读阅读原文 ↗BibTeX ↓

Inferring Covariance Structure from Multiple Data Sources via Subspace Factor Analysis

通过子空间因子分析推断多来源数据的协方差结构

Factor analysis provides a canonical framework for imposing lower-dimensional structure such as sparse covariance in high-dimensional data. High-dimensional data on the same set of variables are often collected under different conditions, for instance in reproducing studies across research groups. In such cases, it is natural to seek to learn the shared versus condition-specific structure. Existing hierarchical extensions of factor analysis have been proposed, but face…

AI 解读阅读原文 ↗BibTeX ↓

Zigzag Path Connects Two Monte Carlo Samplers: Hamiltonian Counterpart to a Piecewise Deterministic Markov Process

连接两类蒙特卡洛采样器的折线路径:分段确定性马尔可夫过程的哈密顿对应

Zigzag and other piecewise deterministic Markov process samplers have attracted significant interest for their non-reversibility and other appealing properties for Bayesian posterior computation. Hamiltonian Monte Carlo is another state-of-the-art sampler, exploiting fictitious momentum to guide Markov chains through complex target distributions. We establish an important connection between the zigzag sampler and a variant of Hamiltonian Monte Carlo based on…

AI 解读阅读原文 ↗BibTeX ↓

Deep Regression Learning with Optimal Loss Function

采用最优损失函数的深度回归学习

In this article, we develop a novel efficient and robust nonparametric regression estimator under a framework of a feedforward neural network (FNN). There are several interesting characteristics for the proposed estimator. First, the loss function is built upon an estimated maximum likelihood function, which integrates the information from observed data as well as the information from the data distribution. Consequently, the resulting estimator has desirable optimal…

AI 解读阅读原文 ↗BibTeX ↓

Estimating Higher-Order Mixed Memberships via the l2,∞ Tensor Perturbation Bound

利用逐行张量扰动界估计高阶混合社群成员关系

Higher-order multiway data is ubiquitous in machine learning and statistics and often exhibits community-like structures, where each component (node) along each different mode has a community membership associated with it. In this article we propose the sub-Gaussian) tensor mixed-membership blockmodel, a generalization of the tensor blockmodel positing that memberships need not be discrete, but instead are convex combinations of latent communities. We establish the…

AI 解读阅读原文 ↗BibTeX ↓

A Sparse Beta Regression Model for Network Analysis

用于网络分析的稀疏 β 回归模型

For statistical analysis of network data, the β-model has emerged as a useful tool, thanks to its flexibility in incorporating nodewise heterogeneity and theoretical tractability. To generalize the β-model, this article proposes the Sparse β-Regression Model (S β RM) that unites two research themes developed recently in modeling homophily and sparsity. In particular, we employ differential heterogeneity that assigns weights only to important nodes and propose penalized…

AI 解读阅读原文 ↗BibTeX ↓

A Model-Agnostic Graph Neural Network for Integrating Local and Global Information

整合局部与全局信息的模型无关图神经网络

Graph Neural Networks (GNNs) have achieved promising performance in a variety of graph-focused tasks. Despite their success, however, existing GNNs suffer from two significant limitations: a lack of interpretability in their results due to their black-box nature, and an inability to learn representations of varying orders. To tackle these issues, we propose a novel Model-agnostic Graph Neural Network (MaGNet) framework, which is able to effectively integrate information of…

AI 解读阅读原文 ↗BibTeX ↓

Robust Estimation for Number of Factors in High Dimensional Factor Modeling via Spearman Correlation Matrix

基于 Spearman 相关矩阵的高维因子数稳健估计

Determining the number of factors in high-dimensional factor modeling is essential but challenging, especially when the data are heavy-tailed. In this article, we introduce a new estimator based on the spectral properties of Spearman sample correlation matrix under the high-dimensional setting, where both dimension and sample size tend to infinity proportionally. Our estimator is robust against heavy tails in either the common factors or idiosyncratic errors. The consistency…

AI 解读阅读原文 ↗BibTeX ↓

Semi-Supervised Triply Robust Inductive Transfer Learning

半监督三重稳健归纳迁移学习

In this work, we propose a Semi-supervised Triply Robust Inductive transFer LEarning (STRIFLE) approach, which integrates heterogeneous data from a label-rich source population and a label-scarce target population and uses a large amount of unlabeled data simultaneously to improve the learning accuracy in the target population. Specifically, we consider a high dimensional covariate shift setting and employ two nuisance models, a density ratio model and an imputation model,…

AI 解读阅读原文 ↗BibTeX ↓

Statistical Inference for Networks of High-Dimensional Point Processes

高维点过程网络的统计推断

Fueled in part by recent applications in neuroscience, the multivariate Hawkes process has become a popular tool for modeling the network of interactions among high-dimensional point process data. While evaluating the uncertainty of the network estimates is critical in scientific applications, existing methodological and theoretical work has primarily addressed estimation. To bridge this gap, we develop a new statistical inference procedure for high-dimensional Hawkes…

AI 解读阅读原文 ↗BibTeX ↓

Parallel Sampling of Decomposable Graphs Using Markov Chains on Junction Trees

利用连接树上的马尔可夫链并行采样可分解图

Bayesian inference for undirected graphical models is mostly restricted to the class of decomposable graphs, as they enjoy a rich set of properties making them amenable to high-dimensional problems. While parameter inference is straightforward in this setup, inferring the underlying graph is a challenge driven by the computational difficulty in exploring the space of decomposable graphs. This work makes two contributions to address this problem. First, we provide sufficient…

AI 解读阅读原文 ↗BibTeX ↓

Efficient Multiple Change Point Detection and Localization For High-Dimensional Quantile Regression with Heteroscedasticity

异方差高维分位数回归的多重变点检测与定位

Data heterogeneity is a challenging issue for modern statistical data analysis. There are different types of data heterogeneity in practice. In this article, we consider potential structural changes and complicated tail distributions. There are various existing methods proposed to handle either structural changes or heteroscedasticity. However, it is difficult to handle them simultaneously. To overcome this limitation, we consider statistically and computationally efficient…

AI 解读阅读原文 ↗BibTeX ↓

Supervised Dynamic PCA: Linear Dynamic Forecasting with Many Predictors

监督式动态主成分分析:多预测变量下的线性动态预测

This paper proposes a novel dynamic forecasting method using a new supervised Principal Component Analysis (PCA) when a large number of predictors are available. The new supervised PCA provides an effective way to bridge the gap between predictors and the target variable of interest by scaling and combining the predictors and their lagged values, resulting in an effective dynamic forecasting. Unlike the traditional diffusion-index approach, which does not learn the…

AI 解读阅读原文 ↗BibTeX ↓

Enhanced Response Envelope via Envelope Regularization

通过包络正则化增强响应包络模型

The response envelope model provides substantial efficiency gains over the standard multivariate linear regression by identifying the material part of the response to the model and by excluding the immaterial part. In this article, we propose the enhanced response envelope by incorporating a novel envelope regularization term based on a nonconvex manifold formulation. It is shown that the enhanced response envelope can yield better prediction risk than the original envelope…

AI 解读阅读原文 ↗BibTeX ↓

Test and Measure for Partial Mean Dependence Based on Machine Learning Methods

基于机器学习的部分均值依赖检验与度量

It is of importance to investigate the significance of a subset of covariates W for the response Y given covariates Z in regression modeling. To this end, we propose a significance test for the partial mean independence problem based on machine learning methods and data splitting. The test statistic converges to the standard Chi-squared distribution under the null hypothesis while it converges to a normal distribution under the fixed alternative hypothesis. Power enhancement…

AI 解读阅读原文 ↗BibTeX ↓

Quasi Maximum Likelihood Estimation for Large-Dimensional Matrix Factor Models

高维矩阵因子模型的准最大似然估计

In this study, we introduce a novel approach, called the quasi maximum likelihood estimation (Q-MLE), for estimating large-dimensional matrix factor models. In contrast to the principal component analysis based approach, Q-MLE considers the heteroscedasticity of the idiosyncratic error term, the heteroscedasticity of which is simultaneously estimated with other parameters. Interestingly, under the homoscedasticity assumption of the idiosyncratic error, the Q-MLE estimator…

AI 解读阅读原文 ↗BibTeX ↓

A Heteroscedasticity-Robust Overidentifying Restriction Test with High-Dimensional Covariates

高维协变量下对异方差稳健的过度识别约束检验

This paper proposes an overidentifying restriction test for high-dimensional linear instrumental variable models. The novelty of the proposed test is that it allows the number of covariates and instruments to be larger than the sample size. The test is scale-invariant and robust to heteroskedastic errors. To construct the final test statistic, we first introduce a test based on the maximum norm of multiple parameters that could be high-dimensional. The theoretical power…

AI 解读阅读原文 ↗BibTeX ↓

Multiperiod Dynamic Portfolio Choice: When High Dimensionality Meets Return Predictability

多期动态投资组合选择:高维资产与收益可预测性

Multiperiod portfolio choice is the central problem in active asset management. Multiperiod dynamic portfolios are notoriously difficult to solve, especially when there are hundreds of tradable assets as well as a large number of state variables. In this article, we develop a novel two-step methodology to solve the multiperiod dynamic portfolio choice problem with high dimensional assets in the presence of return predictability conditional on a large number of state…

AI 解读阅读原文 ↗BibTeX ↓

Asymptotic equivalence of locally stationary processes and bivariate Gaussian white noise

局部平稳过程与二维高斯白噪声的渐近等价性

We consider a general class of statistical experiments, in which an n-dimensional centered Gaussian random variable is observed and its covariance matrix is the parameter of interest. The covariance matrix is assumed to be well-approximable in a linear space of lower dimension Kn with eigenvalues uniformly bounded away from zero and infinity. We prove asymptotic equivalence of this experiment and a class of Kn-dimensional Gaussian models with informative expectation in Le…

AI 解读阅读原文 ↗BibTeX ↓

Precise error rates for computationally efficient testing

计算高效检验的精确错误率

We revisit the fundamental question of simple-versus-simple hypothesis testing with an eye toward computational complexity, as the statistically optimal likelihood ratio test is often computationally intractable in high-dimensional settings. In the classical spiked Wigner model with a general i.i.d. spike prior, we show (conditional on a conjecture) that an existing test based on linear spectral statistics achieves the best possible trade-off curve between type-I and type-II…

AI 解读阅读原文 ↗BibTeX ↓

The generalization error of max-margin linear classifiers: Benign overfitting and high dimensional asymptotics in the overparametrized regime

最大间隔线性分类器的泛化误差:过参数化下的良性过拟合与高维渐近

Modern machine learning classifiers often exhibit vanishing classification error on the training set. They achieve this by learning nonlinear representations of the inputs that map the data into linearly separable classes. Motivated by these phenomena, we revisit high-dimensional maximum margin classification for linearly separable data. We consider a stylized setting in which data (yi,xi), i≤n are i.i.d. with xi∼N(0,Σ) a p-dimensional Gaussian feature vector, and yi∈{+1,−1}…

AI 解读阅读原文 ↗BibTeX ↓

Deep approximate policy iteration

深度近似策略迭代

In this paper, we consider deep approximate policy iteration (DAPI) with the Bellman residual minimization in reinforcement learning. In each iteration of DAPI, we apply convolutional neural networks (CNNs) with ReLU activation, called ReLU CNNs, to estimate the fixed point of the Bellman equation by minimizing an unbiased minimax loss. To bound the estimation error in each iteration, we control the statistical and approximation errors using the tools of the empirical…

AI 解读阅读原文 ↗BibTeX ↓