The landscape of empirical risk for nonconvex losses
非凸损失下经验风险的几何结构AI 解读 ↓
← 返回论文列表与筛选
阅读说明
本页整理公开书目信息，不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成，未完成全文核验，可能有误；具体假设、证明与结论请核对原文。摘要保留来源文本，未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要；缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录，不合计多个记录；关联记录可能包含正式发表版本，不等于此版本单独引用。缺失不视为零，引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配，同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列，再参考通用方法与发表日期。
分类依据与纠错
AI 根据所提供的论文材料归类：摘要讨论通用高维非凸估计与优化；分类和稳健回归示例未建立与所列经济计量细分领域的直接联系。
反馈分类问题
正在核对关联版本…
代码、数据与补充材料
正在核对对应版本的资源…
关注这篇论文的作者
非凸损失下经验风险的几何结构
- 研究问题
- 研究非凸经验风险的驻点结构与计算难度，考察何时总体风险的良好几何性质可以传递到样本风险并支持下降算法分析。
- 方法与思路
- 作者研究经验风险梯度和 Hessian 的一致收敛，以连接总体与经验风险的驻点，并将分析扩展到参数维数超过样本量的稀疏情形。
- 材料陈述的贡献
- 摘要称，在相应条件下可建立驻点一一对应，并刻画分类、稳健回归及高斯混合问题中的风险几何和下降算法收敛性质。
- 阅读关注点
- 应核对梯度与 Hessian 收敛的假设、驻点对应需要的几何条件，以及样本量、参数维数、稀疏度和对数因子的具体关系。
- 阅读边界
- 仅据稿件版本未注明的 OpenAlex 摘要；具体光滑性、尾部及几何条件未展开，不能将算法结论推广到任意非凸损失或推断刊本变化。
原文摘要
Most high-dimensional estimation methods propose to minimize a cost function (empirical risk) that is a sum of losses associated to each data point (each example). In this paper, we focus on the case of nonconvex losses. Classical empirical process theory implies uniform convergence of the empirical (or sample) risk to the population risk. While under additional assumptions, uniform convergence implies consistency of the resulting M-estimator, it does not ensure that the latter can be computed efficiently. In order to capture the complexity of computing M-estimators, we study the landscape of the empirical risk, namely its stationary points and their properties. We establish uniform convergence of the gradient and Hessian of the empirical risk to their population counterparts, as soon as the number of samples becomes larger than the number of unknown parameters (modulo logarithmic factors). Consequently, good properties of the population risk can be carried to the empirical risk, and we are able to establish one-to-one correspondence of their stationary points. We demonstrate that in several problems such as nonconvex binary classification, robust regression and Gaussian mixture model, this result implies a complete characterization of the landscape of the empirical risk, and of the convergence properties of descent algorithms. We extend our analysis to the very high-dimensional setting in which the number of parameters exceeds the number of samples, and provides a characterization of the empirical risk landscape under a nearly information-theoretically minimal condition. Namely, if the number of samples exceeds the sparsity of the parameters vector (modulo logarithmic factors), then a suitable uniform convergence result holds. We apply this result to nonconvex binary classification and robust regression in very high-dimension.