A Universal Approximation Result for Difference of log-sum-exp Neural Networks
Not on the map. Why?
Abstract (arXiv)
We show that a neural network whose output is obtained as the difference of the outputs of two feedforward networks with exponential activation function in the hidden layer and logarithmic activation function in the output node (LSE networks) is a smooth universal approximator of continuous functions over convex, compact sets. By using a logarithmic transform, this class of networks maps to a family of subtraction-free ratios of generalized posynomials, which we also show to be universal approximators of positive functions over log-convex, compact subsets of the positive orthant. The main advantage of Difference-LSE networks with respect to classical feedforward neural networks is that, after a standard training phase, they provide surrogate models for design that possess a specific difference-of-convex-functions form, which makes them optimizable via relatively efficient numerical methods. In particular, by adapting an existing difference-of-convex algorithm to these models, we obtain an algorithm for performing effective optimization-based design. We illustrate the proposed approach by applying it to data-driven design of a diet for a patient with type-2 diabetes.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 21 May 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 4; 2024: 2.
9 papers.
- 2021Min-Max-Plus Neural Networkscited by 8
- 2023Partial Identification of Causal Effects Using Proxy Variablescited by 7
- 2024A Margin-Maximizing Fine-Grained Ensemble Methodcited by 6
- 2022Parameterized Convex Universal Approximators for Decision-Making Problemscited by 4
- 2024Achieving More with Less: A Tensor-Optimization-Powered Ensemble Methodcited by 4
- 2023Revisiting Tropical Polynomial Division: Theory, Algorithms and Application to Neural Networkscited by 2
- 2021SPINE: Soft Piecewise Interpretable Neural Equationscited by 0
- 2023A Framework for Analyzing Cross-correlators using Price's Theorem and Piecewise-Linear Decompositioncited by 0
- 2023Parameterized Convex Minorant for Objective Function Approximation in Amortized Optimizationcited by 0
- 2024A Margin-Maximizing Fine-Grained Ensemble Method19 Sep 2024
- 2024Achieving More with Less: A Tensor-Optimization-Powered Ensemble Method6 Aug 2024
- 2023Parameterized Convex Minorant for Objective Function Approximation in Amortized Optimization4 Oct 2023
- 2023Revisiting Tropical Polynomial Division: Theory, Algorithms and Application to Neural Networks27 Jun 2023
- 2023A Framework for Analyzing Cross-correlators using Price's Theorem and Piecewise-Linear Decomposition18 Apr 2023
- 2023Partial Identification of Causal Effects Using Proxy Variables10 Apr 2023
- 2022Parameterized Convex Universal Approximators for Decision-Making Problems17 Jan 2022
- 2021SPINE: Soft Piecewise Interpretable Neural Equations20 Nov 2021
- 2021Min-Max-Plus Neural Networks12 Feb 2021