Claire Lacour
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Claire Lacour has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Nicolas Conanec
LAGA (UMR 7539), Université Sorbonne Paris Nord, Institut Galilée, Villetaneuse, France
1 shared publication Pascal Massart
Laboratoire de mathématiques d'Orsay Université Paris-Saclay CNRS 91405 Orsay France
1 shared publication- Pascal Massart
Université Paris-Sud
1 shared publication Suzanne Varet
Laboratoire de mathématiques d'Orsay Université Paris-Saclay CNRS 91405 Orsay France
1 shared publication- Thanh Mai Pham Ngoc
LAGA (UMR 7539), Université Sorbonne Paris Nord, Institut Galilée, Villetaneuse, France
1 shared publication - Vincent Rivoirard
CEREMADE, Université Paris Dauphine
1 shared publication
Latest Publications
- Open Access
- 1 January 2026
- Published by Institute of Mathematical Statistics in Electronic Journal of Statistics
- Vol. 20 (2) , 3143-3177
Nonparametric optimal density estimation for censored circular data
We consider the problem of estimating the probability density function of a circular random variable observed under censoring. To this end, we introduce a projection estimator constructed via a regression approach on linear sieves. We first establish a lower bound for the mean integrated squared error in the case of Sobolev densities, thereby identifying the minimax rate of convergence for this estimation problem. We then derive a matching upper bound for the same risk, showing that the proposed estimator attains the minimax rate when the underlying density belongs to a Sobolev class. Finally, we develop a data-driven version of the procedure that preserves this optimal rate, thus yielding an adaptive estimator. The practical performance of the method is demonstrated through simulation studies.
- 1 January 2026
- Published by Institute of Mathematical Statistics in Electronic Journal of Statistics
- Vol. 20 (2) , 3143-3177
Open AccessNonparametric optimal density estimation for censored circular data
We consider the problem of estimating the probability density function of a circular random variable observed under censoring. To this end, we introduce a projection estimator constructed via a regression approach on linear sieves. We first establish a lower bound for the mean integrated squared error in the case of Sobolev densities, thereby identifying the minimax rate of convergence for this estimation problem. We then derive a matching upper bound for the same risk, showing that the proposed estimator attains the minimax rate when the underlying density belongs to a Sobolev class. Finally, we develop a data-driven version of the procedure that preserves this optimal rate, thus yielding an adaptive estimator. The practical performance of the method is demonstrated through simulation studies.
- Open Access
- 16 June 2023
- Published by EDP Sciences in ESAIM: Probability and Statistics
- Vol. 27, 621-667
Numerical performance of penalized comparison to overfitting for multivariate kernel density estimation
Kernel density estimation is a well known method involving a smoothing parameter (the bandwidth) that needs to be tuned by the user. Although this method has been widely used, the bandwidth selection remains a challenging issue in terms of balancing algorithmic performance and statistical relevance. The purpose of this paper is to study a recently developed bandwidth selection method, called Penalized Comparison to Overfitting (PCO). We first provide new theoretical guarantees by proving that PCO performed with non-diagonal bandwidth matrices is optimal in the oracle and minimax approaches. PCO is then compared to other usual bandwidth selection methods (at least those which are implemented in the R-package) for univariate and also multivariate kernel density estimation on the basis of intensive simulation studies. In particular, cross-validation and plug-in criteria are numerically investigated and compared to PCO. The take home message is that PCO can outperform the classical methods without algorithmic additional cost.
- 16 June 2023
- Published by EDP Sciences in ESAIM: Probability and Statistics
- Vol. 27, 621-667
Open AccessNumerical performance of penalized comparison to overfitting for multivariate kernel density estimation
Kernel density estimation is a well known method involving a smoothing parameter (the bandwidth) that needs to be tuned by the user. Although this method has been widely used, the bandwidth selection remains a challenging issue in terms of balancing algorithmic performance and statistical relevance. The purpose of this paper is to study a recently developed bandwidth selection method, called Penalized Comparison to Overfitting (PCO). We first provide new theoretical guarantees by proving that PCO performed with non-diagonal bandwidth matrices is optimal in the oracle and minimax approaches. PCO is then compared to other usual bandwidth selection methods (at least those which are implemented in the R-package) for univariate and also multivariate kernel density estimation on the basis of intensive simulation studies. In particular, cross-validation and plug-in criteria are numerically investigated and compared to PCO. The take home message is that PCO can outperform the classical methods without algorithmic additional cost.
- 1 December 2016
- Published by Elsevier in Stochastic Processes and their Applications
- Vol. 126 (12) , 3774-3789
Minimal penalty for Goldenshluger–Lepski method
- 1 December 2016
- Published by Elsevier in Stochastic Processes and their Applications
- Vol. 126 (12) , 3774-3789
Minimal penalty for Goldenshluger–Lepski method