|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Sparsity: Beyond L1
If you have a question about this talk, please contact Colorado Reed.
The L1 norm is a popular choice of regularizer when learning a mapping from inputs to outputs under a frequentist framework. This norm has the useful property of being convex and promoting sparsity. Sparse solutions are desirable when you believe that only a subset of the input features are required to generate an output e.g. when the input dimension is much larger than the number of data points. A significant body of research is dedicated to studying when such regularizers work and where they do not. These ideas can be extended to group or structured sparsity, which can be used to sparse multi kernel learning and non-linear variable selection. Finally we shall discuss sparse matrices developed by generalizing the L1 norm in particular ways, including sparse PCA and dictionary learning.
This talk is part of the Machine Learning Reading Group @ CUED series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsClare Hall America Week Cavendish Graduate Student Conference 2010 Martin Centre Research Seminar Series - Celebrating the Centenary of the Department of Architecture
Other talksThe Khmer Rouge Tribunal, ‘civil parties’ and the Cambodian diaspora An introduction to Mendelian randomization Being the change: the Aam Aadmi Party and the politics of curative democracy Precautionary Saving and Aggregate Demand The Search for Earth 2.0 Canonical Coordinates from Tropical Curves