Related papers: On magic factors in Stein's method for compound Po…
Compound Poisson distributions have been employed by many authors to fit experimental data, typically via the method of moments or maximum likelihood estimation. We propose a new technique and apply it to several sets of published data. It…
This paper is part of a series developing $C^0$ finite element methods for fourth-order elliptic equations on polygonal domains. Here, we investigate how boundary conditions influence the design of effective $C^0$ schemes, specifically…
We present an algorithm that takes a discrete random variable $X$ and a number $m$ and computes a random variable whose support (set of possible outcomes) is of size at most $m$ and whose Kolmogorov distance from $X$ is minimal. In addition…
Providing theoretical guarantees for parameter estimation in exponential random graph models is a largely open problem. While maximum likelihood estimation has theoretical guarantees in principle, verifying the assumptions for these…
We prove a Poisson limit theorem in the total variation distance of functionals of a general Poisson point process using the Malliavin-Stein method. Our estimates only involve first and second order difference operators and are closely…
This paper deals with Poisson processes on an arbitrary measurable space. Using a direct approach, we derive formulae for moments and cumulants of a vector of multiple Wiener-It\^o integrals with respect to the compensated Poisson process.…
We present an efficient algorithm that, given a discrete random variable $X$ and a number $m$, computes a random variable whose support is of size at most $m$ and whose Kolmogorov distance from $X$ is minimal, also for the one-sided…
Given a mean zero functional $F$ of a Poisson measure on a metric space, we apply the Malliavin-Stein method to establish sharpened second-order Poincar\'e inequalities for $F/\sqrt{\operatorname{Var} (F)}$ in terms of fourth moments of…
We use Stein's method to prove a generalization of the Lindeberg-Feller CLT providing an upper and a lower bound for the superior limit of the Kolmogorov distance between a normally distributed random variable and the rowwise sums of a…
The solution to Poisson's equation arise in many Markov chain and Markov jump process settings, including that of the central limit theorem, value functions for average reward Markov decision processes, and within the gradient formula for…
We extend the theory of matrix completion to the case where we make Poisson observations for a subset of entries of a low-rank matrix. We consider the (now) usual matrix recovery formulation through maximum likelihood with proper…
Learning the parameters of graphical models using the maximum likelihood estimation is generally hard which requires an approximation. Maximum composite likelihood estimations are statistical approximations of the maximum likelihood…
We develop techniques for determining an explicit Berry-Esseen bound in the Kolmogorov distance for the normal approximation of a ratio of Gaussian functionals. We provide an upper bound in terms of the third and fourth cumulants, using…
Chernoff bounds are a powerful application of the Markov inequality to produce strong bounds on the tails of probability distributions. They are often used to bound the tail probabilities of sums of Poisson trials, or in regression to…
Building on the rather large literature concerning the regularity of the solution of the standard normal Stein equation, we provide a complete description of the best possible uniform bounds for the derivatives of the solution of the…
We study several stochastic combinatorial problems, including the expected utility maximization problem, the stochastic knapsack problem and the stochastic bin packing problem. A common technical challenge in these problems is to optimize…
We present locally complete inference rules for probabilistic deduction from taxonomic and probabilistic knowledge-bases over conjunctive events. Crucially, in contrast to similar inference rules in the literature, our inference rules are…
The concentration inequality approach for normal approximation by Stein's method is generalized to the multivariate setting. We use this approach to prove a non-smooth function distance for multivariate normal approximation for standardized…
Kolmogorov complexity and algorithmic probability are defined only up to an additive resp. multiplicative constant, since their actual values depend on the choice of the universal reference computer. In this paper, we analyze a natural…
We consider predictions of the random number and the magnitude of each iid component in a random sum based on its distributional structure, where only a total value of the sum is available and where iid random components are non-negative.…