Convex multi-task feature learning

Volume: 73, Issue: 3, Pages: 243 - 272
Published: Dec 1, 2008
Abstract
We present a method for learning sparse representations shared across multiple tasks. This method is a generalization of the well-known single-task 1-norm regularization. It is based on a novel non-convex regularizer which controls the number of learned features common across the tasks. We prove that the method is equivalent to solving a convex optimization problem for which there is an iterative algorithm which converges to an optimal solution....
Paper Details
Title
Convex multi-task feature learning
Published Date
Dec 1, 2008
Volume
73
Issue
3
Pages
243 - 272
Citation AnalysisPro
  • Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
  • Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.