arXiv subjects

Alexis Derumigny

Publications and source records attributed to Alexis Derumigny.

24 records · Page 2Linked to original sources

arXiv2019

Estimation of a regular conditional functional by conditional U-statistics regression

U-statistics constitute a large class of estimators, generalizing the empirical mean of a random variable $X$ to sums over every $k$-tuple of distinct observations of $X$. They may be used to estimate a regular functional $θ(P_{X})$ of the law of $X$. When a vector of covariates $Z$ is available, a conditional U-statistic may describe the effect of $z$ on the conditional law of $X$ given $Z=z$, by estimating a regular conditional functional $θ(P_{X|Z=\cdot})$. We prove concentration inequalities for conditional U-statistics. Assuming a parametric model of the conditional functional of interest, we propose a regression-type estimator based on conditional U-statistics. Its theoretical properties are derived, first in a non-asymptotic framework and then in two different asymptotic regimes. Some examples are given to illustrate our methods.

math.ST↗

arXiv2019

On kernel-based estimation of conditional Kendall's tau: finite-distance bounds and asymptotic behavior

We study nonparametric estimators of conditional Kendall's tau, a measure of concordance between two random variables given some covariates. We prove non-asymptotic bounds with explicit constants, that hold with high probabilities. We provide "direct proofs" of the consistency and the asymptotic law of conditional Kendall's tau. A simulation study evaluates the numerical performance of such nonparametric estimators.

math.ST↗

arXiv2018

A classification point-of-view about conditional Kendall's tau

We show how the problem of estimating conditional Kendall's tau can be rewritten as a classification task. Conditional Kendall's tau is a conditional dependence parameter that is a characteristic of a given pair of random variables. The goal is to predict whether the pair is concordant (value of $1$) or discordant (value of $-1$) conditionally on some covariates. We prove the consistency and the asymptotic normality of a family of penalized approximate maximum likelihood estimators, including the equivalent of the logit and probit regressions in our framework. Then, we detail specific algorithms adapting usual machine learning techniques, including nearest neighbors, decision trees, random forests and neural networks, to the setting of the estimation of conditional Kendall's tau. Finite sample properties of these estimators and their sensitivities to each component of the data-generating process are assessed in a simulation study. Finally, we apply all these estimators to a dataset of European stock indices.

stat.CO↗

arXiv2018

About Kendall's regression

Conditional Kendall's tau is a measure of dependence between two random variables, conditionally on some covariates. We assume a regression-type relationship between conditional Kendall's tau and some covariates, in a parametric setting with a large number of transformations of a small number of regressors. This model may be sparse, and the underlying parameter is estimated through a penalized criterion. We prove non-asymptotic bounds with explicit constants that hold with high probabilities. We derive the consistency of a two-step estimator, its asymptotic law and some oracle properties. Some simulations and applications to real data conclude the paper.

math.ST↗

arXiv2017

Improved bounds for Square-Root Lasso and Square-Root Slope

Extending the results of Bellec, Lecué and Tsybakov to the setting of sparse high-dimensional linear regression with unknown variance, we show that two estimators, the Square-Root Lasso and the Square-Root Slope can achieve the optimal minimax prediction rate, which is $(s/n) \log (p/s)$, up to some constant, under some mild conditions on the design matrix. Here, $n$ is the sample size, $p$ is the dimension and $s$ is the sparsity parameter. We also prove optimality for the estimation error in the $l_q$-norm, with $q \in [1,2]$ for the Square-Root Lasso, and in the $l_2$ and sorted $l_1$ norms for the Square-Root Slope. Both estimators are adaptive to the unknown variance of the noise. The Square-Root Slope is also adaptive to the sparsity $s$ of the true parameter. Next, we prove that any estimator depending on $s$ which attains the minimax rate admits an adaptive to $s$ version still attaining the same rate. We apply this result to the Square-root Lasso. Moreover, for both estimators, we obtain valid rates for a wide range of confidence levels, and improved concentration properties as in [Bellec, Lecué and Tsybakov, 2017] where the case of known variance is treated. Our results are non-asymptotic.

math.ST↗

arXiv2017

About tests of the "simplifying" assumption for conditional copulas

We discuss the so-called "simplifying assumption" of conditional copulas in a general framework. We introduce several tests of the latter assumption for non- and semiparametric copula models. Some related test procedures based on conditioning subsets instead of point-wise events are proposed. The limiting distribution of such test statistics under the null are approximated by several bootstrap schemes, most of them being new. We prove the validity of a particular semiparametric bootstrap scheme. Some simulations illustrate the relevance of our results.

math.ST↗