Estimating high dimensional monotone index models by iterative convex optimization
通过迭代凸优化估计高维单调指标模型AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要明确指出单调指标模型包含离散选择模型;其余讨论为一般半参数估计,未提供更多细分方向的直接依据。
通过迭代凸优化估计高维单调指标模型AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
In this paper we propose new approaches to estimating large dimensional monotone index models. This class of models has been popular in the applied and theoretical econometrics literatures as it includes discrete choice, nonparametric transformation, and duration models. A main advantage of our approach is computational. For instance, rank estimation procedures such as those proposed in [13] and [7] that optimize a nonsmooth, nonconvex objective function are difficult to use with more than a few regressors, which limits their use with economic data sets. For such monotone index models with increasing dimension, we propose to use a new class of estimators based on batched gradient descent (BGD) involving nonparametric methods such as kernel estimation or sieve estimation, and study their asymptotic properties. The algorithm uses an iterative procedure where the key step exploits a strictly convex objective function, resulting in contraction map. A contribution of our approach is that our model is large dimensional and semiparametric so does not require the use of parametric distributional assumptions.