Convexity, Classification, and Risk Bounds
凸性、分类与风险界AI 解读 ↓
← 返回论文列表与筛选
阅读说明
本页整理公开书目信息，不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成，未完成全文核验，可能有误；具体假设、证明与结论请核对原文。摘要保留来源文本，未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要；缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录，不合计多个记录；关联记录可能包含正式发表版本，不等于此版本单独引用。缺失不视为零，引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配，同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列，再参考通用方法与发表日期。
分类依据与纠错
AI 根据所提供的论文材料归类：摘要讨论通用机器学习分类理论，其风险概念并非金融尾部风险，也未指向所列计量应用方向。
反馈分类问题
正在核对关联版本…
代码、数据与补充材料
正在核对对应版本的资源…
凸性、分类与风险界
- 研究问题
- 分类算法最小化凸替代损失时，其替代风险如何控制实际分类风险，计算便利与统计性质之间有何关系？
- 方法与思路
- 作者用损失函数的变分变换连接替代风险与分类风险，在分类Fisher一致性及低噪声情形下分析超额风险界。
- 材料陈述的贡献
- 摘要称给出适用于非负替代损失的定量风险关系，并在低噪声下获得更精细的界及特定函数类的收敛率应用。
- 阅读关注点
- 应核对分类Fisher一致性的准确条件、风险变换的构造、低噪声假设，以及更快收敛率依赖的函数类限制。
- 阅读边界
- OpenAlex索引摘要未注明稿件版本；结论针对分类风险，摘要未提供足以判断具体算法有限样本优势的比较证据。
原文摘要
Many of the classification algorithms developed in the machine learning literature, including the support vector machine and boosting, can be viewed as minimum contrast methods that minimize a convex surrogate of the 0–1 loss function. The convexity makes these algorithms computationally efficient. The use of a surrogate, however, has statistical consequences that must be balanced against the computational virtues of convexity. To study these issues, we provide a general quantitative relationship between the risk as assessed using the 0–1 loss and the risk as assessed using any nonnegative surrogate loss function. We show that this relationship gives nontrivial upper bounds on excess risk under the weakest possible condition on the loss function—that it satisfies a pointwise form of Fisher consistency for classification. The relationship is based on a simple variational transformation of the loss function that is easy to compute in many applications. We also present a refined version of this result in the case of low noise, and show that in this case, strictly convex loss functions lead to faster rates of convergence of the risk than would be implied by standard uniform convergence arguments. Finally, we present applications of our results to the estimation of convergence rates in function classes that are scaled convex hulls of a finite-dimensional base class, with a variety of commonly used loss functions.