A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Dedicated to Vladimir Vapnik with esteem and gratitude for his fundamental contribution to Machine Learning. Abstract During the past years there has been an explosion of interest in learning method based on sparsity regularization. In this paper, we discuss a general class of such methods, in which the regularizer can be expressed as the composition of a convex function ω with a linear function. This setting includes several methods such the group Lasso, the Fused Lasso, multi-task learningdoi:10.1007/978-3-642-41136-6_18 dblp:conf/birthday/ArgyriouBMP13 fatcat:jzkct264jfb5tc33zgwyhyvbra