期刊
SIAM JOURNAL ON OPTIMIZATION
卷 20, 期 6, 页码 3465-3489出版社
SIAM PUBLICATIONS
DOI: 10.1137/090763184
关键词
multi-task learning; gene expression pattern analysis; trace norm regularization; convex optimization; duality; semidefinite programming; proximal gradient method
We consider a recently proposed optimization formulation of multi-task learning based on trace norm regularized least squares. While this problem may be formulated as a semidefinite program (SDP), its size is beyond general SDP solvers. Previous solution approaches apply proximal gradient methods to solve the primal problem. We derive new primal and dual reformulations of this problem, including a reduced dual formulation that involves minimizing a convex quadratic function over an operator-norm ball in matrix space. This reduced dual problem may be solved by gradient-projection methods, with each projection involving a singular value decomposition. The dual approach is compared with existing approaches and its practical effectiveness is illustrated on simulations and an application to gene expression pattern analysis.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据