Related papers: Approximation complexity of homogeneous sums of ra…

Random feature approximation is arguably one of the most popular techniques to speed up kernel methods in large scale algorithms and provides a theoretical approach to the analysis of deep neural networks. We analyze generalization…

We study average case approximation of Euler and Wiener integrated processes of d variables which are almost surely r_k-times continuously differentiable with respect to the k-th variable. Let n(h,d) denote the minimal number of continuous…

We develop a general approach to Stein's method for approximating a random process in the path space $D([0,T]\to R^d)$ by a real continuous Gaussian process. We then use the approach in the context of processes that have a representation as…

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…

We derive a simple and precise approximation to probability density functions in sampling distributions based on the Fourier cosine series. After clarifying the required conditions, we illustrate the approximation on two examples: the…

We use Stein's method to establish the rates of normal approximation in terms of the total variation distance for a large class of sums of score functions of marked Poisson point processes on $\mathbb{R}^d$. As in the study under the weaker…

Functions on a bounded domain in scientific computing are often approximated using piecewise polynomial approximations on meshes that adapt to the shape of the geometry. We study the problem of function approximation using splines on a…

G. Edelman, O. Sporns, and G. Tononi introduced in theoretical biology the neural complexity of a family of random variables. This functional is a special case of intricacy, i.e., an average of the mutual information of subsystems whose…

Let $W_i=\{W_i(t_i), t_i\in \R_+\}, i=1,2,\ldots,d$ are independent Wiener processes. $W=\{W(\mathbf{t}),t\in \R_+^d\}$ be the additive Wiener field define as the sum of $W_i$. For any trend $f$ in $\kHC$ (the reproducing kernel Hilbert…

We introduce and investigate a new notion of the theory of approximation-the so-called degenerate approximation, i.e. approximation of the function of two (and more) variables (kernel) by means of degenerate function (kernel). We apply…

For positive integers $n$ and $d$, and the probability function $0\leq p(n)\leq 1$, we let $Y_{n,p,d}$ denote the probability space of all at most $d$-dimensional simplicial complexes on $n$ vertices, which contain the full…

This work is motivated by two problems: 1) The approach of manifolds and spaces by triangulations. 2) The complexity growth in sequences of polyhedra. Considering both problems as related, new criteria and methods for approximating smooth…

We consider the problem of approximating a function in a general nonlinear subset of $L^2$, when only a weighted Monte Carlo estimate of the $L^2$-norm can be computed. Of particular interest in this setting is the concept of sample…

We consider the sample complexity of revenue maximization for multiple bidders in unrestricted multi-dimensional settings. Specifically, we study the standard model of $n$ additive bidders whose values for $m$ heterogeneous items are drawn…

We consider the random field M(t)=\sup_{n\geq 1}\big\{-\log A_{n}+X_{n}(t)\big\}\,,\qquad t\in T\, for a set $T\subset \mathbb{R}^{m}$, where $(X_{n})$ is an iid sequence of centered Gaussian random fields on $T$ and $0<A_{1}<A_{2}<\cdots $…

This study investigated typical performance of approximation algorithms known as belief propagation, greedy algorithm, and linear-programming relaxation for maximum coverage problems on sparse biregular random graphs. After using the cavity…

We study structured nonsmooth convex finite-sum optimization that appears widely in machine learning applications, including support vector machines and least absolute deviation. For the primal-dual formulation of this problem, we propose a…

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…

We use Stein's method to obtain bounds on the rate of convergence for a class of statistics in geometric probability obtained as a sum of contributions from Poisson points which are exponentially stabilizing, i.e. locally determined in a…

Let $(\{1,2,\ldots,n\},d)$ be a metric space. We analyze the expected value and the variance of $\sum_{i=1}^{\lfloor n/2\rfloor}\,d({\boldsymbol{\pi}}(2i-1),{\boldsymbol{\pi}}(2i))$ for a uniformly random permutation ${\boldsymbol{\pi}}$ of…