.png){kind=icon}
Return
Parameterized Convex Universal Approximators for Decision-Making Problems
.png){kind=icon}
OA
AI
DOI：10.1109/TNNLS.2022.3190198.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Parameterized max-affine (PMA) and parameterized log-sum-exp (PLSE) networks are proposed for general decision-making problems. The proposed approximators generalize existing convex approximators, namely max-affine (MA) and log-sum-exp (LSE) networks, by considering function arguments of condition and decision variables and replacing the network parameters of MA and LSE networks with continuous functions with respect to the condition variable. The universal approximation theorem (UAT) of PMA and PLSE is proved, which implies that PMA and PLSE are shape-preserving universal approximators for parameterized convex continuous functions. Practical guidelines for incorporating deep neural networks within PMA and PLSE networks are provided. A numerical simulation is performed to demonstrate the performance of the proposed approximators. The simulation results support that PLSE outperforms other existing approximators in terms of a minimizer and optimal value errors with scalable and efficient computation for high-dimensional cases.
Keywords:
Convex functions
Decision making
Aerospace engineering
Shape
Numerical models
Learning systems
Guidelines
Convex optimization
function approxima-tion
parameterized convexity
universal approximation theorem (UAT)
Journal
IF:
8.9
Papers:
7.6K
Citations:
7.2W
Organization
Cited Papers
A Preoperative and Postoperative Study of the Accuracy and Value of Electrodiagnosis in Patients with Lumbosacral Disc Herniation.png)
Spine
SpineIF0
PREAI
ShareSaveShareSaveShareSave
ShareSave
View more