Source author record

Gery Geenens

Gery Geenens appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

6works
4topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

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

Published work

6 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

Hellinger-Bhattacharyya cross-validation for shape-preserving multivariate wavelet thresholding

The benefits of the wavelet approach for density estimation are well established in the literature, especially when the density to estimate is irregular or heterogeneous in smoothness. However, wavelet density estimates are typically not bona fide densities. In Aya-Moreno et al (2018), a `shape-preserving' wavelet density estimator was introduced, including as main step the estimation of the square-root of the density. A natural concept involving square-root of densities is the Hellinger distance - or equivalently, the Bhattacharyya affinity coefficient. In this paper, we deliver a fully data-driven version of the above 'shape-preserving' wavelet density estimator, where all user-defined parameters, such as resolution level or thresholding specifications, are selected by optimising an original leave-one-out version of the Hellinger-Bhattacharyya criterion. The theoretical optimality of the proposed procedure is established, while simulations show the strong practical performance of the estimator. Within that framework, we also propose a novel but natural 'jackknife thresholding' scheme, which proves superior to other, more classical thresholding options.

preprint2016arXiv

Local-likelihood transformation kernel density estimation for positive random variables

The kernel estimator is known not to be adequate for estimating the density of a positive random variable X. The main reason is the well-known boundary bias problems that it suffers from, but also its poor behaviour in the long right tail that such a density typically exhibits. A natural approach to this problem is to first estimate the density of the logarithm of X, and obtaining an estimate of the density of X using standard results on functions of random variables (`back-transformation'). Although intuitive, the basic application of this idea yields very poor results, as was documented earlier in the literature. In this paper, the main reason for this underachievement is identified, and an easy fix is suggested. It is demonstrated that combining the transformation with local likelihood density estimation methods produces very good estimators of R+-supported densities, not only close to the boundary, but also in the right tail. The asymptotic properties of the proposed `local likelihood transformation kernel density estimators' are derived for a generic transformation, not only for the logarithm, which allows one to consider other transformations as well. One of them, called the `probex' transformation, is given more focus. Finally, the excellent behaviour of those estimators in practice is evidenced through a comprehensive simulation study and the analysis of several real data sets. A nice consequence of articulating the method around local-likelihood estimation is that the resulting density estimates are typically smooth and visually pleasant, without oversmoothing important features of the underlying density.

preprint2014arXiv

Probit transformation for nonparametric kernel estimation of the copula density

Copula modelling has become ubiquitous in modern statistics. Here, the problem of nonparametrically estimating a copula density is addressed. Arguably the most popular nonparametric density estimator, the kernel estimator is not suitable for the unit-square-supported copula densities, mainly because it is heavily affected by boundary bias issues. In addition, most common copulas admit unbounded densities, and kernel methods are not consistent in that case. In this paper, a kernel-type copula density estimator is proposed. It is based on the idea of transforming the uniform marginals of the copula density into normal distributions via the probit function, estimating the density in the transformed domain, which can be accomplished without boundary problems, and obtaining an estimate of the copula density through back-transformation. Although natural, a raw application of this procedure was, however, seen not to perform very well in the earlier literature. Here, it is shown that, if combined with local likelihood density estimation methods, the idea yields very good and easy to implement estimators, fixing boundary issues in a natural way and able to cope with unbounded copula densities. The asymptotic properties of the suggested estimators are derived, and a practical way of selecting the crucially important smoothing parameters is devised. Finally, extensive simulation studies and a real data analysis evidence their excellent performance compared to their main competitors.

preprint2013arXiv

Probit transformation for kernel density estimation on the unit interval

Kernel estimation of a probability density function supported on the unit interval has proved difficult, because of the well known boundary bias issues a conventional kernel density estimator would necessarily face in this situation. Transforming the variable of interest into a variable whose density has unconstrained support, estimating that density, and obtaining an estimate of the density of the original variable through back-transformation, seems a natural idea to easily get rid of the boundary problems. In practice, however, a simple and efficient implementation of this methodology is far from immediate, and the few attempts found in the literature have been reported not to perform well. In this paper, the main reasons for this failure are identified and an easy way to correct them is suggested. It turns out that combining the transformation idea with local likelihood density estimation produces viable density estimators, mostly free from boundary issues. Their asymptotic properties are derived, and a practical cross-validation bandwidth selection rule is devised. Extensive simulations demonstrate the excellent performance of these estimators compared to their main competitors for a wide range of density shapes. In fact, they turn out to be the best choice overall. Finally, they are used to successfully estimate a density of non-standard shape supported on $[0,1]$ from a small-size real data sample.

preprint2012arXiv

A Nonparametric Measure of Local Association for two-way Contingency Tables

In contingency table analysis, the odds ratio is a commonly applied measure used to summarize the degree of association between two categorical variables, say R and S. Suppose now that for each individual in the table, a vector of continuous variables X is also observed. It is then vital to analyze whether and how the degree of association varies with X. In this work, we extend the classical odds ratio to the conditional case, and develop nonparametric estimators of this "pointwise odds ratio" to summarize the strength of local association between R and S given X. To allow for maximum flexibility, we make this extension using kernel regression. We develop confidence intervals based on these nonparametric estimators. We demonstrate via simulation that our pointwise odds ratio estimators can outperform model-based counterparts from logistic regression and GAMs, without the need for a linearity or additivity assumption. Finally, we illustrate its application to a dataset of patients from an intensive care unit (ICU), offering a greater insight into how the association between survival of patients admitted for emergency versus elective reasons varies with the patients' ages.