English
Related papers

Related papers: Approximation schemes satisfying Shapiro's Theorem

200 papers

In this paper, we introduce the category of blueprints, which is a category of algebraic objects that include both commutative (semi)rings and commutative monoids. This generalization allows a simultaneous treatment of ideals resp.\…

Algebraic Geometry · Mathematics 2012-01-09 Oliver Lorscheid

This paper studies fixed step-size stochastic approximation (SA) schemes, including stochastic gradient schemes, in a Riemannian framework. It is motivated by several applications, where geodesics can be computed explicitly, and their use…

Machine Learning · Statistics 2021-02-22 Alain Durmus , Pablo Jiménez , Éric Moulines , Salem Said

B\'ezier simplex fitting algorithms have been recently proposed to approximate the Pareto set/front of multi-objective continuous optimization problems. These new methods have shown to be successful at approximating various shapes of Pareto…

Machine Learning · Computer Science 2021-04-14 Akinori Tanaka , Akiyoshi Sannai , Ken Kobayashi , Naoki Hamada

In this paper, we revisit the old problem of compact finite difference approximations of the homogeneous Dirichlet problem in dimension 1. We design a large and natural set of schemes of arbitrary high order, and we equip this set with an…

Numerical Analysis · Mathematics 2017-10-10 Joackim Bernier

It is known that any separable Banach space with BAP is a complemented subspace of a Banach space with a basis. We show that every operator with bounded approximation property, acting from a separable Banach space, can be factored through a…

Functional Analysis · Mathematics 2013-12-10 Oleg Reinov

A reasonably complete theory of the approximation of an irrational by rational fractions whose numerators and denominators lie in prescribed arithmetic progressions is developed in this paper. Results are both, on the one hand, from a…

Number Theory · Mathematics 2014-08-27 Faustin Adiceam

Laplace's method approximates a target density with a Gaussian distribution at its mode. It is computationally efficient and asymptotically exact for Bayesian inference due to the Bernstein-von Mises theorem, but for complex targets and…

Machine Learning · Computer Science 2026-03-12 Hanlin Yu , Marcelo Hartmann , Bernardo Williams , Mark Girolami , Arto Klami

We characterize the class of separable Banach spaces $X$ such that for every continuous function $f:X\to\mathbb{R}$ and for every continuous function $\epsilon:X\to\mathbb(0,+\infty)$ there exists a $C^1$ smooth function $g:X\to\mathbb{R}$…

Functional Analysis · Mathematics 2007-05-23 D. Azagra , M. Jimenez-Sevilla

We survey key techniques and results from approximation theory in the context of uniform approximations to real functions such as e^{-x}, 1/x, and x^k. We then present a selection of results demonstrating how such approximations can be used…

Data Structures and Algorithms · Computer Science 2013-09-20 Sushant Sachdeva , Nisheeth Vishnoi

Recently, a framework for the approximation of the entire set of $\epsilon$-efficient solutions (denote by $E_\epsilon$) of a multi-objective optimization problem with stochastic search algorithms has been proposed. It was proven that such…

Numerical Analysis · Computer Science 2008-12-18 Oliver Schuetze , Carlos A. Coello Coello , Emilia Tantar , El-Ghazali Talbi

We present a sufficient condition for a Banach space to have the approximate hyperplane series property (AHSP) which actually covers all known examples. We use this property to get a stability result to vector-valued spaces of integrable…

Functional Analysis · Mathematics 2017-04-25 Yun Sung Choi , Sun Kwang Kim , Han Ju Lee , Miguel Martín

Let $X$ be a weakly pseudoconvex manifold and $L\longrightarrow X$ be a holomorphic line bundle with a singular positive Hermitian metric $h$. In this article, we provide a points separation theorem and an embedding for the adjoint linear…

Complex Variables · Mathematics 2025-12-16 Yuta Watanabe

The Shannon sampling theorem for bandlimited wide sense stationary random processes was established in 1957, which and its extensions to various random processes have been widely studied since then. However, truncation of the Shannon series…

Functional Analysis · Mathematics 2014-01-21 Wenjian Chen , Haizhang Zhang

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…

Complex Variables · Mathematics 2008-03-11 Vladimir Andrievskii

We study critera for a pair $ (\{ X_n \} $, $ \{ Y_n \}) $ of approximating processes which guarantee closeness of moments by generalizing known results for the special case that $ Y_n = Y $ for all $n$ and $ X_n $ converges to $Y$ in…

Machine Learning · Statistics 2018-05-01 Ansgar Steland

Is there any theoretical guarantee for the approximation ability of neural networks? The answer to this question is the "Universal Approximation Theorem for Neural Networks". This theorem states that a neural network is dense in a certain…

Machine Learning · Computer Science 2021-02-23 Takato Nishijima

We propose a distributed version of a stochastic approximation scheme constrained to remain in the intersection of a finite family of convex sets. The projection to the intersection of these sets is also computed in a distributed manner and…

Systems and Control · Computer Science 2017-08-29 Suhail M. Shah , Vivek S. Borkar

Definition. A symmetric with respect to 0 bounded closed convex set A in a finite dimensional normed space X is called a sufficient enlargement for X (or of B(X)) if for arbitrary isometric embedding of X into a Banach space Y there exists…

Functional Analysis · Mathematics 2007-05-23 M. I. Ostrovskii

We devise a generalization of tree approximation that generates conforming meshes, i.e., meshes with a particular structure like edge-to-edge triangulations. A key feature of this generalization is that the choices of the cells to be…

Numerical Analysis · Mathematics 2023-01-26 Peter Binev , Francesca Fierro , Andreas Veeser

A subset A of {0,1,...,n} is said to be a 2-additive basis for {1,2,...,n} if each j in {1,2,...,n} can be written as j=x+y, x,y in A, x<=y. If we pick each integer in {0,1,...,n} independently with probability p=p_n tending to 0, thus…

Combinatorics · Mathematics 2012-04-11 Anant Godbole , Chang Mou Lim , Vince Lyzinski , Nicholas Triantafillou