Multi-stage multi-task feature learning

MaRDI QIDQ2933925zbMATH OpenFDO

Authors Pinghua Gong, Jieping Ye, Changshui Zhang

Publication date 8 December 2014

Full work available at URL https://arxiv.org/abs/1210.5806, http://jmlr.csail.mit.edu/papers/v14/gong13a.html

zbMATH Keywords

multi-stagemulti-task learningnonconvexsparse learning

Mathematics Subject Classification ID

Ridge regression; shrinkage estimators (Lasso) (62J07) Learning and adaptive systems in artificial intelligence (68T05) Applications of mathematical programming (90C90)

Recommendations

• Convex multi-task feature learning
• Multiplicative multitask feature learning
• Low-rank and sparse multi-task learning
• Multitask sparsity via maximum entropy discrimination
• Analysis of multi-stage convex relaxation for sparse regularization

Cited in

(13)

• Convex multi-task feature learning
• Least absolute deviations learning of multiple tasks
• Separating variables to accelerate non-convex regularized optimization
• Multiplicative multitask feature learning
• The benefit of multitask representation learning
• Low-rank and sparse multi-task learning
• Minimum description length penalization for group and multi-task sparse learning
• A novel ramp loss-based multi-task twin support vector machine with multi-parameter safe acceleration
• Local optimality for stationary points of group zero-norm regularized problems and equivalent surrogates
• Calibrated multi-task subspace learning via binary group structure constraint
• An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems
• Multi-task learning regression via convex clustering
• Robust and flexible learning of a high-dimensional classification rule using auxiliary outcomes

This page was built for publication: Multi-stage multi-task feature learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2933925)