Multitask sparsity via maximum entropy discrimination

MaRDI QIDQ5396604zbMATH OpenFDO

Authors Tony Jebara

Publication date 3 February 2014

Full work available at URL http://www.jmlr.org/papers/v12/jebara11a.html

zbMATH Keywords

feature selectionlassoclassificationquadratic programmingregressionBayesian methodssupport vector machinesmeta-learningconvex programmingmaximum entropyvariational boundslarge marginkernel selectiongraphical model structure estimation

Mathematics Subject Classification ID

Bayesian inference (62F15) Nonparametric regression and quantile regression (62G08) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Ridge regression; shrinkage estimators (Lasso) (62J07)

Recommendations

• Convex multi-task feature learning
• Multitask multiclass support vector machines: model and experiments
• Multiplicative multitask feature learning
• Learning multiple tasks with kernel methods
• Learning Theory and Kernel Machines

Cited in

(11)

• Multi-stage multi-task feature learning
• Multiplicative multitask feature learning
• Proximal Multitask Learning Over Networks With Sparsity-Inducing Coregularization
• Consensus and complementarity based maximum entropy discrimination for multi-view classification
• scientific article; zbMATH DE number 2062650 (Why is no real title available?)
• Multi-task and lifelong learning of kernels
• Convex multi-task feature learning
• A novel multivariate performance optimization method based on sparse coding and hyper-predictor learning
• Maximum entropy discrimination Markov networks
• Multitask multiclass support vector machines: model and experiments
• Minimum description length penalization for group and multi-task sparse learning

This page was built for publication: Multitask sparsity via maximum entropy discrimination

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