A tree search approach to sparse coding

  • Authors:

  • Rui Rei;João P. Pedroso;Hideitsu Hino;Noboru Murata

  • Affiliations:

  • Faculty of Science, University of Porto, Porto, Portugal,INESC Porto, Porto, Portugal;Faculty of Science, University of Porto, Porto, Portugal,INESC Porto, Porto, Portugal;School of Science and Engineering, Waseda University, Tokyo, Japan;School of Science and Engineering, Waseda University, Tokyo, Japan

  • Venue:
  • LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.