{'fraction_non_alphanumeric': 0.020626432391138275, 'fraction_numerical': 0.0015278838808250573, 'mean_word_length': 4.670995670995671, '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}}
Linear discriminants, logic functions, backpropagation, and improved convergence

A modified learning algorithm for BP (backpropagation) neural networks is presented based on the interpretation of a neuron in an (N+1)-dimensional space, RN+1, and the analysis of how a multilayered network performs a classification task by collective use of the B (boundary) neurons in the first layer. The role of B neurons and L (logic) neurons is discussed. A B neuron represents a linear boundary in the input space RN. An L neuron in the second layer defines in RN a convex piecewise linear boundary that is formed by a set of line segments corresponding to connected B neurons. An L neuron in the third layer defines in RN a complicated boundary that can have both convex parts and concave parts. Each subboundary of it corresponds to an L neuron in the second layer. The nonlinear function does not change the structure of a boundary but smooths the angular vertices of a boundary. It is shown that for the two-class problems with convex boundaries, the nonlinear function in an L neuron can be replaced with a step and the weights of the L neuron can be fixed. Computer simulation shows that this algorithm can learn more quickly than the ordinary BP algorithm, even in cases where the ordinary BP algorithm will fail