Related papers: Approximation schemes satisfying Shapiro's Theorem
We extend the framework of quantum pushforward designs to the approximate setting, where averaging is achieved only up to finite precision. Using Schatten $p$-norms and Lipschitz continuity arguments, we derive bounds on the approximation…
The notion of best approximation mapping (BAM) with respect to a closed affine subspace in finite-dimensional space was introduced by Behling, Bello Cruz and Santos to show the linear convergence of the block-wise circumcentered-reflection…
We introduce the notion of an approximation system as a generalization of Taylor approximation, and we give some first examples. Next we develop the general theory, including error bounds and a sufficient criterion for convergence. More…
In this paper we describe a general, computationally feasible strategy to deduce a family of interpolatory non-stationary subdivision schemes from a symmetric non-stationary, non-interpolatory one satisfying quite mild assumptions. To…
It is folklore that the sum of two $M$-ideals (semi $M$-ideals) is also an $M$-ideal (a semi $M$-ideal). Numerous authors have attempted to investigate such properties of subspaces. This article explores two important facets of…
The Schmidt Subspace Theorem affirms that the solutions of some particular system of diophantine approximations in projective spaces accumulates on a finite number of proper linear subspaces. Given a subvariety $X$ of a projective space…
A common problem in applied mathematics is to find a function in a Hilbert space with prescribed best approximations from a finite number of closed vector subspaces. In the present paper we study the question of the existence of solutions…
An adjacency sketching or implicit labeling scheme for a family $\cal F$ of graphs is a method that defines for any $n$ vertex $G \in \cal F$ an assignment of labels to each vertex in $G$, so that the labels of two vertices tell you whether…
We show that norms on certain Banach spaces $X$ can be approximated uniformly, and with arbitrary precision, on bounded subsets of $X$ by $C^{\infty}$ smooth norms and polyhedral norms. In particular, we show that this holds for any…
We investigate the classes of functions whose minimization diagrams can be approximated efficiently in \Re^d. We present a general framework and a data-structure that can be used to approximate the minimization diagram of such functions.…
We consider uncountable almost disjoint families of subsets of $\mathbb N$, the Johnson-Lindenstrauss Banach spaces $(\mathcal X_{\mathcal A}, \|\ \|_\infty)$ induced by them, and their natural equivalent renormings $(\mathcal X_{\mathcal…
This paper focuses on the best approximation in quasi-cone metric spaces, a combination of quasi-metrics and cone metrics, which generalizes the notion of distance by allowing it to take values in an ordered Banach space. We explore the…
Subdivision schemes are iterative methods for the design of smooth curves and surfaces. Any linear subdivision scheme can be identified by a sequence of Laurent polynomials, also called subdivision symbols, which describe the linear rules…
Approximate Bayesian computation (ABC) is a widely used inference method in Bayesian statistics to bypass the point-wise computation of the likelihood. In this paper we develop theoretical bounds for the distance between the statistics used…
In this paper, a sample-based procedure for obtaining simple and computable approximations of chance-constrained sets is proposed. The procedure allows to control the complexity of the approximating set, by defining families of…
This paper deals with the following question: Suppose that there exist an integer or a non-negative integer solution $x$ to a system $Ax = b$, where the number of non-zero components of $x$ is $n$. The target is, for a given natural number…
In this survey we present the relatively new concept of \emph{approximable triangulated categories.} We will show that the definition is natural, that it leads to powerful new results, and that it throws new light on old, familiar objects.…
This paper analyzes the convergence for a large class of Riemannian stochastic approximation (SA) schemes, which aim at tackling stochastic optimization problems. In particular, the recursions we study use either the exponential map of the…
Let $S$ be a base scheme, assumed separated and Noetherian. We define \emph{adequate classes} of morphisms of $S$-schemes by formalizing certain properties of homotopy equivalences of complex algebraic varieties. Other examples of adequate…
A Boolean maximum constraint satisfaction problem, Max-CSP($f$), is specified by a predicate $f:\{-1,1\}^k\to\{0,1\}$. An $n$-variable instance of Max-CSP($f$) consists of a list of constraints, each of which applies $f$ to $k$ distinct…