{'fraction_non_alphanumeric': 0.011920529801324504, 'fraction_numerical': 0.005298013245033113, 'mean_word_length': 5.0, '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}}
Experimental study on the precision requirements of RBF, RPROP and BPTT training

Most neurocomputer architectures support only fixed point arithmetic which allows a higher degree of VLSI integration but limits the range and precision of all variables. Up to now the effect of this limitation on neural network training algorithms has been studied only for standard models like SOM or BP. This paper presents the results of an experimental study in which the precision requirements of three other learning algorithms (RBF, RPROP and BPTT) on exemplary task have been investigated. While the RBF and BPTT key variables required more than 16 bit for training to solve the selected problems, the RPROP algorithm showed good results with far less than 16 bit.