Related papers: On magic factors in Stein's method for compound Po…
We introduce a new minimisation principle for Poisson equation using two variables: the solution and the gradient of the solution. This principle allows us to use any conforming finite element spaces for both variables, where the finite…
In a Cox model, the partial likelihood, as the product of a series of conditional probabilities, is used to estimate the regression coefficients. In practice, those conditional probabilities are approximated by risk score ratios based on a…
Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with better parameters than explicit constructions do. But the probabilistic…
We derive new explicit bounds for the total variation distance between two convolution products of $n$ probability distributions, one of which having identical convolution factors. Approximations by finite signed measures of arbitrary order…
The paper presents a new statistical method that enables the use of systematic errors in the maximum-likelihood regression of integer-count Poisson data to a parametric model. The method is primarily aimed at the characterization of the…
The convergence rates for convex and non-convex optimization methods depend on the choice of a host of constants, including step sizes, Lyapunov function constants and momentum constants. In this work we propose the use of factorial powers…
We present new, exceptionally efficient proofs of Poisson--Dirichlet limit theorems for the scaled sizes of irreducible components of random elements in the classic combinatorial contexts of arbitrary assemblies, multisets, and selections,…
This paper is concerned with finite element methods for Poisson's equation with rough boundary data. Conventional methods require that the boundary data $g$ of the problem belongs to $H^{1/2} (\partial \Omega)$. However, in many…
Fisher's criterion is a widely used tool in machine learning for feature selection. For large search spaces, Fisher's criterion can provide a scalable solution to select features. A challenging limitation of Fisher's criterion, however, is…
Stein's method allows to prove distributional convergence of a sequence of random variables and to quantify it with respect to a given metric such as Kolmogorov's (a Berry-Ess\'een type theorem). Mod-* convergence quantifies the convergence…
The goal of this work is to fill a gap in [Yang, SIAM J. Matrix Anal. Appl, 41 (2020), 1797--1825]. In that work, an approximation procedure was proposed for orthogonal low-rank tensor approximation; however, the approximation lower bound…
We obtain explicit error bounds for the $d$-dimensional normal approximation on hyperrectangles for a random vector that has a Stein kernel, or admits an exchangeable pair coupling, or is a non-linear statistic of independent random…
Stein's method is used to approximate sums of discrete and locally dependent random variables by a centered and symmetric Binomial distribution. Under appropriate smoothness properties of the summands, the same order of accuracy as in the…
We combine Stein's method with a version of Malliavin calculus on the Poisson space. As a result, we obtain explicit Berry-Ess\'een bounds in Central Limit Theorems (CLTs) involving multiple Wiener-It\^o integrals with respect to a general…
We develop a new formulation of Stein's method to obtain computable upper bounds on the total variation distance between the geometric distribution and a distribution of interest. Our framework reduces the problem to the construction of a…
In this paper, we develop Stein's method for binomial approximation using the stop-loss metric that allows one to obtain a bound on the error term between the expectation of call functions. We obtain the results for a locally dependent…
Competing and Complementary risk (CCR) problems are often modelled using a class of distributions of the maximum, or minimum, of a random number of i.i.d. random variables; we call this class the CCR class of distributions. While the CCR…
We derive Berry-Esseen approximation bounds for general functionals of independent random variables, based on chaos expansions methods. Our results apply to $U$-statistics satisfying the weak assumption of decomposability in the Hoeffding…
In this paper we obtain non-uniform Berry-Esseen bounds for normal approximations by the Malliavin-Stein method. The techniques rely on a detailed analysis of the solutions of Stein's equations and will be applied to functionals of a…
Let $\{X_{i}, i\in J\}$ be a family of locally dependent non-negative integer-valued random variables with finite expectations and variances. We consider the sum $W=\sum_{i\in J}X_i$ and use Stein's method to establish general upper error…