Related papers: Asymptotic analysis of average case approximation …

We study asymptotic expansions in free probability. In a class of classical limit theorems Edgeworth expansion can be obtained via a general approach using sequences of "influence" functions of individual random elements described by…

Error bounds and complexity bounds in numerical analysis and information-based complexity are often proved for functions that are defined on very simple domains, such as a cube, a torus, or a sphere. We study optimal error bounds for the…

We consider random integer partitions $\lambda$ that follow the Poissonized Plancherel measure of parameter $t^2$. Using Riemann$-$Hilbert techniques, we establish the asymptotics of the multiplicative averages $$Q(t,s)=\mathbb{E} \left[…

Let $\mathcal{O}\subset \mathbb{R}^d$ be a bounded domain of class $C^{1,1}$. In $ L_2(\mathcal{O};\mathbb{C}^n)$, we consider a matrix elliptic second order differential operator $A_{D,\varepsilon}$ with the Dirichlet boundary condition.…

We establish higher-order nonasymptotic expansions for a difference between probability distributions of sums of i.i.d. random vectors in a Euclidean space. The derived bounds are uniform over two classes of sets: the set of all Euclidean…

We study the approximation of functions by tensor networks (TNs). We show that Lebesgue $L^p$-spaces in one dimension can be identified with tensor product spaces of arbitrary order through tensorization. We use this tensor product…

Gaussian processes are a powerful class of non-linear models, but have limited applicability for larger datasets due to their high computational complexity. In such cases, approximate methods are required, for example, the recently…

We introduce a machine free mathematical framework to get a natural formalization of some general notions of infinite computation in the context of Kolmogorov complexity. Namely, the classes Max^{X\to D}_{PR} and Max^{X\to D}_{Rec} of…

We establish sufficient conditions for the asymptotic normality of kernel density estimators, applied to causal linear random fields. Our conditions on the coefficients of linear random fields are weaker than known results, although our…

Motivated by the problem of filtering candidate pairs in inner product similarity joins we study the following inner product estimation problem: Given parameters $d\in {\bf N}$, $\alpha>\beta\geq 0$ and unit vectors $x,y\in {\bf R}^{d}$…

We provide new upper and lower bounds on the minimum possible ratio of the spectral and Frobenius norms of a (partially) symmetric tensor. In the particular case of general tensors our result recovers a known upper bound. For symmetric…

We continue the research on the asymptotic and preasymptotic decay of singular numbers for tensor product Hilbert-Sobolev type embeddings in high dimensions with special emphasis on the influence of the underlying dimension $d$. The main…

Let $L$ be the Euclidean functional with $p$-th power-weighted edges. Examples include the sum of the $p$-th power-weighted lengths of the edges in minimal spanning trees, traveling salesman tours, and minimal matchings. Motivated by the…

Recent findings by Jahn, T. Ullrich, Voigtlaender [10] relate non-linear sampling numbers for the square norm to quantities involving trigonometric best $m-$term approximation errors in the uniform norm. Here we establish new results for…

We derive tight non-asymptotic bounds for the Kolmogorov distance between the probabilities of two Gaussian elements to hit a ball in a Hilbert space. The key property of these bounds is that they are dimension-free and depend on the…

Regularized kernel methods such as, e.g., support vector machines and least-squares support vector regression constitute an important class of standard learning algorithms in machine learning. Theoretical investigations concerning…

We consider approximating analytic functions on the interval $[-1,1]$ from their values at a set of $m+1$ equispaced nodes. A result of Platte, Trefethen \& Kuijlaars states that fast and stable approximation from equispaced samples is…

We study the problem nonparametric classification with repeated observations. Let $\bX$ be the $d$ dimensional feature vector and let $Y$ denote the label taking values in $\{1,\dots ,M\}$. In contrast to usual setup with large sample size…

We obtain estimates for the Kolmogorov distance to appropriately chosen gaussians, of linear functions \[ \sum_{i\in [n]^d} \theta_i X_i \] of random tensors $\boldsymbol{X}=\langle X_i:i\in [n]^d\rangle$ which are symmetric and…

In this study, we examine the convergence characteristics of the Max-Product Kantrovich type exponential sampling series within the weighted space of log-uniformly continuous and bounded functions. The research focuses on deriving…