Researcher profile

Pierre Lafaye de Micheaux

Pierre Lafaye de Micheaux contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
7works
0followers
5topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

7 published item(s)

preprint2026arXiv

Deep-testing: the case of dependence detection

Deep learning methods have proved highly effective for classification and image recognition problems. In this paper, we ask whether this success can be transferred to hypothesis testing: if a neural network can distinguish, for example, an image of a handwritten digit from another, can it also distinguish an "image of a sample" (such as a scatter plot) generated under a given statistical model from one generated outside that model? Motivated by this idea, we propose a novel procedure called deep-testing, which approaches the classical inferential problem of hypothesis testing through deep learning. More specifically, the test statistic is a classification map learned by a deep neural network from simulated data satisfying the null and alternative hypotheses, leveraging its strong discriminating power to construct a highly powerful test. As a proof of concept, we apply deep-testing to the problem of independence testing, arguably one of the most important problems in statistics. In a large-scale simulation study, deep-testing achieves the highest overall power against nineteen competing methods across a broad range of complex dependence structures, confirming the viability of the proposed approach.

preprint2022arXiv

A comprehensive empirical power comparison of univariate goodness-of-fit tests for the Laplace distribution

In this paper we present the results from an empirical power comparison of 40 goodness-of-fit tests for the univariate Laplace distribution, carried out using Monte Carlo simulations with sample sizes $n = 20, 50, 100, 200$, significance levels $α= 0.01, 0.05, 0.10$, and 400 alternatives consisting of asymmetric and symmetric light/heavy-tailed distributions taken as special cases from 11 models. In addition to the unmatched scope of our study, an interesting contribution is the proposal of an innovative design for the selection of alternatives. The 400 alternatives consist of 20 specific cases of 20 submodels drawn from the main 11 models. For each submodel, the 20 specific cases corresponded to parameter values chosen to cover the full power range. An analysis of the results leads to a recommendation of the best tests for five different groupings of the alternative distributions. A real-data example is also presented, where an appropriate test for the goodness-of-fit of the univariate Laplace distribution is applied to weekly log-returns of Amazon stock over a recent four-year period.

preprint2021arXiv

Counterexamples to the classical central limit theorem for triplewise independent random variables having a common arbitrary margin

We present a general methodology to construct triplewise independent sequences of random variables having a common but arbitrary marginal distribution $F$ (satisfying very mild conditions). For two specific sequences, we obtain in closed form the asymptotic distribution of the sample mean. It is non-Gaussian (and depends on the specific choice of $F$). This allows us to illustrate the extent of the 'failure' of the classical central limit theorem (CLT) under triplewise independence. Our methodology is simple and can also be used to create, for any integer $K$, new $K$-tuplewise independent sequences that are not mutually independent. For $K \geq 4$, it appears that the sequences created using our methodology do verify a CLT, and we explain heuristically why this is the case.

preprint2020arXiv

A counterexample to the central limit theorem for pairwise independent random variables having a common arbitrary margin

The Central Limit Theorem (CLT) is one of the most fundamental results in statistics. It states that the standardized sample mean of a sequence of $n$ mutually independent and identically distributed random variables with finite first and second moments converges in distribution to a standard Gaussian as $n$ goes to infinity. In particular, pairwise independence of the sequence is generally not sufficient for the theorem to hold. We construct explicitly a sequence of pairwise independent random variables having a common but arbitrary marginal distribution $F$ (satisfying very mild conditions) for which the CLT is not verified. We study the extent of this 'failure' of the CLT by obtaining, in closed form, the asymptotic distribution of the sample mean of our sequence. This is illustrated through several theoretical examples, for which we provide associated computing codes in the R language.

preprint2020arXiv

A study of seven asymmetric kernels for the estimation of cumulative distribution functions

In Mombeni et al. (2019), Birnbaum-Saunders and Weibull kernel estimators were introduced for the estimation of cumulative distribution functions (c.d.f.s) supported on the half-line $[0,\infty)$. They were the first authors to use asymmetric kernels in the context of c.d.f. estimation. Their estimators were shown to perform better numerically than traditional methods such as the basic kernel method and the boundary modified version from Tenreiro (2013). In the present paper, we complement their study by introducing five new asymmetric kernel c.d.f. estimators, namely the Gamma, inverse Gamma, lognormal, inverse Gaussian and reciprocal inverse Gaussian kernel c.d.f. estimators. For these five new estimators, we prove the asymptotic normality and we find asymptotic expressions for the following quantities: bias, variance, mean squared error and mean integrated squared error. A numerical study then compares the performance of the five new c.d.f. estimators against traditional methods and the Birnbaum-Saunders and Weibull kernel c.d.f. estimators from Mombeni et al. (2019). By using the same experimental design, we show that the lognormal and Birnbaum-Saunders kernel c.d.f. estimators perform the best overall, while the other asymmetric kernel estimators are sometimes better but always at least competitive against the boundary kernel method.

preprint2020arXiv

Depth for curve data and applications

John W. Tukey (1975) defined statistical data depth as a function that determines centrality of an arbitrary point with respect to a data cloud or to a probability measure. During the last decades, this seminal idea of data depth evolved into a powerful tool proving to be useful in various fields of science. Recently, extending the notion of data depth to the functional setting attracted a lot of attention among theoretical and applied statisticians. We go further and suggest a notion of data depth suitable for data represented as curves, or trajectories, which is independent of the parametrization. We show that our curve depth satisfies theoretical requirements of general depth functions that are meaningful for trajectories. We apply our methodology to diffusion tensor brain images and also to pattern recognition of hand written digits and letters. Supplementary Materials are available online.

preprint2018arXiv

A uniform $L^1$ law of large numbers for functions of i.i.d. random variables that are translated by a consistent estimator

We develop a new $L^1$ law of large numbers where the $i$-th summand is given by a function $h(\cdot)$ evaluated at $X_i - θ_n$, and where $θ_n \circeq θ_n(X_1,X_2,\ldots,X_n)$ is an estimator converging in probability to some parameter $θ\in \mathbb{R}$. Under broad technical conditions, the convergence is shown to hold uniformly in the set of estimators interpolating between $θ$ and another consistent estimator $θ_n^{\star}$. Our main contribution is the treatment of the case where $|h|$ blows up at $0$, which is not covered by standard uniform laws of large numbers.