Papers › Approximation of the Proximal Operator of the ℓ_∞ Norm Using a Neural Network

Approximation of the Proximal Operator of the ℓ_∞ Norm Using a Neural Network

20 Aug 2024arXiv:2408.11211archive 2025-07-28

Kathryn Linehan, Radu Balan

Computing the proximal operator of the ℓ_∞ norm, prox_(α||·||_∞)(𝐱), generally requires a sort of the input data, or at least a partial sort similar to quicksort. In order to avoid using a sort, we present an O(m) approximation of prox_(α||·||_∞)(𝐱) using a neural network. A novel aspect of the network is that it is able to accept vectors of varying lengths due to a feature selection process that uses moments of the input data. We present results on the accuracy of the approximation, feature importance, and computational efficiency of the approach. We show that the network outperforms a "vanilla neural network" that does not use feature selection. We also present an algorithm with corresponding theory to calculate prox_(α||·||_∞)(𝐱) exactly, relate it to the Moreau decomposition, and compare its computational efficiency to that of the approximation.

PaperPDFCode

Code

klinehan1/prox_op_nn officialmentioned in paper report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Computational EfficiencyFeature Importancefeature selection

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Feature Selection

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections