Stone-Weierstrass Research Articles

Nonessentiality of Reservoir's Fading Memory for Universality of Reservoir Computing.

This article describes a novel sufficient condition concerning approximations with reservoir computing (RC). Recently, RC using a physical system as the reservoir has attracted attention. Because many physical systems are modeled as state-space systems, it is necessary to guarantee the approximations given by reservoirs represented as nonlinear state-space systems. There are two problems with existing approaches: a reservoir must have a property called fading memory and must be represented as a set of maps between input and output signals on the bi-infinite-time (BIT) interval. These two conditions are too strict for reservoirs represented as nonlinear state-space systems as they require the reservoir to have a unique equilibrium state for the zero input. This article proposes an approach that employs operators from right-infinite-time (RIT) inputs to RIT outputs. Furthermore, we develop a novel extension of the Stone-Weierstrass theorem to handle discontinuous functions. To apply the extended theorem, we define functionals corresponding to operators and introduce a metric on the domain of the functionals. The resulting sufficient condition does not require the reservoir to have fading memory or continuity with respect to inputs and time. Therefore, our result guarantees the approximations with very common reservoirs and provides a rationale for physical RC. We present an example of a physical reservoir without fading memory. With the example reservoir, the RC model successfully approximates NARMA10, a benchmark task for time series predictions.

Applications of the Stone–Weierstrass theorem in the Calderón problem

We give examples on the use of the Stone–Weierstrass theorem in inverse problems. We show uniqueness in the linearized Calderón problem on holomorphically separable Kähler manifolds and in the Calderón problem for nonlinear equations on conformally transversally anisotropic manifolds. We also study the holomorphic separability condition in terms of plurisubharmonic functions. The Stone–Weierstrass theorem allows us to generalize and simplify earlier results. It also makes it possible to circumvent the use of complex geometrical optics solutions and inversion of explicit transforms in certain cases.

Generalized Choi–Davis–Jensen’s Operator Inequalities and Their Applications

The original Choi–Davis–Jensen’s inequality, known for its extensive applications in various scientific and engineering fields, has inspired researchers to pursue its generalizations. In this study, we extend the Choi–Davis–Jensen’s inequality by introducing a nonlinear map instead of a normalized linear map and generalize the concept of operator convex functions to include any continuous function defined within a compact region. Notably, operators can be matrices with structural symmetry, enhancing the scope and applicability of our results. The Stone–Weierstrass theorem and the Kantorovich function play crucial roles in the formulation and proof of these generalized Choi–Davis–Jensen’s inequalities. Furthermore, we demonstrate an application of this generalized inequality in the context of statistical physics.

The Machado–Bishop theorem in the uniform topology

The Machado–Bishop theorem for weighted vector-valued functions vanishing at infinity has been extensively studied. In this paper, we give an analogue of Machado’s distance formula for bounded weighted vector-valued functions. A number of applications are given; in particular, some types of the Bishop–Stone–Weierstrass theorem for bounded vector-valued continuous spaces in the uniform topology are discussed; the splitting of C(I×J,X⊗Y) as the closure of C(I,X)⊗C(J,Y) in different senses and the extension of continuous vector-valued functions are studied.

On the approximation capability of GNNs in node classification/regression tasks

Graph neural networks (GNNs) are a broad class of connectionist models for graph processing. Recent studies have shown that GNNs can approximate any function on graphs, modulo the equivalence relation on graphs defined by the Weisfeiler–Lehman (WL) test. However, these results suffer from some limitations, both because they were derived using the Stone–Weierstrass theorem—which is existential in nature—and because they assume that the target function to be approximated must be continuous. Furthermore, all current results are dedicated to graph classification/regression tasks, where the GNN must produce a single output for the whole graph, while also node classification/regression problems, in which an output is returned for each node, are very common. In this paper, we propose an alternative way to demonstrate the approximation capability of GNNs that overcomes these limitations. Indeed, we show that GNNs are universal approximators in probability for node classification/regression tasks, as they can approximate any measurable function that satisfies the 1-WL-equivalence on nodes. The proposed theoretical framework allows the approximation of generic discontinuous target functions and also suggests the GNN architecture that can reach a desired approximation. In addition, we provide a bound on the number of the GNN layers required to achieve the desired degree of approximation, namely 2r-1\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$2r-1$$\\end{document}, where r is the maximum number of nodes for the graphs in the domain.

Modeling the measurement accuracy of one-dimensional boundary subsets in digital image correlation

Boundary subsets, which contain unwanted pixels from background image or other regions, generally occur at areas of vital mechanical importance. In this work, we establish a theoretical model characterizing the measurement accuracy of 1-dimensional boundary subsets, which explicitly expresses the retrieved displacement in terms of subset size, invalid pixels, shape function order, and underlying deformation field. Particularly, the transfer function of digital image correlation at boundary subsets is derived and verified, indicating possible amplification of amplitude and the existence of phase shift, which are quite different from standard full square subsets. Finally, the retrieved deformation near boundary is theoretically analyzed, and closed-form formulae are deduced for polynomial underlying displacements in consideration of the Weierstrass approximation theorem. To the author's knowledge, this is the first general mathematical model for boundary subsets, and paves the way for enhanced measurement accuracy.

Primitives of continuous functions via continuous piecewise linear functions

In classical calculus textbooks, the existence of primitive functions of continuous functions is proved by using Riemann integrals. Recently, Patrik Lundström gave a proof via polynomials, based on the Weierstrass approximation theorem. In this note, it is shown that the proof will be easy by using continuous piecewise linear functions.

Depth-based vessel position fixing by means of a neural network

A depth-based vessel position fixing method on the basis of a neural network is proposed. The network takes as an input a sequence of depth values measured by an echo-sounder and predicts vessel latitude and longitude for the moment of the latest depth measurement. The neural network has a fully-connected feedforward architecture with several layers which satisfies conditions of the universal approximation in compliance with the Stone-Weierstrass theorem. The Adamax algorithm for the neural network training with controlling a maximum value of position error at each epoch is implemented. Modeling is conducted with the Python programming language and the Tensorflow library. The model surface of seabed is performed as a second-order polynomial. Training samples on the basis of virtual soundings at the coordinate net knots with the space resolution not worse than one cable are obtained. After samples obtaining the training of the neural network is conducted. A validation set is not used. Several neural networks are trained. They have different number of hidden layers and different number of neurons per each hidden layer. After training the test procedure is performed. Test samples are generated in the assumption that a vessel is moving along meridians which are not used at the stage of the preliminary soundings survey. The cases of mean and random test meridians are considered. The random meridians are obtained with a uniform random number generator. As the result, all the tested neural networks have shown approximately identical navigational accuracy which is close to the accuracy for the training set.

Stone-Weierstrass approximation revisited

The aim of the present article is to extend the Stone-Weierstrass theorem to functions ranging in a lattice normed space and admitting order rather than topological approximation. We proceed with the machinery of Boolean-valued transfer from lattice normed space to normed space.

RESEARCH ON THE K-DIMENSION OF THE SUM OF TWO CONTINUOUS FUNCTIONS AND ITS APPLICATION

In this paper, we have done some research studies on the fractal dimension of the sum of two continuous functions with different [Formula: see text]-dimensions and approximation of [Formula: see text]-dimensional fractal functions. We first investigate the [Formula: see text]-dimension of the linear combination of fractal function whose [Formula: see text]-dimension is [Formula: see text] and the function satisfying Lipschitz condition is still [Formula: see text]-dimensional. Then, based on the research of fractal term and the Weierstrass approximation theorem, an approximation of the [Formula: see text]-dimensional continuous function is given, which is composed of finite triangular series and partial Weierstrass function. In addition, some preliminary results on the approximation of one-dimensional and two-dimensional fractal continuous functions have been given.

The interplay between algebras and lattices: Stone–Weierstrass for illustration

The interplay between algebras and lattices: Stone–Weierstrass for illustration

Automatic reinforcement for robust model‐free neurocontrol of robots without persistent excitation

SummaryModel‐based adaptive control suffers over parametrization from the many adaptive parameters compared to the order of system dynamics, leading to sluggish tracking with a poor adaptation transient without robustness. Likewise, adaptive model‐free neurocontrol that relies on the Stone–Weierstrass theorem also suffers from similar problems in addition to over‐fitting to approximate inverse dynamics. This article proposes a novel reinforced adaptive mechanism to guarantee a transient and robustness for the model‐free adaptive control of nonlinear Lagrangian systems. Inspired by the symbiosis of Actor‐Critic (AC) architecture and integral sliding modes, the reinforced stage neural network, analogous to the critic, injects excitation signals to reinforce the parametric learning of the adaptive stage neural network, analogous to the actor to improve the approximation of inverse dynamics. The underlying integral sliding surface error drives improved learning onto a low‐dimensional invariant manifold to guarantee local exponential convergence of tracking errors. Lyapunov stability substantiates the robustness with an improved transient response. Our proposal stands for a hybrid approach between AC and neurocontrol, where the reinforced stage does not require a value function nor reward to provide automatic reinforcement to the adaptive stage parametric adaptation. Dynamic simulations are presented for a nonlinear robot manipulator under different conditions.

An application of the Stone-Weierstrass theorem

Let (X, τ) be a topological space, we will denote by |X|,|X|K, |X|τ and |X|δ, the cardinalities of X; the family of compacts in X; the family of closed in X, and the family of Gδ-closed in X, respectively. The purpose of this work is to establish relationships between these four numbers and conditions under which two of them coincide or one of them is ≤ c, where c denotes, as usual, the cardinality of the set of real numbers R. We will use the Stone-Weierstrass theorem to prove that: Let (X, τ) be a compact Hausdorff topological space, then |X|δ ≤ |X|ℵ0

Predicting the Moisture Ratio of a Hami Melon Drying Process Using Image Processing Technology.

For food drying, moisture content and shrinkage are vital in the drying process. This paper is concerned with the moisture ratio modeling and prediction issues of the Hami melon drying process. First, an experimental system was developed; it included an adjustable-power microwave drying unit and an image-processing unit. The moisture contents and the areas of Hami melon slices at different times were sampled in real time. Then, the expression of the moisture ratio with regard to shrinkage was derived by using the Weierstrass approximation theorem. A maximum likelihood fitness function-based population evolution (MLFF-PE) algorithm was then put forward to fit the moisture ratio model and predict the moisture ratio. The results showed that the proposed MLFF-PE algorithm was effective at fitting and predicting the moisture ratio model of the drying process of Hami melon slices.

General function approximation of a class of cascade chaotic fuzzy systems

This paper presents an innovative architecture called cascade chaotic fuzzy system (CCFS) for the function approximation and chaotic modeling. The proposed model can dominate complications in the type-2 fuzzy systems and increase the chaotic performance of a whole framework. The proposed cascade structure is based on combining two or more one-dimensional chaotic maps. The combination provides a new chaotic map with more high nonlinearity than its grain maps. The fusion of cascade chaotic structure into the neurons of the membership layer of a conventional fuzzy system makes the CCFS more capable of confronting nonlinear problems. Based on the General Function Approximation and Stone-Weierstrass theorem, we show that the proposed model has the function approximation property. By analyzing the bifurcation diagram and applying the CCFS to the problem of chaotic modeling, the new model is investigated. Simulation results and analysis are demonstrated to illustrate the concept of general function approximation.

Inference and analysis of a new evidential reasoning rule-based performance evaluation model

In the current studies on the evidential reasoning (ER) rule, a performance evaluation model that utilizes the ER rule to combine evidence constituted by a single observation indicator (Single indicator-based ER rule, SER) has been developed with excellent scalability. However, the belief distribution (BD) of SER-based evaluation model is composed of a set of single grades that describe the system performance and the corresponding belief degrees. This makes some common uncertain judgments with local ignorance unable to be considered in the inference process, resulting in a decrease in the accuracy and validity of the evaluation results. In this paper, a new SER-based performance evaluation model with extended BD is proposed. Firstly, on the basis of the existing BD in SER, some new elements capable of describing local ignorance are introduced. Secondly, by calculating and optimizing the relevant parameters, the new evaluation model is formed. Thirdly, according to the Stone–Weierstrass theorem and information entropy theory, the approximation ability and uncertainty of the evaluation model are discussed respectively. Finally, a practical example is given to illustrate the potential applications of the proposed model in engineering practice.

Perfect JC-algebras

Perfect C∗-algebras were introduced by Akeman and Shultz in [Perfect C*-algebras, Mem. Amer. Math. Soc. 55(326) (1985)] and they form a certain subclass of C*-algebras determined by their pure states, and for which the general Stone–Weierstrass conjecture is true. In this paper, we introduce the notion of perfect JC-algebras, and we use the strong relationship between a JC-algebra A and its universal enveloping C∗-algebra [Formula: see text], to establish that if [Formula: see text] is perfect and A is of complex type, then A is perfect. It is also shown that every scattered JC-algebra of complex type is perfect, and the same conclusion holds for every JC-algebra of complex type whose primitive spectrum is Hausdorff.

Primitives of continuous functions via polynomials

In standard books on calculus the existence of primitive functions of continuous functions is proved, in one way or another, using Riemann sums. In this note we present a completely different self-contained, however probably folkloristic, proof of this existence. Our proof combines, on the one hand, the so-called Stone Weierstrass theorem on uniform approximation of continuous functions on the unit interval by polynomials, and, on the other hand, a classical result from calculus on the existence of limits of differentiated sequences of functions. The sought for primitive is then constructed as the limit of primitives of the polynomials approximating the original function.

A T-S Fuzzy Quaternion-Value Neural Network-Based Data-Driven Generalized Predictive Control Scheme for Mecanum Mobile Robot

Four-mecanum-wheeled omnidirectional mobile robots (FMOMR) are widely used in many practical scenarios because of their high mobility and flexibility. However, the performance of trajectory tracking would be degenerated largely due to various reasons. To deal with this issue, this paper proposes a data-driven algorithm by using the T-S fuzzy quaternion-value neural network (TSFQVNN). TSFQVNN is tailored to obtain the controlled autoregressive integral moving average (CARIMA) model, and then the generalized predictive controller (GPC) is designed based on the CARIMA model. In this way, the spatial relationship between the three-dimensional pose coordinates can be preserved and training times can be reduced. Furthermore, the convergence of the proposed algorithm is verified by the Stone–Weierstrass theorem, and the convergence conditions of the algorithm are discussed. Finally, the proposed control scheme is applied to the three-dimensional (3D) trajectory tracking problem on the arc surface, and the simulation results prove the necessity and feasibility of the algorithm.

NCFS: new chaotic fuzzy system as a general function approximator

Conventional fuzzy systems (type-1 and type-2) are universal approximators. The goal of this paper is to design and implement a new chaotic fuzzy system (NCFS) based on the Lee oscillator for function approximation and chaotic modelling. NCFS incorporates fuzzy reasoning of the fuzzy systems, self-adaptation of the neural networks, and chaotic signal generation in a unique structure. These features enable the structure to handle uncertainties by generating new information or by chaotic search among prior knowledge. The fusion of chaotic structure into the neurons of the membership layer of a conventional fuzzy system makes the NCFS more capable of confronting nonlinear problems. Based on the GFA and Stone-Weierstrass theorems, we show that the proposed model has the function approximation property. The NCFS performance is investigated by applying it to the problem of chaotic modelling. Simulation results are demonstrated to illustrate the concept of function approximation.