Multitask sparsity via maximum entropy discrimination

zbMATH Open1280.62077MaRDI QIDQ5396604FDOQ5396604

Tony Jebara

Publication date: 3 February 2014

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

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

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)

Cited In (5)

• Proximal Multitask Learning Over Networks With Sparsity-Inducing Coregularization
• Consensus and complementarity based maximum entropy discrimination for multi-view classification
• Title not available (Why is that?)
• Convex multi-task feature learning
• Multi-task and Lifelong Learning of Kernels

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)