Related papers: Restricted non-linear approximation in sequence sp…
In this paper, we study limiting embeddings of Besov-type and Triebel-Lizorkin-type spaces, $id_\tau: B_{p_1,q_1}^{s_1,\tau_1}(\Omega) \rightarrow B_{p_2,q_2}^{s_2,\tau_2}(\Omega)$ and $id_\tau : F_{p_1,q_1}^{s_1,\tau_1}(\Omega) \rightarrow…
We consider density estimation for Besov spaces when each sample is quantized to only a limited number of bits. We provide a noninteractive adaptive estimator that exploits the sparsity of wavelet bases, along with a simulate-and-infer…
We study some known approximation properties and introduce and investigate several new approximation properties, closely connected with different quasi-normed tensor products. These are the properties like the $AP_s$ or $AP_{(s,w)}$ for…
Linear processes are defined as a discrete-time convolution between a kernel and an infinite sequence of i.i.d. random variables. We modify this convolution by introducing decimation, that is, by stretching time accordingly. We then…
We give a complete characterization of limiting interpolation spa\-ces for the real method of interpolation using extrapolation theory. For this purpose the usual tools (e.g., Boyd indices or the boundedness of Hardy type operators) are not…
The linear algorithm of the Wiener filter and constrained realizations (CRs) of Gaussian random fields is extended here to perform non-linear CRs. The procedure consists of: (1) Using low resolution data to constrain a high resolution…
In our companion paper (S.N. Chandler Wilde, D.P. Hewett, A. Moiola, Sobolev spaces on non-Lipschitz subsets of $\mathbb{R}^n$ with application to boundary integral equations on fractal screens, 2016) we studied a number of different…
Polynomial approximations to boolean functions have led to many positive results in computer science. In particular, polynomial approximations to the sign function underly algorithms for agnostically learning halfspaces, as well as…
Mlaiki et al.\cite{MLA} introduced the idea of controlled metric type spaces, which is a new extension of $b$-metric spaces with addition of a controlled function $\alpha(x,y)$ of the right-hand side of the $b$-triangle inequality. Phu…
The aim of this paper is twofold: In the first part, we leverage recent results on scenario design to develop randomized algorithmsfor approximating the image set of a nonlinear mapping, that is, a (possibly noisy) mapping of a set via a…
While many approaches exist in the literature to learn low-dimensional representations for data collections in multiple modalities, the generalizability of multi-modal nonlinear embeddings to previously unseen data is a rather overlooked…
We consider a framework for the construction of iterative schemes for operator equations that combine low-rank approximation in tensor formats and adaptive approximation in a basis. Under fairly general assumptions, we obtain a rigorous…
Restriction is a natural quasi-order on $d$-way tensors. We establish a remarkable aspect of this quasi-order in the case of tensors over a fixed finite field -- namely, that it is a well-quasi-order: it admits no infinite antichains and no…
We address the problem of the best uniform approximation by linear combinations of a finite system of functions. If the system is Chebyshev and the problem is unconstrained, then the classical Remez algorithm provides a fast and precise…
If $\omega_t > \beta$ for every $t \in \mathbb{N}$ and for some $\beta > 0$, then the sequence $\{\omega_t\}_{t \in \mathbb{N}}$ represents a weighted sequence of real numbers. In this article, we primarily introduce the concepts of rough…
We study high-dimensional nonlinear approximation of functions in H\"older-Nikol'skii spaces $H^\alpha_\infty(\mathbb{I}^d)$ on the unit cube $\mathbb{I}^d:=[0,1]^d$ having mixed smoothness, by parametric manifolds. The approximation error…
In this work, we Extend Pawlak approximation spaces by topological spaces. Also, Rough Membership, equality and inclusion relations are extended using topological near open sets. In addition, new extended measures of accuracy and quality of…
We consider a family of linear systems $A_\mu \alpha=C$ with system matrix $A_\mu$ depending on a parameter $\mu$ and for simplicity parameter-independent right-hand side $C$. These linear systems typically result from the…
Given the widespread use of lossless compression algorithms to approximate algorithmic (Kolmogorov-Chaitin) complexity, and that lossless compression algorithms fall short at characterizing patterns other than statistical ones not different…
In the setting of CAT(k) spaces, common fixed point iterations built from prox mappings (e.g. prox-prox, Krasnoselsky-Mann relaxations, nonlinear projected-gradients) converge locally linearly under the assumption of linear metric…