Home
Publications
Talks
Teaching
Contact
Light
Dark
Automatic
sparsity
Screening Rules for Lasso with Non-Convex Sparse Regularizers
Leveraging on the convexity of the Lasso problem, screening rules help in accelerating solvers by discarding irrelevant variables, …
May 23, 2019 2:30 PM
Slides
Proximal Newton DC programming for non-convex problems
Newton-based method for solving non-convex optimization problems with sparsity constraints.
Sep 25, 2017 10:30 AM
Slides
DC approach for a family of non-convex problems in machine learning
DC approach for solving non-convex problems in machine learning with a focus on non-convex sparsity regularization.
Oct 10, 2014 10:00 AM
Slides
Algorithms for a family of non-convex issues in machine learning
DC approach for solving non-convex problems in machine learning with a focus on non-convex sparsity regularization.
May 31, 2012 10:00 AM
Slides
Multitask learning using Non-convex Sparsity Regularization
Multitask learning using Non-convex Sparsity Regularization with application to BCI
May 26, 2009 2:00 PM
Slides
Regularization frontier in machine learning
Machine Learning algorithms often involve the joint optimization of several objective functions for achieving good generalization …
Sep 19, 2008 2:00 PM
Slides
Cite
×