Material Detail

Active Set Algorithm for Structured Sparsity-Inducing Norm

Active Set Algorithm for Structured Sparsity-Inducing Norm

This video was recorded at NIPS Workshops, Whistler 2009. We consider the empirical risk minimization problem for linear supervised learning, with regularization by structured sparsity-inducing norms. These are defined as sums of Euclidean norms on certain subsets of variables, extending the usual ℓ1-norm and the group ℓ1-norm by allowing the subsets to overlap. This leads to a specific set of allowed nonzero patterns for the solutions of such problems. We first explore the relationship between the groups defining the norm and the resulting nonzero patterns. In particular, we show how geometrical information about the variables can be encoded by our regularization. We finally present an active set algorithm to efficiently solve the corresponding minimization problem.

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.