正则化风险最小化的完全校正提升
Totally Corrective Boosting for Regularized Risk Minimization
摘要:
考虑的原始和对偶问题一起导致重要的新的见解提升算法的特点。在这项工作中,我们提出了一个通用的框架,可用于设计新的提升算法。各种各样的机器学习问题本质上是最小化正则化的风险泛函。我们表明,建议的提升框架,称为CGBoost,可以容纳各种损失函数和不同的正则化在一个完全正确的优化方式。我们表明,通过求解原始而不是对偶,实际上可以有效地解决大量的完全校正的提升算法,并且不需要复杂的凸优化求解器。我们还证明了一些增强算法,如AdaBoost,可以在我们的框架中解释-即使它们的优化也不是完全正确的。我们根据经验表明,基于所提出的框架的各种增强算法在我们在实验中使用的UCIrvine机器学习数据集[1]上的表现相似。
英文摘要:
Consideration of the primal and dual problems together leads to important new insights into the characteristics of boosting algorithms. In this work, we propose a general framework that can be used to design new boosting algorithms. A wide variety of machine learning problems essentially minimize a regularized risk functional. We show that the proposed boosting framework, termed CGBoost, can accommodate various loss functions and different regularizers in a totally-corrective optimization fashion. We show that, by solving the primal rather than the dual, a large body of totally-corrective boosting algorithms can actually be efficiently solved and no sophisticated convex optimization solvers are needed. We also demonstrate that some boosting algorithms like AdaBoost can be interpreted in our framework--even their optimization is not totally corrective. We empirically show that various boosting algorithms based on the proposed framework perform similarly on the UCIrvine machine learning datasets [1] that we have used in the experiments.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。