In this paper, a novel recurrent sigma‒sigma neural network (RSPSNN) that contains the same advantages as the higher-order and recurrent neural networks is proposed. The batch gradient algorithm is used to train the RSPSNN to search for the optimal weights based on the minimal mean squared error (MSE). To substantiate the unique equilibrium state of the RSPSNN, the characteristic of stability convergence is proven, which is one of the most significant indices for reflecting the effectiveness and overcoming the instability problem in the training of this network. Finally, to establish a more precise evaluation of its validity, five empirical experiments are used. The RSPSNN is successfully applied to the function approximation problem, prediction problem, parity problem, classification problem, and image simulation, which verifies its effectiveness and practicability.
With the exponential growth of Internet of Things (IoT) devices in the era of Internet of Everything (IoE), two major issues arise: 1) data processing speed and 2) interpretability in neural networks. Specifically, training neural networks to handle IoE data often results in poor convergence speed, overfitting of the weights, and fluctuations in the error function. To address these challenges, this article introduces a novel neural network, the recurrent sigma-pi-sigma neural network (RSPSNN), trained using a batch gradient algorithm enhanced with smoothing L1 lasso regularization and an adaptive momentum term. This approach not only improves convergence speed but also enhances generalization capabilities and reduces oscillations. Furthermore, the interpretability of RSPSNN is theoretically demonstrated through characteristics of monotonicity, strong/weak convergence, and stability. Finally, the theoretical findings are supported by experiment results in classification, recognition, and prediction tasks.
17 April 2012 in Neural Computing and Applications
In recent years, advanced information communication technology (such as beyond 5G and 6G) will enable convenient end-to-end communication. This would allow collections of individual preferences as predictions of travellers’ perceptions, and thus support data analysis and traffic control in a dynamic circumstance. Therefore, analysis of nonlinearly modelled perceptions and perception-based user equilibrium are the necessary problem we encounter. This research explores the existence characteristics of perception-based stochastic user equilibrium (P-SUE), a type of stochastic user equilibrium where travelers make route choices according to their perceptive traffic circumstances instead of actual ones. A nonlinear perception model with stochasticity is developed and the traffic arrivals are approximately transformed from Poisson-distributed to Normal-distributed. From a static perspective, we develop a P-SUE model with a heterogeneous traveler community and discuss the interaction among travelers’ attitude, grouping and static perception-based stochastic user equilibrium (P-SSUE). After embedding a day-to-day learning process into the P-SSUE model, we further explore evolutionary dynamics of the equilibrium. Several scenarios are provided to investigate effects and sensitivity of traveler-related and road-related factors. It is found that learning produces perturbation and makes the existence condition of P-SSUE more complicated; the convergence processes of P-SSUEs are significantly shortened as the learning rate increases to higher than 0.1.