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

日期精度:到日 13914 篇 · 到月 22329 篇 · 到年 2841 篇 · 未提供 26 篇

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

Consistent Community Detection in Inter-Layer Dependent Multi-Layer Networks

层间依赖多层网络的一致社群检测

Community detection in multi-layer networks, which aims at finding groups of nodes with similar connective patterns among all layers, has attracted tremendous interests in multi-layer network analysis. Most existing methods are extended from those for single-layer networks, which assume that different layers are independent. In this article, we propose a novel community detection method in multi-layer networks with inter-layer dependence, which integrates the stochastic…

AI 解读阅读原文 ↗BibTeX ↓

Dynamic Matrix Recovery

动态矩阵恢复

Matrix recovery from sparse observations is an extensively studied topic emerging in various applications, such as recommendation system and signal processing, which includes the matrix completion and compressed sensing models as special cases. In this article, we propose a general framework for dynamic matrix recovery of low-rank matrices that evolve smoothly over time. We start from the setting that the observations are independent across time, then extend to the setting…

AI 解读阅读原文 ↗BibTeX ↓

Identifiability and Consistent Estimation for Gaussian Chain Graph Models

高斯链图模型的可识别性与一致估计

The chain graph model admits both undirected and directed edges in one graph, where symmetric conditional dependencies are encoded via undirected edges and asymmetric causal relations are encoded via directed edges. Though frequently encountered in practice, the chain graph model has been largely under investigated in literature, possibly due to the lack of identifiability conditions between undirected and directed edges. In this paper, we first establish a set of novel…

AI 解读阅读原文 ↗BibTeX ↓

Extremal Random Forests

极值随机森林

Classical methods for quantile regression fail in cases where the quantile of interest is extreme and only few or no training data points exceed it. Asymptotic results from extreme value theory can be used to extrapolate beyond the range of the data, and several approaches exist that use linear regression, kernel methods or generalized additive models. Most of these methods break down if the predictor space has more than a few dimensions or if the regression function of…

AI 解读阅读原文 ↗BibTeX ↓

Policy Learning with Asymmetric Counterfactual Utilities

具有非对称反事实效用的政策学习

Data-driven decision making plays an important role even in high stakes settings like medicine and public policy. Learning optimal policies from observed data requires a careful formulation of the utility function whose expected value is maximized across a population. Although researchers typically use utilities that depend on observed outcomes alone, in many settings the decision maker’s utility function is more properly characterized by the joint set of potential outcomes…

AI 解读阅读原文 ↗BibTeX ↓

A Composite Likelihood-Based Approach for Change-Point Detection in Spatio-Temporal Processes

基于复合似然的时空过程变点检测

This article develops a unified and computationally efficient method for change-point estimation along the time dimension in a nonstationary spatio-temporal process. By modeling a nonstationary spatio-temporal process as a piecewise stationary spatio-temporal process, we consider simultaneous estimation of the number and locations of change-points, and model parameters in each segment. A composite likelihood-based criterion is developed for change-point and parameter…

AI 解读阅读原文 ↗BibTeX ↓

Fitting Latent Non-Gaussian Models Using Variational Bayes and Laplace Approximations

利用变分贝叶斯与拉普拉斯近似拟合潜在非高斯模型

Latent Gaussian models (LGMs) are perhaps the most commonly used class of models in statistical applications. Nevertheless, in areas ranging from longitudinal studies in biostatistics to geostatistics, it is easy to find datasets that contain inherently non-Gaussian features, such as sudden jumps or spikes, that adversely affect the inferences and predictions made using an LGM. These datasets require more general latent non-Gaussian models (LnGMs) that can handle…

AI 解读阅读原文 ↗BibTeX ↓

Graphical Principal Component Analysis of Multivariate Functional Time Series

多元函数型时间序列的图主成分分析

In this paper, we consider multivariate functional time series with a two-way dependence structure: a serial dependence across time points and a graphical interaction among the multiple functions within each time point. We develop the notion of dynamic weak separability, a more general condition than those assumed in literature, and use it to characterize the two-way structure in multivariate functional time series. Based on the proposed weak separability, we develop a…

AI 解读阅读原文 ↗BibTeX ↓

Robust Validation: Confident Predictions Even When Distributions Shift

稳健验证:分布漂移下的预测不确定性保障

While the traditional viewpoint in machine learning and statistics assumes training and testing samples come from the same population, practice belies this fiction. One strategy—coming from robust statistics and optimization—is thus to build a model robust to distributional perturbations. In this article, we take a different approach to describe procedures for robust predictive inference, where a model provides uncertainty estimates on its predictions rather than point…

AI 解读阅读原文 ↗BibTeX ↓

A Kernel Measure of Dissimilarity between M Distributions

多个分布之间的核差异度量

Given M≥2 distributions defined on a general measurable space, we introduce a nonparametric (kernel) measure of multi-sample dissimilarity (KMD)—a parameter that quantifies the difference between the M distributions. The population KMD, which takes values between 0 and 1, is 0 if and only if all the M distributions are the same, and 1 if and only if all the distributions are mutually singular. Moreover, KMD possesses many properties commonly associated with f-divergences…

AI 解读阅读原文 ↗BibTeX ↓

Online Statistical Inference for Stochastic Optimization via Kiefer-Wolfowitz Methods

基于 Kiefer–Wolfowitz 方法的随机优化在线统计推断

This article investigates the problem of online statistical inference of model parameters in stochastic optimization problems via the Kiefer-Wolfowitz algorithm with random search directions. We first present the asymptotic distribution for the Polyak-Ruppert-averaging type Kiefer-Wolfowitz (AKW) estimators, whose asymptotic covariance matrices depend on the distribution of search directions and the function-value query complexity. The distributional result reflects the…

AI 解读阅读原文 ↗BibTeX ↓

Clustering High-Dimensional Noisy Categorical Data

高维含噪类别数据的聚类

Clustering is a widely used unsupervised learning technique that groups data into homogeneous clusters. However, when dealing with real-world data that contain categorical values, existing algorithms can be computationally costly in high dimensions and can struggle with noisy data that has missing values. Furthermore, except for one algorithm, no others provide theoretical guarantees of clustering accuracy. In this article, we propose a general categorical data encoding…

AI 解读阅读原文 ↗BibTeX ↓

Split Knockoffs for Multiple Comparisons: Controlling the Directional False Discovery Rate

多重比较的分割 Knockoff:控制方向性错误发现率

Multiple comparisons in hypothesis testing often encounter structural constraints in various applications. For instance, in structural Magnetic Resonance Imaging for Alzheimer’s Disease, the focus extends beyond examining atrophic brain regions to include comparisons of anatomically adjacent regions. These constraints can be modeled as linear transformations of parameters, where the sign patterns play a crucial role in estimating directional effects. This class of problems,…

AI 解读阅读原文 ↗BibTeX ↓

Model-Robust and Efficient Covariate Adjustment for Cluster-Randomized Experiments

集群随机实验中模型稳健且有效的协变量调整

Cluster-randomized experiments are increasingly used to evaluate interventions in routine practice conditions, and researchers often adopt model-based methods with covariate adjustment in the statistical analyses. However, the validity of model-based covariate adjustment is unclear when the working models are misspecified, leading to ambiguity of estimands and risk of bias. In this article, we first adapt two conventional model-based methods, generalized estimating equations…

AI 解读阅读原文 ↗BibTeX ↓

Balancing Covariates in Randomized Experiments with the Gram–Schmidt Walk Design

利用 Gram–Schmidt Walk 设计平衡随机实验协变量

The design of experiments involves a compromise between covariate balance and robustness.This article provides a formalization of this tradeoff and describes an experimental design that allows experimenters to navigate it.The design is specified by a robustness parameter that bounds the worst-case mean squared error of an estimator of the average treatment effect.Subject to the experimenter's desired level of robustness, the design aims to simultaneously balance all linear…

AI 解读阅读原文 ↗BibTeX ↓

Bootstrap Inference in the Presence of Bias

存在偏差时的自助法推断

We consider bootstrap inference for estimators which are (asymptotically) biased. We show that, even when the bias term cannot be consistently estimated, valid inference can be obtained by proper implementations of the bootstrap. Specifically, we show that the prepivoting approach of Beran (1987, 1988), originally proposed to deliver higher-order refinements, restores bootstrap validity by transforming the original bootstrap p-value into an asymptotically uniform random…

AI 解读阅读原文 ↗BibTeX ↓

Bounding Wasserstein Distance with Couplings

利用耦合界定 Wasserstein 距离

Markov chain Monte Carlo (MCMC) provides asymptotically consistent estimates of intractable posterior expectations as the number of iterations tends to infinity. However, in large data applications, MCMC can be computationally expensive per iteration. This has catalyzed interest in approximating MCMC in a manner that improves computational speed per iteration but does not produce asymptotically consistent estimates. In this article, we propose estimators based on couplings…

AI 解读阅读原文 ↗BibTeX ↓

Minimum Resource Threshold Policy Under Partial Interference

部分干扰下的最低资源阈值政策

When developing policies for prevention of infectious diseases, policymakers often set specific, outcome-oriented targets to achieve. For example, when developing a vaccine allocation policy, policymakers may want to distribute them so that at least a certain fraction of individuals in a census block are disease-free and spillover effects due to interference within blocks are accounted for. The article proposes methods to estimate a block-level treatment policy that achieves…

AI 解读阅读原文 ↗BibTeX ↓

Semi-Distance Correlation and Its Applications

半距离相关及其应用

We propose a new measure of dependence between a categorical random variable and a random vector with potentially high dimensions, named semi-distance correlation. It is an interesting extension of distance correlation to accommodate the information of the categorical random variable. It equals zero if and only if the categorical random variable and the other random vector are independent. Two important applications of semi-distance correlation are considered. First, we…

AI 解读阅读原文 ↗BibTeX ↓

Causal Inference with Noncompliance and Unknown Interference

存在不依从与未知干扰时的因果推断

We consider a causal inference model in which individuals interact in a social network and they may not comply with the assigned treatments. In particular, we suppose that the form of network interference is unknown to researchers. To estimate meaningful causal parameters in this situation, we introduce a new concept of exposure mapping, which summarizes potentially complicated spillover effects into a fixed dimensional statistic of instrumental variables. We investigate…

AI 解读阅读原文 ↗BibTeX ↓

A Decorrelating and Debiasing Approach to Simultaneous Inference for High-Dimensional Confounded Models

高维混杂模型同时推断的去相关与去偏方法

Motivated by the simultaneous association analysis with the presence of latent confounders, this article studies the large-scale hypothesis testing problem for the high-dimensional confounded linear models with both non-asymptotic and asymptotic false discovery control. Such model covers a wide range of practical settings where both the response and the predictors may be confounded. In the presence of the high-dimensional predictors and the unobservable confounders, the…

AI 解读阅读原文 ↗BibTeX ↓

Optimal Subsampling via Predictive Inference

通过预测推断实现最优子抽样

In the big data era, subsampling or sub-data selection techniques are often adopted to extract a fraction of informative individuals from the massive data. Existing subsampling algorithms focus mainly on obtaining a representative subset to achieve the best estimation accuracy under a given class of models. In this article, we consider a semi-supervised setting wherein a small or moderate sized “labeled” data is available in addition to a much larger sized “unlabeled” data.…

AI 解读阅读原文 ↗BibTeX ↓

Optimal and Safe Estimation for High-Dimensional Semi-Supervised Learning

高维半监督学习的最优与安全估计

We consider the estimation problem in high-dimensional semi-supervised learning. Our goal is to investigate when and how the unlabeled data can be exploited to improve the estimation of the regression parameters of linear model in light of the fact that such linear models may be misspecified in data analysis. We first establish the minimax lower bound for parameter estimation in the semi-supervised setting, and show that this lower bound cannot be achieved by supervised…

AI 解读阅读原文 ↗BibTeX ↓

Online Regularization toward Always-Valid High-Dimensional Dynamic Pricing

面向始终有效高维动态定价的在线正则化

–Devising a dynamic pricing policy with always valid online statistical learning procedures is an important and as yet unresolved problem. Most existing dynamic pricing policies, which focus on the faithfulness of adopted customer choice models, exhibit a limited capability for adapting to the online uncertainty of learned statistical models during the pricing process. In this article, we propose a novel approach for designing a dynamic pricing policy based on regularized…

AI 解读阅读原文 ↗BibTeX ↓