arrow
返回

An efficient primal dual prox method for non-smooth optimization

delete2014-03-21
delete21
delete
OA
AI
T
Tianbao Yang *
M
Mehrdad Mahdavi
靳
靳榕 (Rong Jin)
S
Shenghuo Zhu
DOI:10.1007/s10994-014-5436-1delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
We study the non-smooth optimization problems in machine learning, where both the loss function and the regularizer are non-smooth functions. Previous studies on efficient empirical loss minimization assume either a smooth loss function or a strongly convex regularizer, making them unsuitable for non-smooth optimization. We develop a simple yet efficient method for a family of non-smooth optimization problems where the dual form of the loss function is bilinear in primal and dual variables. We cast a non-smooth optimization problem into a minimax optimization problem, and develop a primal dual prox method that solves the minimax optimization problem at a rate of assuming that the proximal step can be efficiently solved, significantly faster than a standard subgradient descent method that has an convergence rate. Our empirical studies verify the efficiency of the proposed method for various non-smooth optimization problems that arise ubiquitously in machine learning by comparing it to the state-of-the-art first order methods.
Keyword:
Non-smooth optimization
Primal dual method
Convergence rate
Sparsity
Efficiency

期刊

Machine Learning 封面图
Machine Learning
IF:
2.9
论文数:
2.7K
被引数:
3.4W

机构

N
nec corporation
学者数:
1.0K
论文数: 956
被引数: 0
M
michigan state university
学者数:
3.6W
论文数: 3.2W
被引数: 44
引用论文

引用论文

err分享
err收藏
Branding and the Cyprus wine industry
err2008-02-29
err0
PREAI
errDemetris Vrontis; Stanley J Paliwoda
err分享
err收藏
err分享
err收藏
学者 查看更多内容