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

日期精度:到日 27 篇 · 到月 13 篇 · 到年 2 篇

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

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 ↓

A Scale-Free Approach for False Discovery Rate Control in Generalized Linear Models

广义线性模型中控制错误发现率的无尺度方法

The Generalized Linear Model (GLM) has been widely used in practice to model counts or other types of non-Gaussian data. This article introduces a framework for feature selection in the GLM that can achieve robust False Discovery Rate (FDR) control. The main idea is to construct a mirror statistic based on data perturbation to measure the importance of each feature. FDR control is achieved by taking advantage of the mirror statistic’s property that its sampling distribution…

AI 解读阅读原文 ↗BibTeX ↓

Kernel-Based Partial Permutation Test for Detecting Heterogeneous Functional Relationship

检测组间函数关系异质性的核部分置换检验

We propose a kernel-based partial permutation test for checking the equality of functional relationship between response and covariates among different groups. The main idea, which is intuitive and easy to implement, is to keep the projections of the response vector Y on leading principle components of a kernel matrix fixed and permute Y’s projections on the remaining principle components. The proposed test allows for different choices of kernels, corresponding to different…

AI 解读阅读原文 ↗BibTeX ↓

Partition–Mallows Model and Its Inference for Rank Aggregation

用于排序聚合的分组–Mallows 模型及其推断

Learning how to aggregate ranking lists has been an active research area for many years and its advances have played a vital role in many applications ranging from bioinformatics to internet commerce. The problem of discerning reliability of rankers based only on the rank data is of great interest to many practitioners, but has received less attention from researchers. By dividing the ranked entities into two disjoint groups, that is, relevant and irrelevant/background ones,…

AI 解读阅读原文 ↗BibTeX ↓

Controlling False Discovery Rate Using Gaussian Mirrors

利用高斯镜像控制错误发现率

Simultaneously, finding multiple influential variables and controlling the false discovery rate (FDR) for linear regression models is a fundamental problem. We here propose the Gaussian Mirror (GM) method, which creates for each predictor variable a pair of mirror variables by adding and subtracting a randomly generated Gaussian perturbation, and proceeds with a certain regression method, such as the ordinary least-square or the Lasso (the mirror variables can also be…

AI 解读阅读原文 ↗BibTeX ↓

Neuronized Priors for Bayesian Sparse Linear Regression

贝叶斯稀疏线性回归的神经元化先验

Although Bayesian variable selection methods have been intensively studied, their routine use in practice has not caught up with their non-Bayesian counterparts such as Lasso, likely due to difficulties in both computations and flexibilities of prior choices. To ease these challenges, we propose the neuronized priors to unify and extend some popular shrinkage priors, such as Laplace, Cauchy, horseshoe, and spike-and-slab priors. A neuronized prior can be written as the…

AI 解读阅读原文 ↗BibTeX ↓

Monte Carlo Approximation of Bayes Factors via Mixing With Surrogate Distributions

通过与替代分布混合进行贝叶斯因子的蒙特卡洛近似

By mixing the target posterior distribution with a surrogate distribution, of which the normalizing constant is tractable, we propose a method for estimating the marginal likelihood using the Wang–Landau algorithm. We show that a faster convergence of the proposed method can be achieved via the momentum acceleration. Two implementation strategies are detailed: (i) facilitating global jumps between the posterior and surrogate distributions via the multiple-try Metropolis…

AI 解读阅读原文 ↗BibTeX ↓

On the optimality of sliced inverse regression in high dimensions

The central subspace of a pair of random variables $(y,\boldsymbol{x})\in \mathbb{R}^{p+1}$ is the minimal subspace $\mathcal{S}$ such that $y\perp\!\!\!\!\!\perp \boldsymbol{x}|P_{\mathcal{S}}\boldsymbol{x}$. In this paper, we consider the minimax rate of estimating the central space under the multiple index model $y=f(\boldsymbol{\beta }_{1}^{\tau }\boldsymbol{x},\boldsymbol{\beta }_{2}^{\tau }\boldsymbol{x},\ldots,\boldsymbol{\beta }_{d}^{\tau }\boldsymbol{x},\epsilon )$ w…

阅读原文 ↗BibTeX ↓

Randomization Inference for Peer Effects

同伴效应的随机化推断

Xinran Lia, Peng Dingb*, Qian Linc, Dawei Yangd & Jun S. Liuaa Department of Statistics, Harvard University, Cambridge, MA; b Department of Statistics, University of California, Berkeley, CA; c Center for Statistical Science, Department of Industrial Engineering, Tsinghua University, Beijing, P. R. China; d Bureau of Personnel of Chinese Academy of Sciences & School of Education of Peking University, Beijing, P. R. ChinaSupplementary materials for this article are available…

AI 解读阅读原文 ↗BibTeX ↓

Sparse Sliced Inverse Regression via Lasso

基于 Lasso 的稀疏切片逆回归

For multiple index models, it has recently been shown that the sliced inverse regression (SIR) is consistent for estimating the sufficient dimension reduction (SDR) space if and only if $ρ = \mathrm{lim} \frac{p}{n} = 0$, where p is the dimension and n is the sample size. Thus, when p is of the same or a higher order of n, additional assumptions such as sparsity must be imposed in order to ensure consistency for SIR. By constructing artificial response variables made up from…

AI 解读阅读原文 ↗BibTeX ↓

Robust Variable and Interaction Selection for Logistic Regression and General Index Models

逻辑回归与一般指数模型的稳健变量及交互项选择

Under the logistic regression framework, we propose a forward-backward method, SODA, for variable selection with both main and quadratic interaction terms. In the forward stage, SODA adds in predictors that have significant overall effects, whereas in the backward stage SODA removes unimportant terms to optimize the extended Bayesian Information Criterion (EBIC). Compared with existing methods for variable selection in quadratic discriminant analysis, SODA can deal with…

AI 解读阅读原文 ↗BibTeX ↓

Bayesian Inference for Assessing Effects of Email Marketing Campaigns

评估电子邮件营销活动效果的贝叶斯推断

Email marketing has been an increasingly important tool for today’s businesses. In this article, we propose a counting-process-based Bayesian method for quantifying the effectiveness of email marketing campaigns in conjunction with customer characteristics. Our model explicitly addresses the seasonality of data, accounts for the impact of customer characteristics on their purchasing behavior, and evaluates effects of email offers as well as their interactions with customer…

AI 解读阅读原文 ↗BibTeX ↓

On consistency and sparsity for sliced inverse regression in high dimensions

高维切片逆回归的一致性与稀疏性

We provide here a framework to analyze the phase transition phenomenon of slice inverse regression (SIR), a supervised dimension reduction technique introduced by Li [J. Amer. Statist. Assoc. 86 (1991) 316–342]. Under mild conditions, the asymptotic ratio $\rho=\lim p/n$ is the phase transition parameter and the SIR estimator is consistent if and only if $\rho=0$. When dimension $p$ is greater than $n$, we propose a diagonal thresholding screening SIR (DT-SIR) algorithm.…

AI 解读阅读原文 ↗BibTeX ↓

An Adaptive Exchange Algorithm for Sampling From Distributions With Intractable Normalizing Constants

对归一化常数难以计算的分布进行抽样的自适应交换算法

Sampling from the posterior distribution for a model whose normalizing constant is intractable is a long-standing problem in statistical research. We propose a new algorithm, adaptive auxiliary variable exchange algorithm, or, in short, adaptive exchange (AEX) algorithm, to tackle this problem. The new algorithm can be viewed as a MCMC extension of the exchange algorithm, which generates auxiliary variables via an importance sampling procedure from a Markov chain running in…

AI 解读阅读原文 ↗BibTeX ↓

Bayesian Partition Models for Identifying Expression Quantitative Trait Loci

识别表达数量性状位点的贝叶斯划分模型

Expression quantitative trait loci (eQTLs) are genomic locations associated with changes of expression levels of certain genes. By assaying gene expressions and genetic variations simultaneously on a genome-wide scale, scientists wish to discover genomic loci responsible for expression variations of a set of genes. The task can be viewed as a multivariate regression problem with variable selection on both responses (gene expression) and covariates (genetic variations),…

AI 解读阅读原文 ↗BibTeX ↓

Nonparametric K -Sample Tests via Dynamic Slicing

基于动态切片的非参数多样本检验

K-sample testing problems arise in many scientific applications and have attracted statisticians’ attention for many years. We propose an omnibus nonparametric method based on an optimal discretization (aka “slicing”) of continuous random variables in the test. The novelty of our approach lies in the inclusion of a term penalizing the number of slices (i.e., the resolution of the discretization) so as to regularize the corresponding likelihood-ratio test statistic. An…

AI 解读阅读原文 ↗BibTeX ↓

Risk Classification With an Adaptive Naive Bayes Kernel Machine Model

基于自适应朴素贝叶斯核机器模型的疾病风险分类

Genetic studies of complex traits have uncovered only a small number of risk markers explaining a small fraction of heritability and adding little improvement to disease risk prediction. Standard single marker methods may lack power in selecting informative markers or estimating effects. Most existing methods also typically do not account for non-linearity. Identifying markers with weak signals and estimating their joint effects among many non-informative markers remains…

AI 解读阅读原文 ↗BibTeX ↓

Variable selection for general index models via sliced inverse regression

通过切片逆回归进行一般指标模型的变量选择

Variable selection, also known as feature selection in machine learning, plays an important role in modeling high dimensional data and is key to data-driven scientific discoveries. We consider here the problem of detecting influential variables under the general index model, in which the response is dependent of predictors through an unknown function of one or more linear combinations of them. Instead of building a predictive model of the response given combinations of…

AI 解读阅读原文 ↗BibTeX ↓

Bayesian Aggregation of Order-Based Rank Data

基于排序数据的贝叶斯聚合

Rank aggregation, that is, combining several ranking functions (called base rankers) to get aggregated, usually stronger rankings of a given set of items, is encountered in many disciplines. Most methods in the literature assume that base rankers of interest are equally reliable. It is very common in practice, however, that some rankers are more informative and reliable than others. It is desirable to distinguish high quality base rankers from low quality ones and treat them…

AI 解读阅读原文 ↗BibTeX ↓

Association Pattern Discovery Via Theme Dictionary Models

通过主题字典模型发现关联模式

Summary Discovering patterns from a set of text or, more generally, categorical data is an important problem in many disciplines such as biomedical research, linguistics, artificial intelligence and sociology. We consider here the well-known ‘market basket’ problem that is often discussed in the data mining community, and is also quite ubiquitous in biomedical research. The data under consideration are a set of ‘baskets’, where each basket contains a list of ‘items’. Our…

AI 解读阅读原文 ↗BibTeX ↓

Model Selection Principles in Misspecified Models

Summary Model selection is of fundamental importance to high dimensional modelling featured in many contemporary applications. Classical principles of model selection include the Bayesian principle and the Kullback–Leibler divergence principle, which lead to the Bayesian information criterion and Akaike information criterion respectively, when models are correctly specified. Yet model misspecification is unavoidable in practice. We derive novel asymptotic expansions of the…

阅读原文 ↗BibTeX ↓

A Multiresolution Method for Parameter Estimation of Diffusion Processes

扩散过程参数估计的多分辨率方法

Diffusion process models are widely used in science, engineering and finance. Most diffusion processes are described by stochastic differential equations in continuous time. In practice, however, data is typically only observed at discrete time points. Except for a few very special cases, no analytic form exists for the likelihood of such discretely observed data. For this reason, parametric inference is often achieved by using discrete-time approximations, with accuracy…

AI 解读阅读原文 ↗BibTeX ↓

Correlation Pursuit: Forward Stepwise Variable Selection for Index Models

相关追踪:指数模型的前向逐步变量选择

Summary A stepwise procedure, correlation pursuit (COP), is developed for variable selection under the sufficient dimension reduction framework, in which the response variable Y is influenced by the predictors X1,X2,…,Xp through an unknown function of a few linear combinations of them. Unlike linear stepwise regression, COP does not impose a special form of relationship (such as linear) between the response variable and the predictor variables. The COP procedure selects…

AI 解读阅读原文 ↗BibTeX ↓

Stopping-Time Resampling for Sequential Monte Carlo Methods

序贯蒙特卡洛方法的停时重采样

Summary Motivated by the statistical inference problem in population genetics, we present a new sequential importance sampling with resampling strategy. The idea of resampling is key to the recent surge of popularity of sequential Monte Carlo methods in the statistics and engin-eering communities, but existing resampling techniques do not work well for coalescent-based inference problems in population genetics. We develop a new method called ‘stopping-time resampling’, which…

AI 解读阅读原文 ↗BibTeX ↓