A number of our pages use cookies to identify you when you sign-in to our site.
The cookie-related information is fully under our control. These cookies are not used for any purpose other than those described here. Unibo policy
By continuing to browse the site, or by clicking on “close”, you consent to the use of cookies.
The projection onto the $\ell_{1,\infty}$ ball (P$\ell_{1,\infty}$) has been applied in cognitive neuroscience and classification tasks, and it is an example of mixed norms, which recently have gained popularity for inducing group sparsity priors in several applications. We present a new algorithm, eight times faster than the state-of-the-art, to solve P$\ell_{1,\infty}$ for which we have derived an analytical expression that allows us to apply Newton’s root-finding method along with an effective pruning strategy.
This presentation is part of Contributed Presentation “CP1 - Contributed session 1”