Related papers: Asymptotic analysis of average case approximation …
We analyze the Nystr\"om approximation of a positive definite kernel associated with a probability measure. We first prove an improved error bound for the conventional Nystr\"om approximation with i.i.d. sampling and singular-value…
The density weighted average derivative (DWAD) of a regression function is a canonical parameter of interest in economics. Classical first-order large sample distribution theory for kernel-based DWAD estimators relies on tuning parameter…
We consider approximation problems for tensor product and additive random fields based on standard information in the average case setting. We also study the probabilistic setting of the mentioned problem for tensor products. The main…
In this paper we determine the threshold for collapsibility in the probabilistic model $X_d(n,p)$ of $d$-dimensional simplicial complexes. A lower bound for this threshold $p=\frac{c_d}{n}$ was established in \cite{ALLM}. Here we show that…
The saddlepoint approximation gives an approximation to the density of a random variable in terms of its moment generating function. When the underlying random variable is itself the sum of $n$ unobserved i.i.d. terms, the basic classical…
In multivariate regression estimation, the rate of convergence depends on the dimension of the regressor. This fact, known as the curse of the dimensionality, motivated several works. The additive model, introduced by Stone (10), offers an…
We consider models for molecular sequence evolution in which the transition rates at each site depend on the local sequence context, giving rise to a time-inhomogeneous Markov process in which sites evolve under a complex dependency…
Random feature approximation is arguably one of the most widely used techniques for kernel methods in large-scale learning algorithms. In this work, we analyze the generalization properties of random feature methods, extending previous…
Asymptotic expansions are derived for the tail distribution of the product of two correlated normal random variables with non-zero means and arbitrary variances, and more generally the sum of independent copies of such random variables.…
This paper establishes the Quantum Voronovskaya--Damasclin (QVD) Theorem, providing a complete asymptotic characterization of Quantum Neural Network Operators in the approximation of arbitrary quantum channels. The result extends the…
We study multivariate problems like function approximation, numerical integration, global optimization and dispersion. We obtain new results on the information complexity $n(\varepsilon,d)$ of these problems. The information complexity is…
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.…
The purpose of this paper is to estimate the intensity of a Poisson process $N$ by using thresholding rules. In this paper, the intensity, defined as the derivative of the mean measure of $N$ with respect to $ndx$ where $n$ is a fixed…
LP-type problems such as the Minimum Enclosing Ball (MEB), Linear Support Vector Machine (SVM), Linear Programming (LP), and Semidefinite Programming (SDP) are fundamental combinatorial optimization problems, with many important…
In $M$-estimation under standard asymptotics, the weak convergence combined with the polynomial type large deviation estimate of the associated statistical random field Yoshida (2011) provides us with not only the asymptotic distribution of…
Typical performance of approximation algorithms is studied for randomized minimum vertex cover problems. A wide class of random graph ensembles characterized by an arbitrary degree distribution is discussed with some theoretical frameworks.…
We study the landscape complexity of the Hamiltonian $X_N(x) +\frac\mu2 \|x\|^2,$ where $X_{N}$ is a smooth Gaussian process with isotropic increments on $\mathbb R^{N}$. This model describes a single particle on a random potential in…
For any stationary $\mZ^d$-Gibbs measure that satisfies strong spatial mixing, we obtain sequences of upper and lower approximations that converge to its entropy. In the case, $d=2$, these approximations are efficient in the sense that the…
This paper establishes expectation and variance asymptotics for statistics of the Poisson--Voronoi approximation of general sets, as the underlying intensity of the Poisson point process tends to infinity. Statistics of interest include…
We consider the hardness of computing additive approximations to output probabilities of random quantum circuits. We consider three random circuit families, namely, Haar random, $p=1$ QAOA, and random IQP circuits. Our results are as…