Searcharxiv⌕ Search

arXiv subjects

Guillaume Mijoule

Publications and source records attributed to Guillaume Mijoule.

10 recordsLinked to original sources

Stein's density method for multivariate continuous distributions

This paper provides a general framework for Stein's density method for multivariate continuous distributions. The approach associates to any probability density function a canonical operator and Stein class, as well as an infinite collection of operators and classes which we call standardizations. These in turn spawn an entire family of Stein identities and characterizations for any continuous distribution on $\mathbb{R}^d$, among which we highlight those based on the score function and the Stein kernel. A feature of these operators is that they do not depend on normalizing constants. A new definition of Stein kernel is introduced and examined; integral formulas are obtained through a connection with mass transport, as well as ready-to-use explicit formulas for elliptical distributions. The flexibility of the kernels is used to compare in Stein discrepancy (and therefore 2-Wasserstein distance) between two normal distributions, Student and normal distributions, as well as two normal-gamma distributions. Upper and lower bounds on the 1-Wasserstein distance between continuous distributions are provided, and computed for a variety of examples: comparison between different normal distributions (improving on existing bounds in some regimes), posterior distributions with different priors in a Bayesian setting (including logistic regression), centred Azzalini--Dalla Valle distributions. Finally the notion of weak Stein equation and weak Stein factors is introduced. Bounds for solutions of the weak Stein equation are obtained for Lipschitz test functions if the distribution admits a Poincaré constant. We use these bounds to compare different copulas on the unit square in 1-Wasserstein distance.

math.PR↗

Modelling and forecasting patient recruitment in clinical trials with patients' dropout

This paper focuses on statistical modelling and prediction of patient recruitment in clinical trials accounting for patients dropout. The recruitment model is based on a Poisson-gamma model introduced by Anisimov and Fedorov (2007), where the patients arrive at different centres according to Poisson processes with rates viewed as gamma-distributed random variables. Each patient can drop the study during some screening period. Managing the dropout process is of a major importance but data related to dropout are rarely correctly collected. In this paper, a few models of dropout are proposed. The technique for estimating parameters and predicting the number of recruited patients over time and the recruitment time is developed. Simulation results confirm the applicability of the technique and thus, the necessity to account for patients dropout at the stage of forecasting recruitment in clinical trials.

stat.ME↗

Stein operators, kernels and discrepancies for multivariate continuous distributions

In this paper we present a general framework for Stein's method for multivariate continuous distributions. The approach gives a collection of Stein characterisations, among which we highlight score-Stein operators and kernel Stein operators. Applications include copulas and distance between posterior distributions. We give a general construction for Stein kernels for elliptical distributions and discuss Stein kernels in generality, highlighting connections with Fisher information and mass transport. Finally, a goodness-of-fit test based on Stein discrepancies is given.

math.PR↗

Some new Stein operators for product distributions

We provide a general result for finding Stein operators for the product of two independent random variables whose Stein operators satisfy a certain assumption, extending a recent result of Gaunt, Mijoule and Swan \cite{gms18}. This framework applies to non-centered normal and non-centered gamma random variables, as well as a general sub-family of the variance-gamma distributions. Curiously, there is an increase in complexity in the Stein operators for products of independent normals as one moves, for example, from centered to non-centered normals. As applications, we give a simple derivation of the characteristic function of the product of independent normals, and provide insight into why the probability density function of this distribution is much more complicated in the non-centered case than the centered case.

math.PR↗

An algebra of Stein operators

We build upon recent advances on the distributional aspect of Stein's method to propose a novel and flexible technique for computing Stein operators for random variables that can be written as products of independent random variables. We show that our results are valid for a wide class of distributions including normal, beta, variance-gamma, generalized gamma and many more. Our operators are $k$th degree differential operators with polynomial coefficients; they are straightforward to obtain even when the target density bears no explicit handle. As an application, we derive a new formula for the density of the product of $k$ independent symmetric variance-gamma distributed random variables.

math.PR↗

Regularity of solutions of the Stein equation and rates in the multivariate central limit theorem

Consider the multivariate Stein equation $Δf - x\cdot \nabla f = h(x) - E h(Z)$, where $Z$ is a standard $d$-dimensional Gaussian random vector, and let $f\_h$ be the solution given by Barbour's generator approach. We prove that, when $h$ is $α$-Hölder ($0<α\leq1$), all derivatives of order $2$ of $f\_h$ are $α$-Hölder {\it up to a $\log$ factor}; in particular they are $β$-Hölder for all $β\in (0, α)$, hereby improving existing regularity results on the solution of the multivariate Gaussian Stein equation. For $α=1$, the regularity we obtain is optimal, as shown by an example given by Raič \cite{raivc2004multivariate}. As an application, we prove a near-optimal Berry-Esseen bound of the order $\log n/\sqrt n$ in the classical multivariate CLT in $1$-Wasserstein distance, as long as the underlying random variables have finite moment of order $3$. When only a finite moment of order $2+δ$ is assumed ($0<δ<1$), we obtain the optimal rate in $\mathcal O(n^{-\fracδ{2}})$. All constants are explicit and their dependence on the dimension $d$ is studied when $d$ is large.

math.PR↗

A new approach to the Stein-Tikhomirov method: with applications to the second Wiener chaos and Dickman convergence

In this paper, we propose a general means of estimating the rate at which convergences in law occur. Our approach, which is an extension of the classical Stein-Tikhomirov method, rests on a new pair of linear operators acting on characteristic functions. In principle, this method is admissible for any approximating sequence and any target, although obviously the conjunction of several favorable factors is necessary in order for the resulting bounds to be of interest. As we briefly discuss, our approach is particularly promising whenever some version of Stein's method applies. We apply our approach to two examples. The first application concerns convergence in law towards targets $F_\infty$ which belong to the second Wiener chaos (i.e. $F_{\infty}$ is a linear combination of independent centered chi-squared rvs). We detail an application to $U$-statistics. The second application concerns convergence towards targets belonging to the generalized Dickman family of distributions. We detail an application to a theorem from number theory. In both cases our method produces bounds of the correct order (up to a logarithmic loss) in terms of quantities which occur naturally in Stein's method.

math.PR↗

Generalization of the Nualart-Peccati criterion

The celebrated Nualart-Peccati criterion [Ann. Probab. 33 (2005) 177-193] ensures the convergence in distribution toward a standard Gaussian random variable $N$ of a given sequence $\{X_n\}_{n\ge1}$ of multiple Wiener-Itô integrals of fixed order, if $\mathbb {E}[X_n^2]\to1$ and $\mathbb {E}[X_n^4]\to \mathbb {E}[N^4]=3$. Since its appearance in 2005, the natural question of ascertaining which other moments can replace the fourth moment in the above criterion has remained entirely open. Based on the technique recently introduced in [J. Funct. Anal. 266 (2014) 2341-2359], we settle this problem and establish that the convergence of any even moment, greater than four, to the corresponding moment of the standard Gaussian distribution, guarantees the central convergence. As a by-product, we provide many new moment inequalities for multiple Wiener-Itô integrals. For instance, if $X$ is a normalized multiple Wiener-Itô integral of order greater than one, \[\forall k\ge2,\qquad \mathbb {E}\bigl[X^{2k}\bigr]>\mathbb {E} \bigl[N^{2k}\bigr]=(2k-1)!!.\]

math.PR↗

On the rate of convergence in de Finetti's representation theorem

A consequence of de Finetti's representation theorem is that for every infinite sequence of exchangeable 0-1 random variables $(X_k)_{k\geq1}$, there exists a probability measure $μ$ on the Borel sets of $[0,1]$ such that $\bar X_n = n^{-1} \sum_{i=1}^n X_i$ converges weakly to $μ$. For a wide class of probability measures $μ$ having smooth density on $(0,1)$, we give bounds of order $1/n$ with explicit constants for the Wasserstein distance between the law of $\bar X_n$ and $μ$. This extends a recent result {by} Goldstein and Reinert \cite{goldstein2013stein} regarding the distance between the scaled number of white balls drawn in a Pólya-Eggenberger urn and its limiting distribution. We prove also that, in the most general cases, the distance between the law of $\bar X_n$ and $μ$ is bounded below by $1/n$ and above by $1/\sqrt{n}$ (up to some multiplicative constants). For every $δ\in [1/2,1]$, we give an example of an exchangeable sequence such that this distance is of order $1/n^δ$.

math.PR↗

Non-uniform spline recovery from small degree polynomial approximation

We investigate the sparse spikes deconvolution problem onto spaces of algebraic polynomials. Our framework encompasses the measure reconstruction problem from a combination of noiseless and noisy moment measurements. We study a TV-norm regularization procedure to localize the support and estimate the weights of a target discrete measure in this frame. Furthermore, we derive quantitative bounds on the support recovery and the amplitudes errors under a Chebyshev-type minimal separation condition on its support. Incidentally, we study the localization of the knots of non-uniform splines when a Gaussian perturbation of their inner-products with a known polynomial basis is observed (i.e. a small degree polynomial approximation is known) and the boundary conditions are known. We prove that the knots can be recovered in a grid-free manner using semidefinite programming.

math.ST↗