A tree search approach to sparse coding

Rui Rei*, João P. Pedroso, Hideitsu Hino, Noboru Murata

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution


Sparse coding is an important optimization problem with numerous applications. In this paper, we describe the problem and the commonly used pursuit methods, and propose a best-first tree search algorithm employing multiple queues for unexplored tree nodes. We assess the effectiveness of our method in an extensive computational experiment, showing its superiority over other methods even for modest computational time.

Original languageEnglish
Title of host publicationLearning and Intelligent Optimization - 6th International Conference, LION 6, Revised Selected Papers
Number of pages6
Publication statusPublished - 2012
Event6th International Conference on Learning and Intelligent Optimization, LION 6 - Paris, France
Duration: 2012 Jan 162012 Jan 20

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7219 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference6th International Conference on Learning and Intelligent Optimization, LION 6


  • Sparse Coding
  • Tree Search

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'A tree search approach to sparse coding'. Together they form a unique fingerprint.

Cite this