Abstract
Multi-task sparse feature learning aims to improve the generalization performance by exploiting the shared features among tasks. It has been successfully applied to many applications including computer vision and biomedical informatics. Most of the existing multi-task sparse feature learning algorithms are formulated as a convex sparse regularization problem, which is usually suboptimal, due to its looseness for approximating an l0-type regularizer. In this paper, we propose a non-convex formulation for multi-task sparse feature learning based on a novel regularizer. To solve the non-convex optimization problem, we propose a Multi-Stage Multi-Task Feature Learning (MSMTFL) algorithm. Moreover, we present a detailed theoretical analysis showing that MSMTFL achieves a better parameter estimation error bound than the convex formulation. Empirical studies on both synthetic and real-world data sets demonstrate the effectiveness of MSMTFL in comparison with the state of the art multi-task sparse feature learning algorithms.
| Original language | English (US) |
|---|---|
| Title of host publication | Advances in Neural Information Processing Systems |
| Pages | 1988-1996 |
| Number of pages | 9 |
| Volume | 3 |
| State | Published - 2012 |
| Event | 26th Annual Conference on Neural Information Processing Systems 2012, NIPS 2012 - Lake Tahoe, NV, United States Duration: Dec 3 2012 → Dec 6 2012 |
Other
| Other | 26th Annual Conference on Neural Information Processing Systems 2012, NIPS 2012 |
|---|---|
| Country | United States |
| City | Lake Tahoe, NV |
| Period | 12/3/12 → 12/6/12 |
Fingerprint
ASJC Scopus subject areas
- Computer Networks and Communications
- Information Systems
- Signal Processing
Cite this
Multi-stage multi-task feature learning. / Gong, Pinghua; Ye, Jieping; Zhang, Changshui.
Advances in Neural Information Processing Systems. Vol. 3 2012. p. 1988-1996.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Multi-stage multi-task feature learning
AU - Gong, Pinghua
AU - Ye, Jieping
AU - Zhang, Changshui
PY - 2012
Y1 - 2012
N2 - Multi-task sparse feature learning aims to improve the generalization performance by exploiting the shared features among tasks. It has been successfully applied to many applications including computer vision and biomedical informatics. Most of the existing multi-task sparse feature learning algorithms are formulated as a convex sparse regularization problem, which is usually suboptimal, due to its looseness for approximating an l0-type regularizer. In this paper, we propose a non-convex formulation for multi-task sparse feature learning based on a novel regularizer. To solve the non-convex optimization problem, we propose a Multi-Stage Multi-Task Feature Learning (MSMTFL) algorithm. Moreover, we present a detailed theoretical analysis showing that MSMTFL achieves a better parameter estimation error bound than the convex formulation. Empirical studies on both synthetic and real-world data sets demonstrate the effectiveness of MSMTFL in comparison with the state of the art multi-task sparse feature learning algorithms.
AB - Multi-task sparse feature learning aims to improve the generalization performance by exploiting the shared features among tasks. It has been successfully applied to many applications including computer vision and biomedical informatics. Most of the existing multi-task sparse feature learning algorithms are formulated as a convex sparse regularization problem, which is usually suboptimal, due to its looseness for approximating an l0-type regularizer. In this paper, we propose a non-convex formulation for multi-task sparse feature learning based on a novel regularizer. To solve the non-convex optimization problem, we propose a Multi-Stage Multi-Task Feature Learning (MSMTFL) algorithm. Moreover, we present a detailed theoretical analysis showing that MSMTFL achieves a better parameter estimation error bound than the convex formulation. Empirical studies on both synthetic and real-world data sets demonstrate the effectiveness of MSMTFL in comparison with the state of the art multi-task sparse feature learning algorithms.
UR - http://www.scopus.com/inward/record.url?scp=84877724400&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84877724400&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84877724400
SN - 9781627480031
VL - 3
SP - 1988
EP - 1996
BT - Advances in Neural Information Processing Systems
ER -