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

日期精度:到日 124 篇 · 到月 52 篇 · 到年 1 篇

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

SIMPLE-RC: Group network inference with NonSharp nulls and weak signals

SIMPLE-RC:非尖锐原假设与弱信号下的群组网络推断

Large-scale network inference with uncertainty quantification has important applications in natural, social and medical sciences. The recent work of Fan et al. (J. R. Stat. Soc. Ser. B. Stat. Methodol. 84 (2022) 630–653) introduced a general framework of statistical inference on membership profiles in large networks (SIMPLE) for testing the sharp null hypothesis that a pair of given nodes share the same membership profile. In real applications, there are often groups of…

AI 解读阅读原文 ↗BibTeX ↓

Entity Ranking with Covariates and Sparse Intrinsic Scores

结合协变量与稀疏内在得分的实体排序

This paper addresses the item ranking problem with associated covariates, focusing on scenarios where the preference scores can not be fully explained by covariates, and the remaining intrinsic scores are sparse. Specifically, we extend the pioneering Bradley-Terry-Luce (BTL) model by incorporating covariate information and considering sparse individual intrinsic scores. Our work introduces novel model identification conditions and examines the statistical rates of the…

AI 解读阅读原文 ↗BibTeX ↓

Two-way Homogeneity Pursuit for Quantile Network Vector Autoregression

分位数网络向量自回归中的双向同质性分组

We propose a two-way grouped network quantile (TGNQ) autoregression model for time series data observed on networks with substantial heterogeneity and complex directional interactions. Motivated by prior studies on network effects in directed networks, our model assigns each node two latent group memberships to flexibly capture asymmetric and heterogeneous interactions among users. These memberships, along with model parameters, can be consistently estimated using the…

AI 解读阅读原文 ↗BibTeX ↓

Inferences on Mixing Probabilities and Ranking in Mixed-Membership Models

混合成员模型中混合概率与排序的统计推断

Network data is prevalent in numerous big data applications, including economics and health networks, where understanding the latent structure of the network is of prime importance. In this paper, we model the network using the Degree-Corrected Mixed Membership (DCMM) model. In the DCMM model, for each node i, there exists a membership vector πi=(πi(1),πi(2),…,πi(K)), where πi(k) denotes the weight that node i puts in community k. We derive a novel finite-sample expansion…

AI 解读阅读原文 ↗BibTeX ↓

Tests for Principal Eigenvalues and Eigenvectors

主特征值与主特征向量的检验

We establish central limit theorems for principal eigenvalues and eigenvectors under divergent spiked covariance models, and develop three two-sample tests for testing (1) the equality of principal eigenvalues, (2) the stability of eigenvalue proportions, and (3) the invariance of principal eigenvectors. One important application of our results is to understand structural breaks in large factor models. That is, when a structural break is suspected or detected, these tests…

AI 解读阅读原文 ↗BibTeX ↓

Test of independence using generalized distance correlation

利用广义距离相关检验独立性

We study the fundamental statistical inference concerning the testing of independence between two random vectors. Existing asymptotic theories for test statistics based on distance covariance can only apply to either low-dimensional or high-dimensional settings and require stringent distributional assumptions. In this work we develop a new unified distributional theory of the sample generalized distance covariance that works for random vectors of arbitrary dimensions under…

AI 解读阅读原文 ↗BibTeX ↓

Factor Augmented Matrix Regression

因子增广矩阵回归

We introduce Factor-Augmented Matrix Regression (FAMAR) to address the growing applications of matrix-variate data and their associated challenges, particularly with high-dimensionality and covariate correlations. FAMAR encompasses two key algorithms. The first is a novel non-iterative approach that efficiently estimates the factors and loadings of the matrix factor model, using techniques of pre-training, diverse projection, and block-wise averaging. The second algorithm…

AI 解读阅读原文 ↗BibTeX ↓

Isotonic mechanism for exponential family estimation in machine learning peer review

机器学习同行评审中用于指数族估计的保序机制

Abstract In 2023, the International Conference on Machine Learning (ICML) required authors with multiple submissions to rank their papers by perceived quality. In this paper, we leverage these author-specified rankings to enhance peer review in machine learning and artificial intelligence conferences by extending the isotonic mechanism to exponential family distributions. This mechanism produces adjusted scores closely aligned with the original scores while strictly adhering…

AI 解读阅读原文 ↗BibTeX ↓

Factor and idiosyncratic VAR volatility matrix models for heavy-tailed high-frequency financial observations

重尾高频金融观测下的因子与特异性 VAR 波动率矩阵模型

This paper introduces a novel process for both factor and idiosyncratic volatility matrices whose eigenvalues follow the vector auto-regressive (VAR) model. We call it the factor and idiosyncratic VAR (FIVAR) model. The FIVAR model accounts for the dynamics of the factor and idiosyncratic volatilities and includes many parameters. In addition, many empirical studies have shown that high-frequency stock returns and volatilities often exhibit heavy tails. To handle these two…

AI 解读阅读原文 ↗BibTeX ↓

Causality pursuit from heterogeneous environments via neural adversarial invariance learning

通过神经对抗不变性学习从异质环境中追寻因果关系

Pursuing causality from data is a fundamental problem in scientific discovery, treatment intervention, and transfer learning. This paper introduces a novel algorithmic method for addressing nonparametric invariance and causality learning in regression models across multiple environments, where the joint distribution of response variables and covariates varies, but the conditional expectations of outcome given an unknown set of quasi-causal variables are invariant. The…

AI 解读阅读原文 ↗BibTeX ↓

Structured matrix learning under arbitrary entrywise dependence and estimation of Markov transition kernel

任意元素依赖下的结构化矩阵学习与马尔可夫转移核估计

The problem of structured matrix estimation has been studied mostly under strong noise dependence assumptions. This paper considers a general framework of noisy low-rank-plus-sparse matrix recovery, where the noise matrix may come from any joint distribution with arbitrary dependence across entries. We propose an incoherent-constrained least-square estimator and prove its tightness both in the sense of deterministic lower bound and matching minimax risks under various noise…

AI 解读阅读原文 ↗BibTeX ↓

Robust transfer learning with unreliable source data

使用不可靠源数据的稳健迁移学习

This paper addresses challenges in robust transfer learning stemming from ambiguity in Bayes classifiers and weak transferable signals between the target and source distribution. We introduce a novel quantity called the ''ambiguity level'' that measures the discrepancy between the target and source regression functions, propose a simple transfer learning procedure, and establish a general theorem that shows how this new quantity is related to the transferability of learning…

AI 解读阅读原文 ↗BibTeX ↓

Communication-Efficient Distributed Estimation and Inference for Cox’s Model

Cox模型中通信高效的分布式估计与推断

Motivated by multi-center biomedical studies that cannot share individual data due to privacy and ownership concerns, we develop communication-efficient iterative distributed algorithms for estimation and inference in the high-dimensional sparse Cox proportional hazards model. We demonstrate that our estimator, even with a relatively small number of iterations, achieves the same convergence rate as the ideal full-sample estimator under very mild conditions. To construct…

AI 解读阅读原文 ↗BibTeX ↓

Simultaneous estimation and group identification for network vector autoregressive model with heterogeneous nodes

异质节点网络向量自回归的联合估计与分组识别

Individuals or companies in a large social or financial network often display rather heterogeneous behaviors for various reasons. In this work, we propose a network vector autoregressive model with a latent group structure to model heterogeneous dynamic patterns observed from network nodes, for which group-wise network effects and time-invariant fixed-effects can be naturally incorporated. In our framework, the model parameters and network node memberships can be…

AI 解读阅读原文 ↗BibTeX ↓

Robust Matrix Completion with Heavy-Tailed Noise

重尾噪声下的稳健矩阵补全

This paper studies low-rank matrix completion in the presence of heavy-tailed and possibly asymmetric noise, where we aim to estimate an underlying low-rank matrix given a set of highly incomplete noisy entries. Though the matrix completion problem has attracted much attention in the past decade, there is still lack of theoretical understanding when the observations are contaminated by heavy-tailed noises. Prior theory falls short of explaining the empirical results and is…

AI 解读阅读原文 ↗BibTeX ↓

Ranking Inferences Based on the Top Choice of Multiway Comparisons

基于多项比较首选结果的排序推断

This paper considers ranking inference of $n$ items based on the observed data on the top choice among $M$ randomly selected items at each trial. This is a useful modification of the Plackett-Luce model for $M$-way ranking with only the top choice observed and is an extension of the celebrated Bradley-Terry-Luce model that corresponds to $M=2$. Under a uniform sampling scheme in which any $M$ distinguished items are selected for comparisons with probability $p$ and the…

AI 解读阅读原文 ↗BibTeX ↓

Deep neural networks for nonparametric interaction models with diverging dimension

维度增长的非参数交互模型中的深度神经网络

Deep neural networks have achieved tremendous success due to their representation power and adaptation to low-dimensional structures. Their potential for estimating structured regression functions has been recently established in the literature. However, most of the studies require the input dimension to be fixed and consequently ignore the effect of dimension on the rate of convergence and hamper their applications to modern big data with high dimensionality. In this paper,…

AI 解读阅读原文 ↗BibTeX ↓

Environment invariant linear least squares

环境不变线性最小二乘

This paper considers a multi-environment linear regression model in which data from multiple experimental settings are collected. The joint distribution of the response variable and covariates may vary across different environments, yet the conditional expectations of the response variable, given the unknown set of important variables, are invariant. Such a statistical model is related to the problem of endogeneity, causal inference, and transfer learning. The motivation…

AI 解读阅读原文 ↗BibTeX ↓

Factor Augmented Sparse Throughput Deep ReLU Neural Networks for High Dimensional Regression

用于高维回归的因子增强稀疏直通深度 ReLU 神经网络

This paper introduces a Factor Augmented Sparse Throughput (FAST) model that utilizes both latent factors and sparse idiosyncratic components for nonparametric regression. The FAST model bridges factor models on one end and sparse nonparametric models on the other end. It encompasses structured nonparametric models such as factor augmented additive models and sparse low-dimensional nonparametric interaction models and covers the cases where the covariates do not admit factor…

AI 解读阅读原文 ↗BibTeX ↓

How do noise tails impact on deep ReLU networks?

This paper investigates the stability of deep ReLU neural networks for nonparametric regression under the assumption that the noise has only a finite p-th moment. We unveil how the optimal rate of convergence depends on p, the degree of smoothness and the intrinsic dimension in a class of nonparametric regression functions with hierarchical composition structure when both the adaptive Huber loss and deep ReLU neural networks are used. This optimal rate of convergence cannot…

阅读原文 ↗BibTeX ↓

Semi-parametric tensor factor analysis by iteratively projected singular value decomposition

通过迭代投影奇异值分解进行半参数张量因子分析

Abstract This paper introduces a general framework of Semi-parametric TEnsor Factor Analysis (STEFA) that focuses on the methodology and theory of low-rank tensor decomposition with auxiliary covariates. Semi-parametric TEnsor Factor Analysis models extend tensor factor models by incorporating auxiliary covariates in the loading matrices. We propose an algorithm of iteratively projected singular value decomposition (IP-SVD) for the semi-parametric estimation. It iteratively…

AI 解读阅读原文 ↗BibTeX ↓

Are Latent Factor Regression and Sparse Regression Adequate?

潜在因子回归与稀疏回归是否充分?

We propose the Factor Augmented sparse linear Regression Model (FARM) that not only encompasses both the latent factor regression and sparse linear regression as special cases but also bridges dimension reduction and sparse regression together. We provide theoretical guarantees for the estimation of our model under the existence of sub-Gaussian and heavy-tailed noises (with bounded (1+x)-th moment, for all x>0), respectively. In addition, the existing works on supervised…

AI 解读阅读原文 ↗BibTeX ↓

Inference for heteroskedastic PCA with missing data

缺失数据下异方差主成分分析的统计推断

This paper studies how to construct confidence regions for principal component analysis (PCA) in high dimension, a problem that has been vastly underexplored. While computing measures of uncertainty for nonlinear/nonconvex estimators is in general difficult in high dimension, the challenge is further compounded by the prevalent presence of missing data and heteroskedastic noise. We propose a novel approach to performing valid inference on the principal subspace, on the basis…

AI 解读阅读原文 ↗BibTeX ↓

Policy Optimization Using Semiparametric Models for Dynamic Pricing

In this paper, we study the contextual dynamic pricing problem where the market value of a product is linear in its observed features plus some market noise. Products are sold one at a time, and only a binary response indicating success or failure of a sale is observed. Our model setting is similar to Javanmard and Nazerzadeh [2019] except that we expand the demand curve to a semiparametric model and need to learn dynamically both parametric and nonparametric components. We…

阅读原文 ↗BibTeX ↓