Least-Squares Linear Dilation-Erosion Regressor Trained using a Convex-Concave Procedure
Not on the map. Why?
Abstract (arXiv)
This paper presents a hybrid morphological neural network for regression tasks called linear dilation-erosion regressor (ℓ-DER). An ℓ-DER is given by a convex combination of the composition of linear and morphological operators. They yield continuous piecewise linear functions and, thus, are universal approximators. Besides introducing the ℓ-DER model, we formulate their training as a difference of convex (DC) programming problem. Precisely, an ℓ-DER is trained by minimizing the least-squares using the convex-concave procedure (CCP). Computational experiments using several regression tasks confirm the efficacy of the proposed regressor, outperforming other hybrid morphological models and state-of-the-art approaches such as the multilayer perceptron network and the radial-basis support vector regressor.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 7 of its 36 references that are in the map. First posted on arXiv 12 Jul 2021.
Builds on
7 of 36 references.
References · 7
- 2016CVXPY: A Python-Embedded Modeling Language for Convex Optimizationcited by 633
- 2013Maxout Networkscited by 186
- 2017PMLB: A Large Benchmark Suite for Machine Learning Evaluation and Comparisoncited by 139
- 2016Disciplined Convex-Concave Programmingcited by 29
- 2019Morphological Network: How Far Can We Go with Morphological Neurons?cited by 10
- 2020Reduced Dilation-Erosion Perceptron for Binary Classificationcited by 7
- 2020Linear Dilation-Erosion Perceptron Trained Using a Convex-Concave Procedurecited by 3
Built on by
Not cited yet.