{'fraction_non_alphanumeric': 0.016183986371379896, 'fraction_numerical': 0.0, 'mean_word_length': 5.420765027322404, '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}}
An approximate solution to optimal L/sub p/ state estimation problems

We consider optimal estimation problems characterized by a state vector with i) dynamics described via a differential equation with Lipschitz nonlinearities, ii) partial information provided via a Lipschitz nonlinear mapping, and iii) an L/sub p/ norm measure of the estimation error to be minimized. An approximate solution of such optimal estimation problem is searched for by restricting the optimization to parameterized nonlinear approximators such as feedforward neural networks. The parameters of a feedforward neural network are the neural weights. This approach entails a constrained nonlinear programming problem, whose constraints are given by the dynamic and measurement equations, and the conditions guaranteeing the stability of the estimation error. To optimize the parameters values of neural networks, an algorithm is developed that is based on appropriate sampling of the state and error spaces. Choices of the sample points are devised based on the notion of dispersion, which allow one to obtain an approximate solution of the optimal estimation problem by a small sample complexity.