Bootstrap based asymptotic refinements for high-dimensional nonlinear models
高维非线性模型基于自助法的渐近改进AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要明确列举随机系数 logit 与 probit 为适用模型,因此离散选择是有直接文本依据的应用方向。
高维非线性模型基于自助法的渐近改进AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
We consider penalized extremum estimation of a high-dimensional, possibly nonlinear model that is sparse in the sense that most of its parameters are zero but some are not. We use the SCAD penalty function, which provides model selection consistent and oracle efficient estimates under suitable conditions. However, asymptotic approximations based on the oracle model can be inaccurate with the sample sizes found in many applications. This paper gives conditions under which the bootstrap, based on estimates obtained through SCAD penalization with thresholding, provides asymptotic refinements of size O(n−2) for the error in the rejection (coverage) probability of a symmetric hypothesis test (confidence interval) and O(n−1) for the error in the rejection (coverage) probability of a one-sided or equal tailed test (confidence interval). The results of Monte Carlo experiments show that the bootstrap can provide large reductions in errors in rejection and coverage probabilities. The bootstrap is consistent, though it does not necessarily provide asymptotic refinements, if some parameters are close but not equal to zero. Random-coefficients logit and probit models and nonlinear moment models are examples of models to which the procedure applies.
通过正则化最优传输推断部分识别矩模型
Many statistical and econometric problems involve parameters defined by moments of a joint distribution when only marginal distributions are observed, leading naturally to partial identification. We develop a methodology for identification, estimation, and inference in the corresponding partially identified GMM model. We characterize the sharp identified set for the parameter of interest via a support-function/optimal-transport (OT) representation. To estimate the identified…
测度线性表示模型中识别、计算与推断的对抗方法
We develop a framework for identification, computation, and inference in econometric models with a linear-in-measures representation. These models express maintained restrictions as moment conditions linear in the joint probability measure of observed and latent inputs, and map that measure linearly to the distribution of outputs, even with nonlinear outcome equations. We construct an adversarial discrepancy function whose zeros characterize the identified set for structural…
稀疏依赖下二元配置概率的对抗估计
We consider the problem of estimating binary configuration probabilities, which is common in operations management applications, including product bundling, advertising, etc. Existing approaches typically model each assortment as a category and apply multinomial models to estimate the choice probabilities; while computationally convenient, these methods do not exploit independence structures in the joint distribution and may therefore be statistically inefficient when the…
扰动效用模型的 Fenchel–Young 估计量
Perturbed Utility Models (PUMs) represent discrete choice as utility maximization under convex perturbation or regularization, encompassing a broad class of choice models, including Multinomial Logit (MNL) and models that permit zero choice probabilities. Because, for general perturbations, maximum likelihood may be non-convex, and the negative log-likelihood is infinite when a sparse model assigns zero probability to an observed choice, we specialize the Fenchel--Young…
熵正则化最优传输下的部分识别
In many statistical settings, the available data and maintained assumptions do not suffice to uniquely identify the model parameters of interest. In such cases, one can only identify sets which are guaranteed to contain the true parameters. These are often characterized through linear programs that optimize over models compatible with the observed data. These programs can be infinite-dimensional in the optimizer and the number of constraints. We provide a unified way to…
结合协变量与稀疏内在得分的实体排序
This paper addresses the item ranking problem with associated covariates, focusing on scenarios where the preference scores can not be fully explained by covariates, and the remaining intrinsic scores are sparse. Specifically, we extend the pioneering Bradley-Terry-Luce (BTL) model by incorporating covariate information and considering sparse individual intrinsic scores. Our work introduces novel model identification conditions and examines the statistical rates of the…