{'fraction_non_alphanumeric': 0.018223234624145785, 'fraction_numerical': 0.0, 'mean_word_length': 5.2785714285714285, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Memory Convergence Analysis for Different Iterative Procedures in RNN

Recurrent neural networks (RNN) are a class of densely connected single layer nonlinear networks of perceptrons. The network's energy function is defined through a learning procedure so that its minima coincide with states from a predefined set. . However, because of the network's nonlinearity a number of undesirable local energy minima emerge from the learning procedure. This has shown to significantly effect the network's performance. In this work we analyze the rate of convergence for three iterative procedures namely- Mann, Ishikawa and J-iterations in recurrent network and many important results have been worked out for decreasing as well as increasing functions. The results obtained are very useful for designing of inner product kernel of support vector machine with faster convergence rate.