大连理工大学数学科学学院
通知与公告

【新加坡国立大学】—孙德锋 “Fast algorithms for large scale generalized distance weighted discrimination”

2016年04月07日 14:07  点击:[]

学术报告

 

报告题目:Fast algorithms for large scale generalized distance weighted discrimination

报告人:孙德锋 教授  (新加坡国立大学数学系)

报告时间:2016 48 日(星期五)下午2:00

报告地点:研教楼 418

报告校内联系人:张立卫 教授      联系电话:84708351-8118

报告摘要:

High dimension low sample size statistical analysis is important in a wide range of applications. In such situations, the highly appealing discrimination method, support vector machine, can be improved to alleviate data piling at the margin. This leads naturally to the development of distance weighted discrimination (DWD), which can be modeled as a second-order cone programming problem and solved by interior-point methods when the scale (in sample size and feature dimension) of the data is moderate. Here, we design a scalable and robust algorithm for solving large scale generalized DWD problems. Numerical experiments on real data sets from the UCI repository demonstrate that our algorithm is highly efficient in solving large scale problems, and sometimes even more efficient than the highly optimized LIBSVM for solving the corresponding SVM problems. [This is a joint work with Xin Yee Lam, J. S. Marron and Kim-Chuan Toh]

报告人简介:

孙德锋,新加坡国立大学数学系教授,现任国际顶级数学期刊Mathematical ProgrammingSIAM Journal on Optimization编委。曾任Asia-Pacific Journal of Operational Research主编。他于20115月,受邀在德国举行的SIAM优化国际会议上作大会报告。他的研究领域为最优化,上世纪90年代中后期在半光滑和光滑化牛顿方法方面取得国际公认的研究成果。本世纪初到现在,他开辟了矩阵优化这一新的学科,建立了非光滑矩阵分析,在矩阵优化的理论、算法及应用方面取得了奠基性的系列成果。

 

 

 

 

                                             数学科学学院

201647

上一条:【新加坡国立大学】—孙德锋 “A two-phase proximal augmented Lagrangian method for convex quadratic composite conic programming problems” 下一条:【中科院】【华罗庚班】——冯琦“数学思想方法系列讲座(五)” 高阶无穷原理与实数集合

关闭