Material Detail

Convex Sparse Methods for Feature Hierarchies

Convex Sparse Methods for Feature Hierarchies

This video was recorded at 26th International Conference on Machine Learning (ICML), Montreal 2009. Sparse methods usually deal with the selection of a few elements from a large collection of pre-computed features. While theoretical results suggest that techniques based on the L1-norm can deal with exponentially many irrelevant features, current algorithms cannot handle more than millions of variables. In this talk, I will show how structured norms can deal in polynomial time with exponentially many features that are organized in a directed acyclic graph.
Rate

Quality

  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.