EPFL | Biomedical Imaging Group | Sparsest Univariate

Sparsest Univariate Learning Models Under Lipschitz Constraint

S. Aziznejad, T. Debarre, M. Unser

IEEE Open Journal of Signal Processing, vol. 3, pp. 140-154, March 7, 2022.

Beside the minimization of the prediction error, two of the most desirable properties of a regression scheme are stability and interpretability. Driven by these principles, we propose continuous-domain formulations for one-dimensional regression problems. In our first approach, we use the Lipschitz constant as a regularizer, which results in an implicit tuning of the overall robustness of the learned mapping. In our second approach, we control the Lipschitz constant explicitly using a user-defined upper-bound and make use of a sparsity-promoting regularizer to favor simpler (and, hence, more interpretable) solutions. The theoretical study of the latter formulation is motivated in part by its equivalence, which we prove, with the training of a Lipschitz-constrained two-layer univariate neural network with rectified linear unit (ReLU) activations and weight decay. By proving representer theorems, we show that both problems admit global minimizers that are continuous and piecewise-linear (CPWL) functions. Moreover, we propose efficient algorithms that find the sparsest solution of each problem: the CPWL mapping with the least number of linear regions. Finally, we illustrate numerically the outcome of our formulations.

@ARTICLE(http://bigwww.epfl.ch/publications/aziznejad2202.html,
AUTHOR="Aziznejad, S. and Debarre, T. and Unser, M.",
TITLE="Sparsest Univariate Learning Models Under {L}ipschitz
	Constraint",
JOURNAL="{IEEE} Open Journal of Signal Processing",
YEAR="2022",
volume="3",
number="",
pages="140--154",
month="March 7,",
note="")

© 2022 The Authors. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from The Authors. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.