English
Related papers

Related papers: Asymptotic analysis of average case approximation …

200 papers

Let $X,X_1,X_2,\ldots$ be i.i.d. ${\mathbb{R}}^d$-valued real random vectors. Assume that ${\mathbf{E}X=0}$, $\operatorname {cov}X=\mathbb{C}$, $\mathbf{E}\Vert X\Vert^2=\sigma ^2$ and that $X$ is not concentrated in a proper subspace of…

Probability · Mathematics 2014-01-15 Friedrich Götze , Andrei Yu. Zaitsev

We are interested in approximation of a multivariate function $f(x_1,\dots,x_d)$ by linear combinations of products $u^1(x_1)\cdots u^d(x_d)$ of univariate functions $u^i(x_i)$, $i=1,\dots,d$. In the case $d=2$ it is a classical problem of…

Machine Learning · Statistics 2014-09-05 D. Bazarkhanov , V. Temlyakov

In this thesis we study adaptive nonparametric regression with noise misspecification and the complexity of approximation of random fields in dependence of the dimension. First, we consider the problem of pointwise estimation in…

Statistics Theory · Mathematics 2012-08-15 Nora Serdyukova

Let $X, X_1, X_2,...$ be a sequence of non-degenerate i.i.d. random variables with mean zero. The best possible weighted approximations are investigated in $D[0, 1]$ for the partial sum processes $\{S_{[nt]}, 0\le t\le 1\}$, where…

Probability · Mathematics 2007-11-12 Miklós Csörgő , Barbara Szyszkowicz , Qiying Wang

In this work we discuss the problem of selecting suitable approximators from families of parameterized elementary functions that are known to be dense in a Hilbert space of functions. We consider and analyze published procedures, both…

Numerical Analysis · Computer Science 2016-09-01 Alexander N. Gorban , Ivan Yu. Tyukin , Danil V. Prokhorov , Konstantin I. Sofeikov

We consider the problem of inference for projection parameters in linear regression with increasing dimensions. This problem has been studied under a variety of assumptions in the literature. The classical asymptotic normality result for…

Statistics Theory · Mathematics 2024-01-12 Woonyoung Chang , Arun Kumar Kuchibhotla , Alessandro Rinaldo

We consider a general set $\mathcal{X}$ of adapted nonnegative stochastic processes in infinite continuous time. $\mathcal{X}$ is assumed to satisfy mild convexity conditions, but in contrast to earlier papers need not contain a strictly…

Probability · Mathematics 2020-04-17 Dániel Ágoston Bálint

Let f_n denote a kernel density estimator of a continuous density f in d dimensions, bounded and positive. Let \Psi(t) be a positive continuous function such that \|\Psi f^{\beta}\|_{\infty}<\infty for some 0<\beta<1/2. Under natural…

Probability · Mathematics 2016-09-07 Evarist Gine , Vladimir Koltchinskii , Joel Zinn

We analyze the asymptotic behavior of random variables $x(n,x\_0)$ defined by $x(0,x\_0)=x\_0$ and $x(n+1,x\_0)=A(n)x(n,x\_0)$, where $\sAn$ is a stationary and ergodic sequence of random matrices with entries in the semi-ring…

Probability · Mathematics 2007-05-23 Glenn Merlet

In this paper, we investigate effective sketching schemes via sparsification for high dimensional multilinear arrays or tensors. More specifically, we propose a novel tensor sparsification algorithm that retains a subset of the entries of a…

Methodology · Statistics 2017-11-17 Dong Xia , Ming Yuan

Recently the adaption problem of Information-Based Complexity (IBC) for linear problems in the randomized setting was solved in Heinrich (J. Complexity 82, 2024, 101821). Several papers treating further aspects of this problem followed.…

Numerical Analysis · Mathematics 2024-01-26 Stefan Heinrich

This article studies the problem of approximating functions belonging to a Hilbert space $H_d$ with an isotropic or anisotropic Gaussian reproducing kernel, $$ K_d(\bx,\bt) = \exp\left(-\sum_{\ell=1}^d\gamma_\ell^2(x_\ell-t_\ell)^2\right) \…

Numerical Analysis · Mathematics 2015-01-16 Gregory E. Fasshauer , Fred J. Hickernell , Henryk Woźniakowski

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…

Numerical Analysis · Mathematics 2023-01-24 Philipp Trunschke

In this paper, we consider approximating expansions for the distribution of integer valued random variables, in circumstances in which convergence in law cannot be expected. The setting is one in which the simplest approximation to the…

Probability · Mathematics 2009-12-11 A. D. Barbour , E. Kowalski , A. Nikeghbali

We explore the distribution of class numbers $h(d)$ of indefinite binary quadratic forms, for discriminants $d$ such that the corresponding fundamental unit $\varepsilon_d$ is lower than $d^{1/2+\alpha}$, where $0<\alpha<1/2$. To do so we…

Number Theory · Mathematics 2024-08-05 Jérémy Dousselin

In this paper, we find a sample complexity bound for learning a simplex from noisy samples. Assume a dataset of size $n$ is given which includes i.i.d. samples drawn from a uniform distribution over an unknown simplex in $\mathbb{R}^K$,…

Machine Learning · Statistics 2023-05-02 Amir Hossein Saberi , Amir Najafi , Seyed Abolfazl Motahari , Babak H. Khalaj

This paper investigates a class of slow--fast systems of rough partial differential equations defined over a monotone family of interpolation Hilbert spaces. By employing the controlled rough path framework tailored to a monotone family of…

Probability · Mathematics 2025-10-28 Miaomiao Li , Bin Pei , Yong Xu , Xiaole Yue

The regionally proximal relation of order $d$ along arithmetic progressions, namely ${\bf AP}^{[d]}$ for $d\in \N$, is introduced and investigated. It turns out that if $(X,T)$ is a topological dynamical system with ${\bf AP}^{[d]}=\Delta$,…

Dynamical Systems · Mathematics 2019-11-13 Eli Glasner , Wen Huang , Song Shao , Xiangdong Ye

We consider the problem of approximating the product of $n$ expectations with respect to a common probability distribution $\mu$. Such products routinely arise in statistics as values of the likelihood in latent variable models. Motivated…

Computation · Statistics 2017-09-05 Anthony Lee , Simone Tiberi , Giacomo Zanella

We consider the problem of computing the smallest possible distortion for embedding of a given n-point metric space into R^d, where d is fixed (and small). For d=1, it was known that approximating the minimum distortion with a factor better…

Computational Geometry · Computer Science 2009-09-29 Jiri Matousek , Anastasios Sidiropoulos
‹ Prev 1 8 9 10 Next ›