Related papers: Universal approximation by signatures for infinite…

In the present paper we obtain a new homological version of the implicit function theorem and some versions of the Darboux theorem. Such results are proved for continuous maps on topological manifolds. As a consequence, some versions of…

We present an approximation theorem for continuous non-decreasing functions on compact preordered spaces, leading to an algebraic characterization of their corresponding function spaces. As an application, we prove that the family of…

By studying $\mathbb{A}^1$-curves on varieties, we propose a geometric approach to strong approximation problem over function fields of complex curves. We prove that strong approximation holds for smooth, low degree affine complete…

We establish common fixed point theorems for two pairs of weakly compatible self-mappings using an auxiliary function of two variables. Unlike classical results, our theorems do not assume continuity of the mappings and require completeness…

The signature of a $p$-weakly geometric rough path summarises a path up to a generalised notion of reparameterisation. The quotient space of equivalence classes on which the signature is constant yields unparameterised path space. The study…

We study the problem of detecting zeros of continuous functions that are known only up to an error bound, extending the earlier theoretical work with explicit algorithms and experiments with an implementation. More formally, the robustness…

We establish two results concerning a class of geometric rough paths $\mathbf{X}$ which arise as Markov processes associated to uniformly subelliptic Dirichlet forms. The first is a support theorem for $\mathbf{X}$ in $\alpha$-H\"older…

We propose global surjectivity theorems of differentiable maps based on second order conditions. Using the homotopy continuation method, we demonstrate that, for a $C^2$ differentiable map from a Hilbert space to a finite-dimensional…

The capability of recurrent neural networks to approximate trajectories of a random dynamical system, with random inputs, on non-compact domains, and over an indefinite or infinite time horizon is considered. The main result states that…

In this article we develop a general theory of exact parametric penalty functions for constrained optimization problems. The main advantage of the method of parametric penalty functions is the fact that a parametric penalty function can be…

We establish fundamental mathematical limits on universal approximation theorem (UAT) system alignment by proving that catastrophic failures are an inescapable feature of any useful computational system. Our central thesis is that for any…

We consider universal approximations of symmetric and anti-symmetric functions, which are important for applications in quantum physics, as well as other scientific and engineering computations. We give constructive approximations with…

The universal approximation theorem, in one of its most general versions, says that if we consider only continuous activation functions $\sigma$, then a standard feedforward neural network with one hidden layer is able to approximate any…

In this article we study two "strong" topologies for spaces of smooth functions from a finite-dimensional manifold to a (possibly infinite-dimensional) manifold modeled on a locally convex space. Namely, we construct Whitney type topologies…

We display four approximation theorems for manifold-valued mappings. The first one approximates holomorphic embeddings on pseudoconvex domains in $\Bbb C^n$ with holomorphic embeddings with dense images. The second theorem approximates…

By using an explicit ordinary differential equation to approximate the exponential solution flow, we extend the universal limit theorem to rough differential equation in Banach space driven by weak geometric rough path, and give the…

We study rough differential equations driven by controlled rough paths in the level-$2$ regime $1/3<\alpha\le 1/2$. Given a reference rough path $\mathbf X=(1,X,\mathbb X)$ and an $\mathbf X$-controlled driver $\mathbf Z=(Z,Z')$, we first…

We prove a unified and general criterion for the uniqueness of critical points of a functional in the presence of constraints such as positivity, boundedness, or fixed mass. Our method relies on convexity properties along suitable paths and…

We prove some results, which are used in arXiv:1406.7871, about weakly geometric rough paths that are well-known in finite dimensions, but need proof in the infinite dimensional setting.

Let $U\subseteq\mathbb{R}^d$ be open and convex. We prove that every (not necessarily Lipschitz or strongly) convex function $f:U\to\mathbb{R}$ can be approximated by real analytic convex functions, uniformly on all of $U$. We also show…