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

日期精度:到日 13922 篇 · 到月 22332 篇 · 到年 2841 篇 · 未提供 26 篇

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

Reversible Jump PDMP Samplers for Variable Selection

用于变量选择的可逆跳跃分段确定性马尔可夫过程采样器

A new class of Markov chain Monte Carlo (MCMC) algorithms, based on simulating piecewise deterministic Markov processes (PDMPs), has recently shown great promise: they are nonreversible, can mix better than standard MCMC algorithms, and can use subsampling ideas to speed up computation in big data scenarios. However, current PDMP samplers can only sample from posterior densities that are differentiable almost everywhere, which precludes their use for model choice. Motivated…

AI 解读阅读原文 ↗BibTeX ↓

Benign Overfitting and Noisy Features

良性过拟合与含噪特征

Modern machine learning models often exhibit the benign overfitting phenomenon, which has recently been characterized using the double descent curves. In addition to the classical U-shaped learning curve, the learning risk undergoes another descent as we increase the number of parameters beyond a certain threshold. In this article, we examine the conditions under which benign overfitting occurs in the random feature (RF) models, that is, in a two-layer neural network with…

AI 解读阅读原文 ↗BibTeX ↓

Hypothesis Tests for Structured Rank Correlation Matrices

结构化秩相关矩阵的假设检验

Joint modeling of a large number of variables often requires dimension reduction strategies that lead to structural assumptions of the underlying correlation matrix, such as equal pair-wise correlations within subsets of variables. The underlying correlation matrix is thus of interest for both model specification and model validation. In this article, we develop tests of the hypothesis that the entries of the Kendall rank correlation matrix are linear combinations of a…

AI 解读阅读原文 ↗BibTeX ↓

Online Bootstrap Inference For Policy Evaluation In Reinforcement Learning

强化学习策略评估的在线自助法推断

The recent emergence of reinforcement learning (RL) has created a demand for robust statistical inference methods for the parameter estimates computed using these algorithms. Existing methods for inference in online learning are restricted to settings involving independently sampled observations, while inference methods in RL have so far been limited to the batch setting. The bootstrap is a flexible and efficient approach for statistical inference in online learning…

AI 解读阅读原文 ↗BibTeX ↓

Learning Topic Models: Identifiability and Finite-Sample Analysis

主题模型学习:可识别性与有限样本分析

Topic models provide a useful text-mining tool for learning, extracting, and discovering latent structures in large text corpora. Although a plethora of methods have been proposed for topic modeling, lacking in the literature is a formal theoretical investigation of the statistical identifiability and accuracy of latent topic estimation. In this article, we propose a maximum likelihood estimator (MLE) of latent topics based on a specific integrated likelihood that is…

AI 解读阅读原文 ↗BibTeX ↓

Permutation Tests at Nonparametric Rates

适用于非参数收敛速度的置换检验

Classical two-sample permutation tests for equality of distributions have exact size in finite samples, but they fail to control size for testing equality of parameters that summarize each distribution. This paper proposes permutation tests for equality of parameters that are estimated at root-$n$ or slower rates. Our general framework applies to both parametric and nonparametric models, with two samples or one sample split into two subsamples. Our tests have correct size…

AI 解读阅读原文 ↗BibTeX ↓

Bayesian Inference Using Synthetic Likelihood: Asymptotics and Adjustments

合成似然贝叶斯推断:渐近性质与调整

Implementing Bayesian inference is often computationally challenging in complex models, especially when calculating the likelihood is difficult. Synthetic likelihood is one approach for carrying out inference when the likelihood is intractable, but it is straightforward to simulate from the model. The method constructs an approximate likelihood by taking a vector summary statistic as being multivariate normal, with the unknown mean and covariance estimated by simulation.…

AI 解读阅读原文 ↗BibTeX ↓

Conditional Separable Effects

条件可分离效应

Researchers are often interested in treatment effects on outcomes that are only defined conditional on posttreatment events. For example, in a study of the effect of different cancer treatments on quality of life at end of follow-up, the quality of life of individuals who die during the study is undefined. In these settings, naive contrasts of outcomes conditional on posttreatment events are not average causal effects, even in randomized experiments. Therefore, the effect in…

AI 解读阅读原文 ↗BibTeX ↓

Rank-Based Greedy Model Averaging for High-Dimensional Survival Data

高维生存数据的秩驱动贪心模型平均

Model averaging is an effective way to enhance prediction accuracy. However, most previous works focus on low-dimensional settings with completely observed responses. To attain an accurate prediction for the risk effect of survival data with high-dimensional predictors, we propose a novel method: rank-based greedy (RG) model averaging. Specifically, adopting the transformation model with splitting predictors as working models, we doubly use the smooth concordance index…

AI 解读阅读原文 ↗BibTeX ↓

Approximate Selective Inference via Maximum Likelihood

基于最大似然的近似选择后推断

Several strategies have been developed recently to ensure valid inference after model selection; some of these are easy to compute, while others fare better in terms of inferential power. In this article, we consider a selective inference framework for Gaussian data. We propose a new method for inference through approximate maximum likelihood estimation. Our goal is to: (a) achieve better inferential power with the aid of randomization, (b) bypass expensive MCMC sampling…

AI 解读阅读原文 ↗BibTeX ↓

Improved Small Domain Estimation via Compromise Regression Weights

通过折中回归权重改进小域估计

Shrinkage estimates of small domain parameters typically use a combination of a noisy “direct” estimate that only uses data from a specific small domain and a more stable regression estimate. When the regression model is misspecified, estimation performance for the noisier domains can suffer due to substantial shrinkage toward a poorly estimated regression surface. In this article, we introduce a new class of robust, empirically-driven regression weights that target…

AI 解读阅读原文 ↗BibTeX ↓

Spatio-Temporal Cross-Covariance Functions under the Lagrangian Framework with Multiple Advections

多重平流拉格朗日框架下的时空交叉协方差函数

When analyzing the spatio-temporal dependence in most environmental and earth sciences variables such as pollutant concentrations at different levels of the atmosphere, a special property is observed: the covariances and cross-covariances are stronger in certain directions. This property is attributed to the presence of natural forces, such as wind, which cause the transport and dispersion of these variables. This spatio-temporal dynamics prompted the use of the Lagrangian…

AI 解读阅读原文 ↗BibTeX ↓

Transformation-Invariant Learning of Optimal Individualized Decision Rules with Time-to-Event Outcomes

事件时间结局下最优个体化决策规则的变换不变学习

In many important applications of precision medicine, the outcome of interest is time to an event (e.g., death, relapse of disease) and the primary goal is to identify the optimal individualized decision rule (IDR) to prolong survival time. Existing work in this area have been mostly focused on estimating the optimal IDR to maximize the restricted mean survival time in the population. We propose a new robust framework for estimating an optimal static or dynamic IDR with…

AI 解读阅读原文 ↗BibTeX ↓

Efficient Estimation for Censored Quantile Regression

删失分位数回归的高效估计

Censored quantile regression (CQR) has received growing attention in survival analysis because of its flexibility in modeling heterogeneous effect of covariates. Advances have been made in developing various inferential procedures under different assumptions and settings. Under the conditional independence assumption, many existing CQR methods can be characterized either by stochastic integral-based estimating equations (see, e.g., Peng and Huang) or by locally weighted…

AI 解读阅读原文 ↗BibTeX ↓

Transfer Learning Under High-Dimensional Generalized Linear Models

高维广义线性模型下的迁移学习

In this work, we study the transfer learning problem under high-dimensional generalized linear models (GLMs), which aim to improve the fit on target data by borrowing information from useful source data. Given which sources to transfer, we propose a transfer learning algorithm on GLM, and derive its l1/l2-estimation error bounds as well as a bound for a prediction error measure. The theoretical analysis shows that when the target and sources are sufficiently close to each…

AI 解读阅读原文 ↗BibTeX ↓

Inference for Local Parameters in Convexity Constrained Models

凸性约束模型中局部参数的统计推断

In this article, we develop automated inference methods for “local” parameters in a collection of convexity constrained models based on the natural constrained tuning-free estimators. A canonical example is given by the univariate convex regression model, in which automated inference is drawn for the function value, the function derivative at a fixed interior point, and the anti-mode of the convex regression function, based on the widely used tuning-free, piecewise linear…

AI 解读阅读原文 ↗BibTeX ↓

A Bayesian Approach to Multiple-Output Quantile Regression

多输出分位数回归的贝叶斯方法

This paper presents a Bayesian approach to multiple-output quantile regression. The unconditional model is proven to be consistent and asymptotically correct frequentist confidence intervals can be obtained. The prior for the unconditional model can be elicited as the ex-ante knowledge of the distance of the tau-Tukey depth contour to the Tukey median, the first prior of its kind. A proposal for conditional regression is also presented. The model is applied to the Tennessee…

AI 解读阅读原文 ↗BibTeX ↓

The Maximum of the Periodogram of a Sequence of Functional Data

函数型数据序列周期图的最大值

We study the periodogram operator of a sequence of functional data. Using recent advances in Gaussian approximation theory, we derive the asymptotic distribution of the maximum norm over all fundamental frequencies. We consider the case where the noise variables are independent and then generalize our results to functional linear processes. Our theory can be used for detecting periodic signals in functional time series when the length of the period is unknown. We demonstrate…

AI 解读阅读原文 ↗BibTeX ↓

Sharp Sensitivity Analysis for Inverse Propensity Weighting via Quantile Balancing

通过分位数平衡开展逆倾向加权的锐敏感性分析

Inverse propensity weighting (IPW) is a popular method for estimating treatment effects from observational data. However, its correctness relies on the untestable (and frequently implausible) assumption that all confounders have been measured. This paper introduces a robust sensitivity analysis for IPW that estimates the range of treatment effects compatible with a given amount of unobserved confounding. The estimated range converges to the narrowest possible interval (under…

AI 解读阅读原文 ↗BibTeX ↓

Divide-and-Conquer: A Distributed Hierarchical Factor Approach to Modeling Large-Scale Time Series Data

分而治之:大规模时间序列的分布式层级因子建模

This paper proposes a hierarchical approximate-factor approach to analyzing high-dimensional, large-scale heterogeneous time series data using distributed computing. The new method employs a multiple-fold dimension reduction procedure using Principal Component Analysis (PCA) and shows great promises for modeling large-scale data that cannot be stored nor analyzed by a single machine. Each computer at the basic level performs a PCA to extract common factors among the time…

AI 解读阅读原文 ↗BibTeX ↓

Covariance Estimation for Matrix-valued Data

矩阵值数据的协方差估计

Covariance estimation for matrix-valued data has received an increasing interest in applications. Unlike previous works that rely heavily on matrix normal distribution assumption and the requirement of fixed matrix size, we propose a class of distribution-free regularized covariance estimation methods for high-dimensional matrix data under a separability condition and a bandable covariance structure. Under these conditions, the original covariance matrix is decomposed into a…

AI 解读阅读原文 ↗BibTeX ↓

False Discovery Rate Control via Data Splitting

通过数据拆分控制错误发现率

Selecting relevant features associated with a given response variable is an important problem in many scientific fields. Quantifying quality and uncertainty of a selection result via false discovery rate (FDR) control has been of recent interest. This article introduces a data-splitting method (referred to as “DS”) to asymptotically control the FDR while maintaining a high power. For each feature, DS constructs a test statistic by estimating two independent regression…

AI 解读阅读原文 ↗BibTeX ↓

Covariate-Assisted Sparse Tensor Completion

协变量辅助的稀疏张量补全

We aim to provably complete a sparse and highly missing tensor in the presence of covariate information along tensor modes. Our motivation comes from online advertising where users’ click-through-rates (CTR) on ads over various devices form a CTR tensor that has about 96% missing entries and has many zeros on nonmissing entries, which makes the standalone tensor completion method unsatisfactory. Beside the CTR tensor, additional ad features or user characteristics are often…

AI 解读阅读原文 ↗BibTeX ↓

Self-supervised Metric Learning in Multi-View Data: A Downstream Task Perspective

多视图数据中的自监督度量学习:下游任务视角

Self-supervised metric learning has been a successful approach for learning a distance from an unlabeled dataset. The resulting distance is broadly useful for improving various distance-based downstream tasks, even when no information from downstream tasks is used in the metric learning stage. To gain insights into this approach, we develop a statistical framework to theoretically study how self-supervised metric learning can benefit downstream tasks in the context of…

AI 解读阅读原文 ↗BibTeX ↓