Efficient Projection onto the $\ell_{\infty,1}$ Mixed-Norm Ball using a Newton root search method

TL;DR

This paper introduces a Newton root search algorithm for efficiently projecting onto the _{} mixed-norm ball, significantly accelerating computations in signal processing and machine learning applications.

Contribution

A novel Newton root search method for _{} projection that outperforms existing algorithms in speed, especially for sparse solutions and real fMRI data.

Findings

8-10x faster than previous methods

Up to 20x speedup for sparse solutions

10-100x speed improvements on real fMRI data

Abstract

Mixed norms that promote structured sparsity have numerous applications in signal processing and machine learning problems. In this work, we present a new algorithm, based on a Newton root search technique, for computing the projection onto the $\ell_{\infty,1}$ ball, which has found application in cognitive neuroscience and classification tasks. Numerical simulations show that our proposed method is between 8 and 10 times faster on average, and up to 20 times faster for very sparse solutions, than the previous state of the art. Tests on real functional magnetic resonance image data show that, for some data distributions, our algorithm can obtain speed improvements by a factor of between 10 and 100, depending on the implementation.