Related papers: High-probability bounds for the reconstruction err…
We consider principal component analysis for contaminated data-set in the high dimensional regime, where the dimensionality of each observation is comparable or even more than the number of observations. We propose a deterministic…
This paper proposes hybrid high-order eigensolvers for the computation of guaranteed lower eigenvalue bounds. These bounds display higher order convergence rates and are accessible to adaptive mesh-refining algorithms. The involved…
This paper aims to derive explicit and computable error bounds for the asymptotic expansion of the Jacobi polynomials as their degree approaches infinity, using an integral method. The analysis focuses on the outer or oscillatory region of…
In certain applications involving the solution of a Bayesian inverse problem, it may not be possible or desirable to evaluate the full posterior, e.g. due to the high computational cost of doing so. This problem motivates the use of…
We consider the 3-dimensional Stark operator perturbed by a complex-valued potential. We obtain an estimate for the number of eigenvalues of this operator as well as for the sum of imaginary parts of eigenvalues situated in the upper…
We consider nonparametric regression with functional covariates, that is, they are elements of an infinite-dimensional Hilbert space. A locally polynomial estimator is constructed, where an orthonormal basis and various tuning parameters…
We introduce higher-order Poincar'e constants for compact weighted manifolds and estimate them from above in terms of subsets. These estimates imply upper bounds for eigenvalues of the weighted Laplacian and the first nontrivial eigenvalue…
We build optimal exponential bounds for the probabilities of large deviations of sums \sum_{k=1}^nf(X_k) where (X_k) is a finite reversible Markov chain and f is an arbitrary bounded function. These bounds depend only on the stationary mean…
We find probability error bounds for approximations of functions $f$ in a separable reproducing kernel Hilbert space $\mathcal{H}$ with reproducing kernel $K$ on a base space $X$, firstly in terms of finite linear combinations of functions…
The laws of quantum mechanics place fundamental limits on the accuracy of measurements and therefore on the estimation of unknown parameters of a quantum system. In this work, we prove lower bounds on the size of confidence regions reported…
We get optimal lower bounds for the eigenvalues of the submanifold Dirac operator on locally reducible Riemannian manifolds in terms of intrinsic and extrinsic expressions. The limiting-cases are also studied. As a corollary, one gets…
In this note, we prove lower and upper bounds for Dirac operators of submanifolds in certain ambient manifolds in terms of conformal and extrinsic quantities.
In this paper, we prove restriction estimates for hyperbolic paraboloids in dimensions $n>=5$ by the polynomial partitioning method.
In this article we prove an upper bound for a Hilbert polynomial on quaternionic Kaehler manifolds of positive scalar curvature. As corollaries we obtain bounds on the quaternionic volume and the degree of the associated twistor space.…
We compute the Hilbert coefficients of a graded module with pure resolution and discuss lower and upper bounds for these coefficients for arbitrary graded modules.
In this paper we present some new upper bounds of the Cusa-Huygens and the Huygens approximations. Bounds are obtained in the forms of some polynomial and some rational functions.
Probabilistic principal component analysis (PCA) and its Bayesian variant (BPCA) are widely used for dimension reduction in machine learning and statistics. The main advantage of probabilistic PCA over the traditional formulation is…
We present numerical upscaling techniques for a class of linear second-order self-adjoint elliptic partial differential operators (or their high-resolution finite element discretization). As prototypes for the application of our theory we…
Probabilistic principal component analysis (PPCA) seeks a low dimensional representation of a data set in the presence of independent spherical Gaussian noise. The maximum likelihood solution for the model is an eigenvalue problem on the…
Probabilistic principal component analysis (PPCA) seeks a low dimensional representation of a data set in the presence of independent spherical Gaussian noise, Sigma = (sigma^2)*I. The maximum likelihood solution for the model is an…