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

日期精度:到日 1254 篇 · 到月 521 篇 · 到年 24 篇 · 未提供 2 篇

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

Identifying Risk Factors for Severe Childhood Malnutrition by Boosting Additive Quantile Regression

用提升法加性分位数回归识别儿童严重营养不良风险因素

We investigated the risk factors for childhood malnutrition in India based on the 2005/2006 Demographic and Health Survey by applying a novel estimation technique for additive quantile regression. Ordinary linear and generalized linear regression models relate the mean of a response variable to a linear combination of covariate effects, and, as a consequence, focus on average properties of the response. The use of such a regression model for analyzing childhood malnutrition…

AI 解读阅读原文 ↗BibTeX ↓

Outlier Detection Using Nonconvex Penalized Regression

用非凸惩罚回归检测异常值

This article studies the outlier detection problem from the standpoint of penalized regression. In the regression model, we add one mean shift parameter for each of the n data points. We then apply a regularization favoring a sparse vector of mean shift parameters. The usual L1 penalty yields a convex criterion, but fails to deliver a robust estimator. The L1 penalty corresponds to soft thresholding. We introduce a thresholding (denoted by Θ) based iterative procedure for…

AI 解读阅读原文 ↗BibTeX ↓

Bootstrapping Lasso Estimators

Lasso估计量的Bootstrap方法

In this article, we consider bootstrapping the Lasso estimator of the regression parameter in a multiple linear regression model. It is known that the standard bootstrap method fails to be consistent. Here, we propose a modified bootstrap method, and show that it provides valid approximation to the distribution of the Lasso estimator, for all possible values of the unknown regression parameter vector, including the case where some of the components are zero. Further, we…

AI 解读阅读原文 ↗BibTeX ↓

IDENTIFICATION AND ESTIMATION BY PENALIZATION IN NONPARAMETRIC INSTRUMENTAL REGRESSION

非参数工具变量回归中的惩罚识别与估计

The nonparametric estimation of a regression function from conditional moment restrictions involving instrumental variables is considered. The rate of convergence of penalized estimators is studied in the case where the regression function is not identified from the conditional moment restriction. We also study the gain of modifying the penalty in the estimation, considering derivatives in the penalty. We analyze the effect of this modification on the identification of the…

AI 解读阅读原文 ↗BibTeX ↓

CONVERGENCE RATES FOR ILL-POSED INVERSE PROBLEMS WITH AN UNKNOWN OPERATOR

未知算子的病态逆问题收敛率

This paper studies the estimation of a nonparametric function ϕ from the inverse problem r = Tϕ given estimates of the function r and of the linear transform T . We show that rates of convergence of the estimator are driven by two types of assumptions expressed in a single Hilbert scale. The two assumptions quantify the prior regularity of ϕ and the prior link existing between T and the Hilbert scale. The approach provides a unified framework that allows us to compare…

AI 解读阅读原文 ↗BibTeX ↓

Optimal selection of reduced rank estimators of high-dimensional matrices

高维矩阵降秩估计量的最优选择

We introduce a new criterion, the Rank Selection Criterion (RSC), for selecting the optimal reduced rank estimator of the coefficient matrix in multivariate response regression models. The corresponding RSC estimator minimizes the Frobenius norm of the fit plus a regularization term proportional to the number of parameters in the reduced rank model. The rank of the RSC estimator provides a consistent estimator of the rank of the coefficient matrix; in general, the rank of…

AI 解读阅读原文 ↗BibTeX ↓

Performance guarantees for individualized treatment rules

个体化治疗规则的性能保证

Because many illnesses show heterogeneous response to treatment, there is increasing interest in individualizing treatment to patients [11]. An individualized treatment rule is a decision rule that recommends treatment according to patient characteristics. We consider the use of clinical trial data in the construction of an individualized treatment rule leading to highest mean response. This is a difficult computational problem because the objective function is the…

AI 解读阅读原文 ↗BibTeX ↓

Estimation of (near) low-rank matrices with noise and high-dimensional scaling

含噪声与高维尺度下的低秩及近低秩矩阵估计

We study an instance of high-dimensional inference in which the goal is to estimate a matrix Θ∗∈ℝm1×m2 on the basis of N noisy observations. The unknown matrix Θ∗ is assumed to be either exactly low rank, or “near” low-rank, meaning that it can be well-approximated by a matrix with low rank. We consider a standard M-estimator based on regularization by the nuclear or trace norm over matrices, and analyze its performance under high-dimensional scaling. We define the notion of…

AI 解读阅读原文 ↗BibTeX ↓

Estimation of high-dimensional low-rank matrices

高维低秩矩阵的估计

Suppose that we observe entries or, more generally, linear combinations of entries of an unknown m×T-matrix A corrupted by noise. We are particularly interested in the high-dimensional setting where the number mT of unknown entries can be much larger than the sample size N. Motivated by several applications, we consider estimation of matrix A under the assumption that it has small rank. This can be viewed as dimension reduction or sparsity assumption. In order to shrink…

AI 解读阅读原文 ↗BibTeX ↓

Exponential Screening and optimal rates of sparse estimation

指数筛选与稀疏估计的最优速率

In high-dimensional linear regression, the goal pursued here is to estimate an unknown regression function using linear combinations of a suitable set of covariates. One of the key assumptions for the success of any statistical procedure in this setup is to assume that the linear combination is sparse in some sense, for example, that it involves only few covariates. We consider a general, nonnecessarily linear, regression with Gaussian noise and study a related question,…

AI 解读阅读原文 ↗BibTeX ↓

Matching and semi-parametric IV estimation, a distance-based measure of migration, and the wages of young men

匹配与半参数工具变量估计:距离型迁移指标及青年男性工资

Our paper estimates the effect of US internal migration on wage growth for young men between their first and second job. Our analysis of migration extends previous research by: (i) exploiting the distance-based measures of migration in the National Longitudinal Surveys of Youth 1979 (NLSY79); (ii) allowing the effect of migration to differ by schooling level and (iii) using propensity score matching to estimate the average treatment effect on the treated (ATET) for movers…

AI 解读阅读原文 ↗BibTeX ↓

Data-driven selection of the spline dimension in penalized spline regression

惩罚样条回归中样条维度的数据驱动选择

A number of criteria exist to select the penalty in penalized spline regression, but the selection of the number of spline basis functions has received much less attention in the literature. We propose a likelihood-based criterion to select the number of basis functions in penalized spline regression. The criterion is easy to apply and we describe its theoretical and practical properties.

AI 解读阅读原文 ↗BibTeX ↓

Bootstrap inference for mean reflection shape and size-and-shape with three-dimensional landmark data

三维标志点数据中平均反射形状及大小与形状的自助法推断

Working within the framework of a multi-dimensional scaling approach to shape analysis, we develop bootstrap methods for inference about mean reflection shape and size-and-shape based on labelled landmark data. The approach is developed in general dimensions though we focus on the three-dimensional case. We consider two pivotal statistics which we use to construct bootstrap confidence regions for the mean reflection shape or size-and-shape, and present simulation results…

AI 解读阅读原文 ↗BibTeX ↓

EEBoost: A General Method for Prediction and Variable Selection Based on Estimating Equations

EEBoost:基于估计方程的预测与变量选择

The modern statistical literature is replete with methods for performing variable selection and prediction in standard regression problems. However, simple models may misspecify or fail to capture important aspects of the data generating process such as missingness, correlation, and over/underdispersion. In this article we describe EEBoost, a strategy for variable selection and prediction which can be applied in high-dimensional settings where inference for low-dimensional…

AI 解读阅读原文 ↗BibTeX ↓

Fast Robust Model Selection in Large Datasets

大型数据集中的快速稳健模型选择

Large datasets are increasingly common in many research fields. In particular, in the linear regression context, it is often the case that a huge number of potential covariates are available to explain a response variable, and the first step of a reasonable statistical analysis is to reduce the number of covariates. This can be done in a forward selection procedure that includes selecting the variable to enter, deciding to retain it or stop the selection, and estimating the…

AI 解读阅读原文 ↗BibTeX ↓

On Propagated Scoring for Semisupervised Additive Models

半监督加性模型中的传播评分

This article presents a semisupervised modeling framework that combines feature-based (x) data and graph-based (G) data for classification/regression of the response Y. In this semisupervised setting, Y is observed for a subset of the observations (labeled) and missing for the remainder (unlabeled). The Propagated Scoring algorithm proposed for fitting this model is a semisupervised fixed-point regularization approach that essentially extends the generalized additive model…

AI 解读阅读原文 ↗BibTeX ↓

A unified framework for studying parameter identifiability and estimation in biased sampling designs

有偏抽样设计中参数可识别性与估计的统一框架

Based on the odds ratio representation of a joint density, we propose a unified framework to study parameter identifiability in biased sampling designs. It is shown that most of these designs encountered in practice can be reformulated within the proposed framework and, as a result, the question of parameter identifiability can be largely clarified. Estimation of the identifiable parameters is considered and traditional results on the equivalence of the prospective and…

AI 解读阅读原文 ↗BibTeX ↓

ℓ1-penalized quantile regression in high-dimensional sparse models

高维稀疏模型中的 ℓ1 惩罚分位数回归

We consider median regression and, more generally, a possibly infinite collection of quantile regressions in high-dimensional sparse models. In these models, the number of regressors p is very large, possibly larger than the sample size n, but only at most s regressors have a nonzero impact on each conditional quantile of the response variable, where s grows more slowly than n. Since ordinary quantile regression is not consistent in this case, we consider ℓ1-penalized…

AI 解读阅读原文 ↗BibTeX ↓

Regression on manifolds: Estimation of the exterior derivative

流形上的回归:外微分估计

Collinearity and near-collinearity of predictors cause difficulties when doing regression. In these cases, variable selection becomes untenable because of mathematical issues concerning the existence and numerical stability of the regression coefficients, and interpretation of the coefficients is ambiguous because gradients are not defined. Using a differential geometric interpretation, in which the regression coefficients are interpreted as estimates of the exterior…

AI 解读阅读原文 ↗BibTeX ↓

Support union recovery in high-dimensional multivariate regression

高维多元回归中的支持集并集恢复

In multivariate regression, a K-dimensional response vector is regressed upon a common set of p covariates, with a matrix B∗ ∈ ℝp × K of regression coefficients. We study the behavior of the multivariate group Lasso, in which block regularization based on the ℓ1 ∕ ℓ2 norm is used for support union recovery, or recovery of the set of s rows for which B∗ is nonzero. Under high-dimensional scaling, we show that the multivariate group Lasso exhibits a threshold for the recovery…

AI 解读阅读原文 ↗BibTeX ↓

New efficient estimation and variable selection methods for semiparametric varying-coefficient partially linear models

半参数变系数部分线性模型的新型高效估计与变量选择方法

The complexity of semiparametric models poses new challenges to statistical inference and model selection that frequently arise from real applications. In this work, we propose new estimation and variable selection procedures for the semiparametric varying-coefficient partially linear model. We first study quantile regression estimates for the nonparametric varying-coefficient functions and the parametric regression coefficients. To achieve nice efficiency properties, we…

AI 解读阅读原文 ↗BibTeX ↓

Fast Stable Restricted Maximum Likelihood and Marginal Likelihood Estimation of Semiparametric Generalized Linear Models

半参数广义线性模型中快速稳定的限制极大似然与边际似然估计

Summary Recent work by Reiss and Ogden provides a theoretical basis for sometimes preferring restricted maximum likelihood (REML) to generalized cross-validation (GCV) for smoothing parameter selection in semiparametric regression. However, existing REML or marginal likelihood (ML) based methods for semiparametric generalized linear models (GLMs) use iterative REML or ML estimation of the smoothing parameters of working linear approximations to the GLM. Such indirect schemes…

AI 解读阅读原文 ↗BibTeX ↓

Multiple Change-Point Estimation With a Total Variation Penalty

利用全变差惩罚估计多个变点

We propose a new approach for dealing with the estimation of the location of change-points in one-dimensional piecewise constant signals observed in white noise. Our approach consists in reframing this task in a variable selection context. We use a penalized least-square criterion with a ℓ1-type penalty for this purpose. We explain how to implement this method in practice by using the LARS / LASSO algorithm. We then prove that, in an appropriate asymptotic framework, this…

AI 解读阅读原文 ↗BibTeX ↓

Variable Selection Using Adaptive Nonlinear Interaction Structures in High Dimensions

高维自适应非线性交互结构的变量选择

Numerous penalization based methods have been proposed for fitting a traditional linear regression model in which the number of predictors, p, is large relative to the number of observations, n. Most of these approaches assume sparsity in the underlying coefficients and perform some form of variable selection. Recently, some of this work has been extended to nonlinear additive regression models. However, in many contexts one wishes to allow for the possibility of…

AI 解读阅读原文 ↗BibTeX ↓