Log-Sum-Exp Neural Networks and Posynomial Models for Convex and Log-Log-Convex Data

In this paper, we show that a one-layer feedforward neural network with exponential activation functions in the inner layer and logarithmic activation in the output neuron is a universal approximator of convex functions. Such a network represents a family of scaled log-sum exponential functions, here named log-sum-exp ( $mathrm {LSE}_{T}$ ). Under a suitable exponential transformation, the class of $mathrm {LSE}_{T}$ functions maps to a family of generalized posynomials $mathrm {GPOS}_{T}$ , which we similarly show to be universal approximators for log-log-convex functions. A key feature of an $mathrm {LSE}_{T}$ network is that, once it is trained on data, the resulting model is convex in the variables, which makes it readily amenable to efficient design based on convex optimization. Similarly, once a $mathrm {GPOS}_{T}$ model is trained on data, it yields a posynomial model that can be efficiently optimized with respect to its variables by using geometric programming (GP). The proposed methodology is illustrated by two numerical examples, in which, first, models are constructed from simulation data of the two physical processes (namely, the level of vibration in a vehicle suspension system, and the peak power generated by the combustion of propane), and then optimization-based design is performed on these models.