0


一种用于规则化风险最小化的可伸缩模块凸型求解器

A Scalable Modular Convex Solver for Regularized Risk Minimization
课程网址: http://videolectures.net/kdd07_teo_asmcs/  
主讲教师: Choon Hui Teo
开课单位: 澳大利亚国立大学
开课时间: 2007-08-15
课程语种: 英语
中文简介:
各种机器学习问题可以描述为最小化正则化风险函数,使用不同的算法使用不同的风险概念和不同的正则化器。示例包括线性支持向量机(SVM),Logistic回归,条件随机场(CRF)和Lasso等。本文描述了高度可扩展和模块化凸解的理论和实现,它解决了所有这些估计问题。它可以在一组工作站上并行化,允许数据本地化,并且可以处理正则化器,例如“1”和“2”惩罚。目前,我们的求解器实现了20个不同的估计问题,可以轻松扩展,扩展到数百万个观测值,并且比许多应用程序的专用求解器快10倍。开源代码可作为ELEFANT工具箱的一部分免费提供。
课程简介: A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and different regularizers. Examples include linear Support Vector Machines (SVMs), Logistic Regression, Conditional Random Fields (CRFs), and Lasso amongst others. This paper describes the theory and implementation of a highly scalable and modular convex solver which solves all these estimation problems. It can be parallelized on a cluster of workstations, allows for data-locality, and can deal with regularizers such as `1 and `2 penalties. At present, our solver implements 20 different estimation problems, can be easily extended, scales to millions of observations, and is up to 10 times faster than specialized solvers for many applications. The open source code is freely available as part of the ELEFANT toolbox.
关 键 词: 机器学习; 正则化风险函数; 数据本地化
课程来源: 视频讲座网
最后编审: 2019-05-09:lxf
阅读次数: 19