Related papers: Approximation theorems throughout Reverse Mathemat…
We explore the relation between various versions of Ramsey theorem and bounding schemes in model ${N}$ of a fragment of arithmetic $F$. Our goal is to recast, in a different framework, and extend some results of Hirst \cite{Hirst-1987}, see…
We generalize the classical Bernstein theorem concerning the constructive description of classes of functions uniformly continuous on the real line. The approximation of continuous bounded functions by entire functions of exponential type…
In this paper, methods of second order and higher order reverse mathematics are applied to versions of a theorem of Banach that extends the Schroeder-Bernstein theorem. Some additional results address statements in higher order arithmetic…
We survey developments, over the last thirty years, in the theory of Shape Preserving Approximation (SPA) by algebraic polynomials on a finite interval. In this article, "shape" refers to (finitely many changes of) monotonicity, convexity,…
We define tests of boolean functions which distinguish between linear (or quadratic) polynomials, and functions which are very far, in an appropriate sense, from these polynomials. The tests have optimal or nearly optimal trade-offs between…
We establish a general semiparametric Bernstein-von Mises theorem for Bayesian nonparametric priors based on continuous observations in a periodic reversible multidimensional diffusion model. We consider a wide range of functionals…
In this article, we prove approximation theorems in classes of deep and shallow neural networks with analytic activation functions by elementary arguments. We prove for both real and complex networks with non-polynomial activation that the…
A recurrence scheme is defined for the numerical determination of high degree polynomial approximations to functions as, for instance, inverse powers near zero. As an example, polynomials needed in the two-step multi-boson (TSMB) algorithm…
The major goal of this paper is to study the second order frequentist properties of the marginal posterior distribution of the parametric component in semiparametric Bayesian models, in particular, a second order semiparametric…
Let F be a class of functions with the uniqueness property: if a function f in F vanishes on a set of positive measure, then f is the zero function. In many instances, we would like to have a quantitative version of this property, e.g. a…
These series of notes serve as an introduction to some of both the classical and modern techniques in Reifenberg theory. At its heart, Reifenberg theory is about studying general sets or measures which can be, in one sense or another,…
In terms of the best approximations of functions and generalized moduli of smoothness, direct and inverse approximation theorems are proved for Besicovitch almost periodic functions whose Fourier exponent sequences have a single limit point…
We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…
Generalized sampling consists in the recovery of a function $f$, from the samples of the responses of a collection of linear shift-invariant systems to the input $f$. The reconstructed function is typically a member of a finitely generated…
This paper brings a contribution to the Bayesian theory of nonparametric and semiparametric estimation. We are interested in the asymptotic normality of the posterior distribution in Gaussian linear regression models when the number of…
Recursive partitioning methods provide computationally efficient surrogates for the Wasserstein distance, yet their statistical behavior and their resolution in the small-discrepancy regime remain insufficiently understood. We study…
A Bernstein-von Mises theorem is derived for general semiparametric functionals. The result is applied to a variety of semiparametric problems in i.i.d. and non-i.i.d. situations. In particular, new tools are developed to handle…
Inverse Ising inference allows pairwise interactions of complex binary systems to be reconstructed from empirical correlations. Typical estimators used for this inference, such as Pseudo-likelihood maximization (PLM), are biased. Using the…
Bernstein's theorem (also called Hausdorff--Bernstein--Widder theorem) enables the integral representation of a completely monotonic function. We introduce a finite completely monotonic function, which is a completely monotonic function…
We study computational methods for the approximation of special functions recurrent in geometric function theory and quasiconformal mapping theory. The functions studied can be expressed as quotients of complete elliptic integrals and as…