On the Treatment of Optimization Problems with L1 Penalty Terms via Multiobjective Continuation
Katharina Bieker, Bennet Gebken, Sebastian Peitz

TL;DR
This paper introduces a continuation algorithm for multiobjective optimization involving L1 penalties, providing detailed insights into sparsity effects in linear and nonlinear models, with applications in neural networks and signal processing.
Contribution
It presents a novel continuation method tailored for multiobjective problems with L1 penalties, extending homotopy techniques to nonlinear optimization scenarios.
Findings
The method offers detailed sparsity insights in complex models.
Numerical examples demonstrate the approach's effectiveness.
Application to neural network training shows practical benefits.
Abstract
We present a novel algorithm that allows us to gain detailed insight into the effects of sparsity in linear and nonlinear optimization, which is of great importance in many scientific areas such as image and signal processing, medical imaging, compressed sensing, and machine learning (e.g., for the training of neural networks). Sparsity is an important feature to ensure robustness against noisy data, but also to find models that are interpretable and easy to analyze due to the small number of relevant terms. It is common practice to enforce sparsity by adding the -norm as a weighted penalty term. In order to gain a better understanding and to allow for an informed model selection, we directly solve the corresponding multiobjective optimization problem (MOP) that arises when we minimize the main objective and the -norm simultaneously. As this MOP is in general non-convex…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsLinear Regression
