title: Task-driven dictionary learning.
abstract: Modeling data with linear combinations of a few elements from a learned dictionary has been the focus of much recent research in machine learning, neuroscience, and signal processing. For signals such as natural images that admit such sparse representations, it is now well established that these models are well suited to restoration tasks. In this context, learning the dictionary amounts to solving a large-scale matrix factorization problem, which can be done efficiently with classical optimization tools. The same approach has also been used for learning features from data for other purposes, e.g., image classification, but tuning the dictionary in a supervised way for these tasks has proven to be more difficult. In this paper, we present a general formulation for supervised dictionary learning adapted to a wide variety of tasks, and present an efficient algorithm for solving the corresponding optimization problem. Experiments on handwritten digit classification, digital art identification, nonlinear inverse image problems, and compressed sensing demonstrate that our approach is effective in large-scale settings, and is well suited to supervised and semi-supervised classification, as well as regression tasks for data that admit sparse representations.
authors.affiliation: Department of Statistics, University of California, 301 Evans Hall, Berkeley, CA 94720-3860, USA. julien@stat.berkeley.edu
authors.forename: Julien
authors.initials: J
authors.lastname: Mairal
authors.forename: Francis
authors.initials: F
authors.lastname: Bach
authors.forename: Jean
authors.initials: J
authors.lastname: Ponce
mesh_terms: D000465:Algorithms; D016208:Databases, Factual; D006801:Humans; D010363:Pattern Recognition, Automated / Q000379:methods*