Sciweavers

148 search results - page 1 / 30
» Bounds for Linear Multi-Task Learning
Sort
View
JMLR
2006
137views more  JMLR 2006»
14 years 9 months ago
Bounds for Linear Multi-Task Learning
Abstract. We give dimension-free and data-dependent bounds for linear multi-task learning where a common linear operator is chosen to preprocess data for a vector of task speci...c...
Andreas Maurer
NIPS
2008
14 years 11 months ago
Clustered Multi-Task Learning: A Convex Formulation
In multi-task learning several related tasks are considered simultaneously, with the hope that by an appropriate sharing of information across tasks, each task may benefit from th...
Laurent Jacob, Francis Bach, Jean-Philippe Vert
ICML
2009
IEEE
15 years 10 months ago
PAC-Bayesian learning of linear classifiers
We present a general PAC-Bayes theorem from which all known PAC-Bayes risk bounds are obtained as particular cases. We also propose different learning algorithms for finding linea...
Alexandre Lacasse, François Laviolette, Mar...
NIPS
2008
14 years 11 months ago
On the Complexity of Linear Prediction: Risk Bounds, Margin Bounds, and Regularization
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
Sham M. Kakade, Karthik Sridharan, Ambuj Tewari