Open AccessProceedings Article
Sparse Bayesian Multi-Task Learning
Shengbo Guo,Onno Zoeter,Cédric Archambeau +2 more
- 12 Dec 2011
- Vol. 24, pp 1755-1763
TL;DR: The amount of sparsity can be learnt from the data by combining an approximate inference approach with type II maximum likelihood estimation of the hyperparameters, and a general family of group sparsity inducing priors based on matrix-variate Gaussian scale mixtures is introduced.
read more
Abstract: We propose a new sparse Bayesian model for multi-task regression and classification. The model is able to capture correlations between tasks, or more specifically a low-rank approximation of the covariance matrix, while being sparse in the features. We introduce a general family of group sparsity inducing priors based on matrix-variate Gaussian scale mixtures. We show the amount of sparsity can be learnt from the data by combining an approximate inference approach with type II maximum likelihood estimation of the hyperparameters. Empirical evaluations on data sets from biology and vision demonstrate the applicability of the model, where on both regression and classification tasks it achieves competitive predictive performance compared to previously proposed methods.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Posted Content
A Survey on Multi-Task Learning
Yu Zhang,Qiang Yang +1 more
TL;DR: Multi-task learning (MTL) as mentioned in this paper is a learning paradigm in machine learning and its aim is to leverage useful information contained in multiple related tasks to help improve the generalization performance of all the tasks.
1.8K
A Survey on Multi-Task Learning
Yu Zhang,Qiang Yang +1 more
TL;DR: A survey for MTL is given, which classifies different MTL algorithms into several categories, including feature learning approach, low-rank approach, task clustering approaches, task relation learning approaches, and decomposition approach, and then discusses the characteristics of each approach.
1.2K
A Survey of Multi-View Representation Learning
TL;DR: Multi-view representation learning has become a rapidly growing direction in machine learning and data mining areas as mentioned in this paper, and a comprehensive survey of multi-view representations can be found in this paper.
•Posted Content
Learning Task Grouping and Overlap in Multi-task Learning
Abhishek Kumar,Hal Daumé +1 more
TL;DR: This work proposes a framework for multi-task learning that enables one to selectively share the information across the tasks, based on the assumption that task parameters within a group lie in a low dimensional subspace but allows the tasks in different groups to overlap with each other in one or more bases.
•Proceedings Article
Learning Task Grouping and Overlap in Multi-task Learning
Abhishek Kumar,Hal Daumé +1 more
- 26 Jun 2012
TL;DR: In this article, the authors propose a framework for multi-task learning that enables one to selectively share the information across the tasks, where each task parameter vector is a linear combination of a finite number of underlying basis tasks and the overlap in the sparsity patterns of two tasks controls the amount of sharing across these.
References
•Book
Data Analysis Using Regression and Multilevel/Hierarchical Models
Andrew Gelman,Yu-Sung Su +1 more
- 01 Jan 2006
TL;DR: Data Analysis Using Regression and Multilevel/Hierarchical Models is a comprehensive manual for the applied researcher who wants to perform data analysis using linear and nonlinear regression and multilevel models.
Model selection and estimation in regression with grouped variables
Ming Yuan,Yi Lin +1 more
TL;DR: In this paper, instead of selecting factors by stepwise backward elimination, the authors focus on the accuracy of estimation and consider extensions of the lasso, the LARS algorithm and the non-negative garrotte for factor selection.
•Book
Statistical Decision Theory and Bayesian Analysis
James O. Berger
- 22 Dec 2012
TL;DR: An overview of statistical decision theory, which emphasizes the use and application of the philosophical ideas and mathematical structure of decision theory.
8.4K
Robust principal component analysis
TL;DR: In this paper, the authors prove that under some suitable assumptions, it is possible to recover both the low-rank and the sparse components exactly by solving a very convenient convex program called Principal Component Pursuit; among all feasible decompositions, simply minimize a weighted combination of the nuclear norm and of the e1 norm.
Related Papers (5)
Andreas Argyriou,Theodoros Evgeniou,Massimiliano Pontil +2 more
- 04 Dec 2006
Theodoros Evgeniou,Massimiliano Pontil +1 more
- 22 Aug 2004
Zhuoliang Kang,Kristen Grauman,Fei Sha +2 more
- 28 Jun 2011