Fast approximations to structured sparse coding and applications to object classification

Arthur Szlam, Karol Gregor, Yann LeCun

We describe a method for fast approximation of sparse coding. The input space is subdivided by a binary decision tree, and we simultaneously learn a dictionary and assignment of al…