PMPascal Massart

Pascal Massart

*This is an algorithmically generated author record based on publicly available information.

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


Pascal Massart has a total of 10 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

    • 3 February 2021
    • Published by HAL in HAL
    Open Access

    Random Forests for Time Series

    by Benjamin Goehry, Hui Yan, Yannig Goude, Pascal Massart, Jean-Michel Poggi

    Random forests were introduced in 2001 by Breiman and have since become a popular learning algorithm, for both regression and classification. However, when dealing with time series, random forests do not integrate the time-dependent structure, implicitly supposing that the observations are independent. We propose some variants of the random forests designed for time series. The idea is to replace the standard bootstrap with a dependent bootstrap (i.e block bootstrap) to subsample time series during the tree construction phase to take time dependence into account. We then present two numerical experiments on electricity load forecasting. The first one, at a disaggregated level, is based on an application to load forecasting of a building and illustrate how the variants may perform. The second one is at a more aggregated level (French national forecasting) but focusing on atypical periods. For both, we explore a heuristic for the choice of the block size, the new parameter.

  • Open Access

    A new V-fold type procedure based on robust tests

    by Lucien Birgé, Nelo Magalhães, Pascal Massart

    We define a general V-fold cross-validation type method based on robust tests, which is an extension of the hold-out defined by Birg{\'e} [7, Section 9]. We give some theoretical results showing that, under some weak assumptions on the considered statistical procedures, our selected estimator satisfies an oracle type inequality. We also introduce a fast algorithm that implements our method. Moreover we show in our simulations that this V-fold performs generally well for estimating a density for different sample sizes, and can handle well-known problems, such as binwidth selection for histograms or bandwidth selection for kernels. We finally provide a comparison with other classical V-fold methods and study empirically the influence of the value of V on the risk.

  • A high-dimensional Wilks phenomenon

    by Stéphane Boucheron, Pascal Massart


  • Open Access

    Data-driven calibration of penalties for least-squares regression

    by Sylvain Arlot, Pascal Massart

    Penalization procedures often suffer from their dependence on multiplying factors, whose optimal values are either unknown or hard to estimate from the data. We propose a completely data-driven calibration algorithm for this parameter in the least-squares regression framework, without assuming a particular shape for the penalty. Our algorithm relies on the concept of minimal penalty, recently introduced by Birge and Massart (2007) in the context of penalized least squares for Gaussian homoscedastic regression. On the positive side, the minimal penalty can be evaluated from the data themselves, leading to a data-driven estimation of an optimal penalty which can be used in practice; on the negative side, their approach heavily relies on the homoscedastic Gaussian nature of their stochastic framework. The purpose of this paper is twofold: stating a more general heuristics for designing a data-driven penalty (the slope heuristics) and proving that it works for penalized least-squares regression with a random design, even for heteroscedastic non-Gaussian data. For technical reasons, some exact mathematical results will be proved only for regressogram bin-width selection. This is at least a first step towards further results, since the approach and the method that we use are indeed general.

  • Top Cited Papers
    Open Access

    Concentration inequalities using the entropy method

    by Stéphane Boucheron, Gábor Lugosi, Pascal Massart

    We investigate a new methodology, worked out by Ledoux and Massart, to prove concentration-of-measure inequalities. The method is based on certain modified logarithmic Sobolev inequalities. We provide some very simple and general ready-to-use inequalities. One of these inequalities may be considered as an exponential version of the Efron--Stein inequality. The main purpose of this paper is to point out the simplicity and the generality of the approach. We show how the new method can recover many of Talagrand's revolutionary inequalities and provide new applications in a variety of problems including Rademacher averages, Rademacher chaos, the number of certain small subgraphs in a random graph, and the minimum of the empirical risk in some statistical estimation problems.