Denis Larocque

Prof. Denis Larocque

HEC Montréal

Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 September 2012 in Journal of Nonparametric Statistics
Verified
Journal Article
Closed access
MRMarie-Hélène Roy
Marie-Hélène Roy
DLDenis Larocque
Denis Larocque
In this paper, we empirically investigate the robustness of random forests for regression problems. We also investigate the performance of six variations of the original random forest method, all aimed at improving robustness. These variations are based on three main ideas: (1) robustify the aggregation method, (2) robustify the splitting criterion and (3) taking a robust transformation of the response. More precisely, with the first idea, we use the median (or weighted median), instead of the mean, to combine the predictions from the individual trees. With the second idea, we use least-absolute deviations from the median, instead of least-squares, as splitting criterion. With the third idea, we build the trees using the ranks of the response instead of the original values. The competing methods are compared via a simulation study with artificial data using two different types of contaminations and also with 13 real data sets. Our results show that all three ideas improve the robustness of the original random forest algorithm. However, a robust aggregation of the individual trees is generally more profitable than a robust splitting criterion.

15 April 2021 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
FDFrancois-Xavier Devailly
Francois-Xavier Devailly
DLDenis Larocque
Denis Larocque
LCLaurent Charlin
Laurent Charlin
Scaling adaptive traffic signal control involves dealing with combinatorial state and action spaces. Multi-agent reinforcement learning attempts to address this challenge by distributing control to specialized agents. However, specialization hinders generalization and transferability, and the computational graphs underlying neural-network architectures—dominating in the multi-agent setting—do not offer the flexibility to handle an arbitrary number of entities which changes both between road networks, and over time as vehicles traverse the network. We introduce Inductive Graph Reinforcement Learning (IG-RL) based on graph-convolutional networks which adapts to the structure of any road network, to learn detailed representations of traffic signal controllers and their surroundings. Our decentralized approach enables learning of a transferable-adaptive-traffic-signal-control policy. After being trained on an arbitrary set of road networks, our model can generalize to new road networks and traffic distributions, with no additional training and a constant number of parameters, enabling greater scalability compared to prior methods. Furthermore, our approach can exploit the granularity of available data by capturing the (dynamic) demand at both the lane level and the vehicle level. The proposed method is tested on both road networks and traffic settings never experienced during training. We compare IG-RL to multi-agent reinforcement learning and domain-specific baselines. In both synthetic road networks and in a larger experiment involving the control of the 3,971 traffic signals of Manhattan, we show that different instantiations of IG-RL outperform baselines.

25 March 2008 in International Journal of Remote Sensing
Verified
Journal Article
Closed access
LWLenny Wall
Lenny Wall
DLDenis Larocque
Denis Larocque
PLPierre‐Majorique Léger
Pierre‐Majorique Léger
The objective of this paper is to study, on a weekly basis, the explanatory power of one satellite‐based measurement, the Normalized Difference Vegetation Index (NDVI), for wheat yield modelling in 40 census agricultural regions (CAR) in the Canadian Prairies during the whole growing season using 16 years of NOAA AVHRR satellite data (between 1987 and 2002). We also explore the relative value of NDVI compared with a land‐based measurement, the Cumulative Moisture Index (CMI). By developing a series of weekly wheat yield models over the course of the growing season, we are able to determine the accuracy of different models. Our findings indicate that NDVI possesses explanatory power 4 weeks earlier in the season than CMI.

1 August 2005 in Journal of Statistical Computation and Simulation
Verified
Journal Article
Closed access
MHMounir Hamza
Mounir Hamza
DLDenis Larocque
Denis Larocque
In this paper, we perform an empirical comparison of the classification error of several ensemble methods based on classification trees. This comparison is performed by using 14 data sets that are publicly available and that were used by Lim, Loh and Shih [Lim, T., Loh, W. and Shih, Y.-S., 2000, A comparison of prediction accuracy, complexity, and training time of thirty-three old and new classification algorithms. Machine Learning, 40, 203–228.]. The methods considered are a single tree, Bagging, Boosting (Arcing) and random forests (RF). They are compared from different perspectives. More precisely, we look at the effects of noise and of allowing linear combinations in the construction of the trees, the differences between some splitting criteria and, specifically for RF, the effect of the number of variables from which to choose the best split at each given node. Moreover, we compare our results with those obtained by Lim et al. [Lim, T., Loh, W. and Shih, Y.-S., 2000, A comparison of prediction accuracy, complexity, and training time of thirty-three old and new classification algorithms. Machine Learning, 40, 203–228.]. In this study, the best overall results are obtained with RF. In particular, RF are the most robust against noise. The effect of allowing linear combinations and the differences between splitting criteria are small on average, but can be substantial for some data sets.

24 August 2017 in Statistical Methods in Medical Research
Verified
Journal Article
Closed access
HMHoora Moradian
Hoora Moradian
DLDenis Larocque
Denis Larocque
FBFrançois Bellavance
François Bellavance
Tree-based methods are very powerful and popular tools for analysing survival data with right-censoring. The existing methods assume that the true time-to-event and the censoring times are independent given the covariates. We propose different ways to build survival forests when dependent censoring is suspected, by using an appropriate estimator of the survival function when aggregating the individual trees and/or by modifying the splitting rule. The appropriate estimator used in this paper is the copula-graphic estimator. We also propose a new method for building survival forests, called p-forest, that may be used not only when dependent censoring is suspected, but also as a new survival forest method in general. The results from a simulation study indicate that these modifications improve greatly the estimation of the survival function in situations of dependent censoring. A real data example illustrates how the proposed methods can be used to perform a sensitivity analysis.

2 August 2019 in Bioinformatics
Verified
Journal Article
Closed access
STSami Tabib
Sami Tabib
DLDenis Larocque
Denis Larocque
Motivation: Personalized medicine often relies on accurate estimation of a treatment effect for specific subjects. This estimation can be based on the subject’s baseline covariates but additional complications arise for a time-to-event response subject to censoring. In this paper, the treatment effect is measured as the difference between the mean survival time of a treated subject and the mean survival time of a control subject. We propose a new random forest method for estimating the individual treatment effect with survival data. The random forest is formed by individual trees built with a splitting rule specifically designed to partition the data according to the individual treatment effect. For a new subject, the forest provides a set of similar subjects from the training dataset that can be used to compute an estimation of the individual treatment effect with any adequate method. Results: The merits of the proposed method are investigated with a simulation study where it is compared to numerous competitors, including recent state-of-the-art methods. The results indicate that the proposed method has a very good and stable performance to estimate the individual treatment effects. Two examples of application with a colon cancer data and breast cancer data show that the proposed method can detect a treatment effect in a sub-population even when the overall effect is small or nonexistent. Availability and implementation: The authors are working on an R package implementing the proposed method and it will be available soon. In the meantime, the code can be obtained from the first author at sami.tabib@hec.ca. Supplementary information: Supplementary data are available at Bioinformatics online.