Certifying function nonnegativity is a ubiquitous problem in computational mathematics, with especially notable applications optimization. We study the question of certifying signomials based on recently proposed approach Sums-of-AM/GM-Exponentials (SAGE) decomposition due to second author and Shah. The existence SAGE sufficient condition for signomial, it can be verified by solving tractable c...

Autoencoders are widely used for dimensionality reduction and feature extraction. The backpropagation algorithm training the parameters of autoencoder model suffers from problems such as slow convergence. Therefore, researchers propose forward propagation algorithms. However, existing algorithms do not consider characteristics data itself. This paper proposes an based on relative entropy constr...