University of Cambridge > Talks.cam > Machine Learning Reading Group @ CUED > Sparsity: Beyond L1

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Sparsity: Beyond L1

Download to your calendar using vCal

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 lists

The Parlour, Peterhouse Castleraegh Room, Fisher Building, St John’s College, Cambridge, CB2 1TP In person - Panton Arms

Other talks

Title to be confirmed Tea and Coffee Break Dinner title abstract tbc The elephant in the room: Machine Learning directly into physical models Fun experiments you can only do with frogs
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity