文献类型：期刊文献

中文题名：基于Fenchel对偶的核Logistic回归并行学习算法

英文题名：A Parallel Learning Algorithm for Kernel Logistic Regression by Using Fenchel Duality

作者：丁朋[1];卿湘运[1];王行愚[1]

机构：[1]华东理工大学自动化系,上海200237

年份：2011

卷号：37

期号：9

起止页码：1145

中文期刊名：自动化学报

外文期刊名：Acta Automatica Sinica

收录：CSTPCD;;EI(收录号：20114314458241);Scopus;北大核心:【北大核心2008】；CSCD:【CSCD2011_2012】；PubMed;

基金：国家自然科学基金(61074113)资助~~

语种：中文

中文关键词：核Logistic回归;Fenchel对偶;大规模机器学习;凸优化

外文关键词：Kernel logistic regression （KLR）, Fenchel duality, large-scale machine learning, convex optimization

摘要：给出了一种大规模核Logistic回归的并行学习算法.利用凸优化中的Fenchel对偶定理,将核Logistic回归的优化原问题转换成对偶空间的优化问题,再利用块更新迭代方法,可以独立地在部分数据集上进行分类器训练.设计了一个简单的客户机–服务器并行计算模式,每个客户机对部分数据优化子问题,在一次优化结束后,服务器根据各客户机传递的信息修正各子问题目标函数.在标准数据集的实验结果表明了基于Fenchel对偶的核Logistic回归并行学习算法的可行性.
A parallel learning algorithm for solving large scale kernel logistic regression problems is presented. Primal optimization problem for the kernel logistic regression is switched to the dual problem by using Fenchel duality theory in convex optimization. Then, learning the classifiers on subsets of training data can run independently when block-update methods are employed. A simple customer-server parallel computing mode is designed that each customer node learns a sub-problem for the subset of training data. Server node receives the messages passed by all customer nodes after one optimization iteration is end, followed by updating the objective functions of sub-problems. In comparison to non-parallel learning algorithms on standardized datasets, we obtain encouraging results.