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

日期精度:到日 8720 篇 · 到月 10898 篇 · 到年 1550 篇 · 未提供 13 篇

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

Inference on the average treatment effect under minimization and other covariate-adaptive randomization methods

最小化及其他协变量自适应随机化下的平均处理效应推断

Summary Covariate-adaptive randomization schemes such as minimization and stratified permuted blocks are often applied in clinical trials to balance treatment assignments across prognostic factors. The existing theory for inference after covariate-adaptive randomization is mostly limited to situations where a correct model between the response and covariates can be specified or the randomization method has well-understood properties. Based on stratification with covariate…

AI 解读阅读原文 ↗BibTeX ↓

Optimal post-selection inference for sparse signals: a nonparametric empirical Bayes approach

稀疏信号的最优选择后推断:非参数经验贝叶斯方法

Summary Many recently developed Bayesian methods focus on sparse signal detection. However, much less work has been done on the natural follow-up question: how does one make valid inferences for the magnitude of those signals after selection? Ordinary Bayesian credible intervals suffer from selection bias, as do ordinary frequentist confidence intervals. Existing Bayesian methods for correcting this bias produce credible intervals with poor frequentist properties. Further,…

AI 解读阅读原文 ↗BibTeX ↓

Heterogeneity-aware and communication-efficient distributed statistical inference

考虑异质性且通信高效的分布式统计推断

Summary In multicentre research, individual-level data are often protected against sharing across sites. To overcome the barrier of data sharing, many distributed algorithms, which only require sharing aggregated information, have been developed. The existing distributed algorithms usually assume the data are homogeneously distributed across sites. This assumption ignores the important fact that the data collected at different sites may come from various subpopulations and…

AI 解读阅读原文 ↗BibTeX ↓

Interpoint-ranking sign covariance for the test of independence

用于独立性检验的点间排序符号协方差

Summary We generalize the sign covariance introduced by Bergsma & Dassios (2014) to multivariate random variables and beyond. The new interpoint-ranking sign covariance is applicable to general types of random objects as long as a meaningful similarity measure can be defined, and it is shown to be zero if and only if the two random variables are independent. The test statistic is a $U$-statistic, whose large-sample behaviour guarantees that the proposed test is consistent…

AI 解读阅读原文 ↗BibTeX ↓

General ways to improve false coverage rate-adjusted selective confidence intervals

改进错误覆盖率调整的选择性置信区间的一般方法

Summary Post-selection inference on thousands of parameters has attracted considerable research interest in recent years. Specifically, Benjamini & Yekutieli (2005) considered constructing confidence intervals after selection. They proposed adjusting the confidence levels of marginal confidence intervals for the selected parameters to ensure control of the false coverage-statement rate. However, although Benjamini–Yekutieli confidence intervals are widely used, they are…

AI 解读阅读原文 ↗BibTeX ↓

Integrated conditional moment test and beyond: when the number of covariates is divergent

协变量维数发散时的积分条件矩检验及其扩展

Summary The classical integrated conditional moment test is a promising method for model checking and its basic idea has been applied to develop several variants. However, in diverging-dimension scenarios, the integrated conditional moment test may break down and has completely different limiting properties from the fixed-dimension case. Furthermore, the related wild bootstrap approximation can also be invalid. To extend this classical test to diverging dimension settings,…

AI 解读阅读原文 ↗BibTeX ↓

Statistical inference on shape and size indexes for counting processes

计数过程形状与规模指标的统计推断

Summary Single-index models have gained increased popularity in time-to-event analysis owing to their model flexibility and advantage in dimension reduction. We propose a semiparametric framework for the rate function of a recurrent event counting process by modelling its size and shape components with single-index models. With additional monotone constraints on the two link functions for the size and shape components, the proposed model possesses the desired directional…

AI 解读阅读原文 ↗BibTeX ↓

Stratification and optimal resampling for sequential Monte Carlo

序贯蒙特卡洛的分层与最优重采样

Summary Sequential Monte Carlo algorithms are widely accepted as powerful computational tools for making inference with dynamical systems. A key step in sequential Monte Carlo is resampling, which plays the role of steering the algorithm towards the future dynamics. Several strategies have been used in practice, including multinomial resampling, residual resampling, optimal resampling, stratified resampling and optimal transport resampling. In one-dimensional cases, we show…

AI 解读阅读原文 ↗BibTeX ↓

Large-scale model selection in misspecified generalized linear models

误设广义线性模型中的大规模模型选择

Summary Model selection is crucial both to high-dimensional learning and to inference for contemporary big data applications in pinpointing the best set of covariates among a sequence of candidate interpretable models. Most existing work implicitly assumes that the models are correctly specified or have fixed dimensionality, yet both model misspecification and high dimensionality are prevalent in practice. In this paper, we exploit the framework of model selection principles…

AI 解读阅读原文 ↗BibTeX ↓

Distributed inference for the extreme value index

极值指数的分布式推断

Summary In this paper we investigate a divide-and-conquer algorithm for estimating the extreme value index when data are stored in multiple machines. The oracle property of such an algorithm based on extreme value methods is not guaranteed by the general theory of distributed inference. We propose a distributed Hill estimator and establish its asymptotic theories. We consider various cases where the number of observations involved in each machine can be either homogeneous or…

AI 解读阅读原文 ↗BibTeX ↓

Backfitting tests in generalized structured models

广义结构模型中的回代检验

Summary We introduce bootstrap tests for semiparametric generalized structured models. These can be used for testing different kinds of model specifications like separability, functional forms and homogeneity of effects, or for performing variable selection in a large class of semiparametric models. The test statistics are based on the comparison of non- and semiparametric alternatives in which both the null hypothesis and the alternative are non- or semiparametric. All…

AI 解读阅读原文 ↗BibTeX ↓

Gaussian Differential Privacy

高斯差分隐私

Abstract In the past decade, differential privacy has seen remarkable success as a rigorous and practical formalization of data privacy. This privacy definition and its divergence based relaxations, however, have several acknowledged weaknesses, either in handling composition of private algorithms or in analysing important primitives like privacy amplification by subsampling. Inspired by the hypothesis testing formulation of privacy, this paper proposes a new relaxation of…

AI 解读阅读原文 ↗BibTeX ↓

High-Dimensional, Multiscale Online Changepoint Detection

高维多尺度在线变点检测

Abstract We introduce a new method for high-dimensional, online changepoint detection in settings where a p-variate Gaussian data stream may undergo a change in mean. The procedure works by performing likelihood ratio tests against simple alternatives of different scales in each coordinate, and then aggregating test statistics across scales and coordinates. The algorithm is online in the sense that both its storage requirements and worst-case computational complexity per new…

AI 解读阅读原文 ↗BibTeX ↓

A Graph-Theoretic Approach to Randomization Tests of Causal Effects under General Interference

一般干扰下因果效应随机化检验的图论方法

Abstract Interference exists when a unit's outcome depends on another unit's treatment assignment. For example, intensive policing on one street could have a spillover effect on neighbouring streets. Classical randomization tests typically break down in this setting because many null hypotheses of interest are no longer sharp under interference. A promising alternative is to instead construct a conditional randomization test on a subset of units and assignments for which a…

AI 解读阅读原文 ↗BibTeX ↓

Transfer Learning for High-Dimensional Linear Regression: Prediction, Estimation and Minimax Optimality

高维线性回归的迁移学习:预测、估计与极小极大最优性

Abstract This paper considers estimation and prediction of a high-dimensional linear regression in the setting of transfer learning where, in addition to observations from the target model, auxiliary samples from different but possibly related regression models are available. When the set of informative auxiliary studies is known, an estimator and a predictor are proposed and their optimality is established. The optimal rates of convergence for prediction and estimation are…

AI 解读阅读原文 ↗BibTeX ↓

Waste-Free Sequential Monte Carlo

无浪费序贯蒙特卡洛

Abstract A standard way to move particles in a sequential Monte Carlo (SMC) sampler is to apply several steps of a Markov chain Monte Carlo (MCMC) kernel. Unfortunately, it is not clear how many steps need to be performed for optimal performance. In addition, the output of the intermediate steps are discarded and thus wasted somehow. We propose a new, waste-free SMC algorithm which uses the outputs of all these intermediate MCMC steps as particles. We establish that its…

AI 解读阅读原文 ↗BibTeX ↓

Inferential Wasserstein Generative Adversarial Networks

推断型 Wasserstein 生成对抗网络

Abstract Generative adversarial networks (GANs) have been impactful on many problems and applications but suffer from unstable training. The Wasserstein GAN (WGAN) leverages the Wasserstein distance to avoid the caveats in the minmax two-player training of GANs but has other defects such as mode collapse and lack of metric to detect the convergence. We introduce a novel inferential Wasserstein GAN (iWGAN) model, which is a principled framework to fuse autoencoders and WGANs.…

AI 解读阅读原文 ↗BibTeX ↓

Usable and Precise Asymptotics for Generalized Linear Mixed Model Analysis and Design

广义线性混合模型分析与设计的可用精确渐近结果

Abstract We derive precise asymptotic results that are directly usable for confidence intervals and Wald hypothesis tests for likelihood-based generalized linear mixed model analysis. The essence of our approach is to derive the exact leading term behaviour of the Fisher information matrix when both the number of groups and number of observations within each group diverge. This leads to asymptotic normality results with simple studentizable forms. Similar analyses result in…

AI 解读阅读原文 ↗BibTeX ↓

On an extension of the promotion time cure model

促进时间治愈模型的一种扩展

We consider the problem of estimating the distribution of time-to-event data that is subject to censoring and for which the event of interest might never occur, that is, some subjects are cured. To model this kind of data in the presence of covariates, one of the leading semiparametric models is the promotion time cure model (Stochastic Models of Tumor Latency and Their Biostatistical Applications (1996) World Scientific), which adapts the Cox model to the presence of cured…

AI 解读阅读原文 ↗BibTeX ↓

Semiparametric latent-class models for multivariate longitudinal and survival data

多变量纵向与生存数据的半参数潜在类别模型

In long-term follow-up studies, data are often collected on repeated measures of multivariate response variables as well as on time to the occurrence of a certain event. To jointly analyze such longitudinal data and survival time, we propose a general class of semiparametric latent-class models that accommodates a heterogeneous study population with flexible dependence structures between the longitudinal and survival outcomes. We combine nonparametric maximum likelihood…

AI 解读阅读原文 ↗BibTeX ↓

Minimax nonparametric estimation of pure quantum states

纯量子态的极小极大非参数估计

In classical statistics, Pinsker’s theorem provides an exact asymptotic minimax bound in nonparametric estimation, improving upon optimal rates of convergence results. We obtain a quantum version of the theorem by establishing asymptotic minimax results for estimation of the displacement vector in a quantum Gaussian white noise model, given by a sequence of shifted vacuum states. Analogous results are then obtained for estimation of a general pure state from an ensemble of…

AI 解读阅读原文 ↗BibTeX ↓

High-dimensional asymptotics of likelihood ratio tests in the Gaussian sequence model under convex constraints

凸约束高斯序列模型中似然比检验的高维渐近理论

In the Gaussian sequence model Y=μ+ξ, we study the likelihood ratio test (LRT) for testing H0:μ=μ0 versus H1:μ∈K, where μ0∈K, and K is a closed convex set in Rn. In particular, we show that under the null hypothesis, normal approximation holds for the log-likelihood ratio statistic for a general pair (μ0,K), in the high-dimensional regime where the estimation error of the associated least squares estimator diverges in an appropriate sense. The normal approximation further…

AI 解读阅读原文 ↗BibTeX ↓

Admissible ways of merging p-values under arbitrary dependence

任意依赖下合并p值的可容许方法

Methods of merging several p-values into a single p-value are important in their own right and widely used in multiple hypothesis testing. This paper is the first to systematically study the admissibility (in Wald’s sense) of p-merging functions and their domination structure, without any information on the dependence structure of the input p-values. As a technical tool, we use the notion of e-values, which are alternatives to p-values recently promoted by several authors.…

AI 解读阅读原文 ↗BibTeX ↓

Minimax optimality of permutation tests

置换检验的极小极大最优性

Permutation tests are widely used in statistics, providing a finite-sample guarantee on the type I error rate whenever the distribution of the samples under the null hypothesis is invariant to some rearrangement. Despite its increasing popularity and empirical success, theoretical properties of the permutation test, especially its power, have not been fully explored beyond simple cases. In this paper, we attempt to partly fill this gap by presenting a general nonasymptotic…

AI 解读阅读原文 ↗BibTeX ↓