An Efficient Primal-Dual Prox Method for Non-Smooth Optimization
Preprint
Abstract
We consider 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 an efficient method for a family of non-smooth optimization 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 $O(1/T)$, significantly faster than a standard gradient descent method ($O(1/\sqrt{T})$). Our empirical study verifies the efficiency of the proposed method for non-smooth optimization by comparing it to the state-of-the-art first order methods.
Keywords
All Related Versions
This publication has 17 references indexed in Scilit:
- A smoothing stochastic gradient method for composite optimizationOptimization Methods and Software, 2014
- NESVM: A Fast Gradient Method for Support Vector Machines2010
- Pegasos: primal estimated sub-gradient solver for SVMMathematical Programming, 2010
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm MinimizationSIAM Review, 2010
- Accelerated Gradient Method for Multi-task Sparse Learning Problem2009
- Convex multi-task feature learningMachine Learning, 2008
- Model Selection and Estimation in Regression with Grouped VariablesJournal of the Royal Statistical Society Series B: Statistical Methodology, 2005
- Smooth minimization of non-smooth functionsMathematical Programming, 2004
- A Feature Selection Newton Method for Support Vector Machine ClassificationComputational Optimization and Applications, 2004
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point ProblemsSIAM Journal on Optimization, 2004