14 citations · 35 across the 16 of their papers we have counts for
16 papers
A functional central limit theorem for kernel gradient flow and infinitesimal gradient boosting
Clément Dombry, Jean-Jil Duchamps
Building on the large-sample analysis of infinitesimal gradient boosting (Dombry and Duchamps, 2024), we study the fluctuations of the process around its deterministic limit and es…
A parameterized family of balance indices for phylogenetic networks
François Bienvenu, Jean-Jil Duchamps, Hadrien Maffioli
We introduce a new family of balance indices for phylogenetic networks: the indices, where is a positive real number. This family includes the index as a special ca…
An RKHS Perspective on Tree Ensembles
Mehdi Dagdoug, Clement Dombry, Jean-Jil Duchamps
Random Forests and Gradient Boosting are among the most effective algorithms for supervised learning on tabular data. Both belong to the class of tree-based ensemble methods, where…
Sharp condition for supercritical Galton-Watson processes with countable types
Mathilde André, Jean-Jil Duchamps
We investigate Kesten-Stigum-like results for multi-type Galton-Watson processes with a countable number of types in a general setting, allowing us in particular to consider proces…
The index of galled trees
François Bienvenu, Jean-Jil Duchamps, Michael Fuchs +1
In recent years, there has been an effort to extend the classical notion of phylogenetic balance, originally defined in the context of trees, to networks. One of the most natural w…
A branching process with coalescence to model random phylogenetic networks
François Bienvenu, Jean-Jil Duchamps
We introduce a biologically natural, mathematically tractable model of random phylogenetic network to describe evolution in the presence of hybridization. One of the features of th…
A large sample theory for infinitesimal gradient boosting
Clement Dombry, Jean-Jil Duchamps
Infinitesimal gradient boosting (Dombry and Duchamps, 2021) is defined as the vanishing-learning-rate limit of the popular tree-based gradient boosting algorithm from machine learn…
General epidemiological models: Law of large numbers and contact tracing
Jean-Jil Duchamps, Félix Foutel-Rodier, Emmanuel Schertzer
We study a class of individual-based, fixed-population size epidemic models under general assumptions, e.g., heterogeneous contact rates encapsulating changes in behavior and/or en…
Infinitesimal gradient boosting
Clément Dombry, Jean-Jil Duchamps
We define infinitesimal gradient boosting as a limit of the popular tree-based gradient boosting algorithm from machine learning. The limit is considered in the vanishing-learning-…
From individual-based epidemic models to McKendrick-von Foerster PDEs: A guide to modeling and inferring COVID-19 dynamics
Félix Foutel-Rodier, François Blanquart, Philibert Courau +9
We present a unifying, tractable approach for studying the spread of viruses causing complex diseases requiring to be modeled using a large number of types (e.g., infective stage,…
Fragmentations with self-similar branching speeds
Jean-Jil Duchamps
We consider fragmentation processes with values in the space of marked partitions of , i.e. partitions where each block is decorated with a nonnegative real number. Ass…
The Moran forest
François Bienvenu, Jean-Jil Duchamps, Félix Foutel-Rodier
Starting from any graph on , consider the Markov chain where at each time-step a uniformly chosen vertex is disconnected from all of its neighbors and reconnected…
Trees within trees II: Nested Fragmentations
Jean-Jil Duchamps
Similarly as in (Blancas et al. 2018) where nested coalescent processes are studied, we generalize the definition of partition-valued homogeneous Markov fragmentation processes to…
Trees within trees: Simple nested coalescents
Airam Blancas, Jean-Jil Duchamps, Amaury Lambert +1
We consider the compact space of pairs of nested partitions of , where by analogy with models used in molecular evolution, we call "gene partition" the finer partition a…
Renewal sequences and record chains related to multiple zeta sums
Jean-Jil Duchamps, Jim Pitman, Wenpin Tang
For the random interval partition of generated by the uniform stick-breaking scheme known as GEM, let be the probability that the first intervals created by…
Mutations on a Random Binary Tree with Measured Boundary
Jean-Jil Duchamps, Amaury Lambert
Consider a random real tree whose leaf set, or boundary, is endowed with a finite mass measure. Each element of the tree is further given a type, or allele, inherited from the most…