IPBoost -- Non-Convex Boosting via Integer Programming
ICML(2020)
摘要
Recently non-convex optimization approaches for solving machine learning problems have gained significant attention. In this paper we explore non-convex boosting in classification by means of integer programming and demonstrate real-world practicability of the approach while circumventing shortcomings of convex boosting approaches. We report results that are comparable to or better than the current state-of-the-art.
更多查看译文
关键词
integer programming,non-convex
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络