Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Maud Delattre

dblp:80/11036 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
2since 2021 · last 2024
0000-0002-3775-9278ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 1 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Optimization for machine learning · 60% Probabilistic and Bayesian machine learning · 40%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Optimization for machine learning
convergence analysis
0.712023
Efficient preconditioned stochastic gradient descent for estimation in latent variable models · ICML 2023
Machine learning › Probabilistic and Bayesian machine learning › structured models
latent variable model
0.712023
Efficient preconditioned stochastic gradient descent for estimation in latent variable models · ICML 2023
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
parameter estimation
0.712023
Efficient preconditioned stochastic gradient descent for estimation in latent variable models · ICML 2023
Machine learning › Optimization for machine learning › stochastic gradient descent
preconditioned SGD
0.712023
Efficient preconditioned stochastic gradient descent for estimation in latent variable models · ICML 2023
Machine learning › Optimization for machine learning
stochastic gradient descent
0.712023
Efficient preconditioned stochastic gradient descent for estimation in latent variable models · ICML 2023
Bioinformatics and computational biology › epigenomics
chromatin conformation
0.212014
Two-dimensional segmentation for analyzing Hi-C data · Bioinform. 2014
Bioinformatics and computational biology › epigenomics
hi-c data analysis
0.212014
Two-dimensional segmentation for analyzing Hi-C data · Bioinform. 2014

Methods — techniques the papers use, named apart from their topics

fisher information matrix · 0.7EM algorithm · 0.7maximum likelihood estimation · 0.2dynamic programming · 0.2
YearPublicationVenuePosition
2024 Modeling soybean growth: A mixed model approach
abstract
The evaluation of plant and animal growth, separately for genetic and environmental effects, is necessary for genetic understanding and genetic improvement of environmental responses of plants and animals. We propose to extend an existing approach that combines nonlinear mixed-effects model (NLMEM) and the stochastic approximation of the Expectation-Maximization algorithm (SAEM) to analyze genetic and environmental effects on plant growth. These tools are widely used in many fields but very rarely in plant biology. During model formulation, a nonlinear function describes the shape of growth, and random effects describe genetic and environmental effects and their variability. Genetic relationships among the varieties were also integrated into the model using a genetic relationship matrix. The SAEM algorithm was chosen as an efficient alternative to MCMC methods, which are more commonly used in the domain. It was implemented to infer the expected growth patterns in the analyzed population and the expected curves for each variety through a maximum-likelihood and a maximum-a-posteriori approaches, respectively. The obtained estimates can be used to predict the growth curves for each variety. We illustrate the strengths of the proposed approach using simulated data and soybean plant growth data obtained from a soybean cultivation experiment conducted at the Arid Land Research Center, Tottori University. In this experiment, plant height was measured daily using drones, and the growth was monitored for approximately 200 soybean cultivars for which whole-genome sequence data were available. The NLMEM approach improved our understanding of the determinants of soybean growth and can be successfully used for the genomic prediction of growth pattern characteristics.
Maud Delattre, Yusuke Toda, Jessica Tressou, Hiroyoshi Iwata
PLoS Comput. Biol.1
2023 Efficient preconditioned stochastic gradient descent for estimation in latent variable models
abstract
Latent variable models are powerful tools for modeling complex phenomena involving in particular partially observed data, unobserved variables or underlying complex unknown structures. Inference is often difficult due to the latent structure of the model. To deal with parameter estimation in the presence of latent variables, well-known efficient methods exist, such as gradient-based and EM-type algorithms, but with practical and theoretical limitations. In this paper, we propose as an alternative for parameter estimation an efficient preconditioned stochastic gradient algorithm. Our method includes a preconditioning step based on a positive definite Fisher information matrix estimate. We prove convergence results for the proposed algorithm under mild assumptions for very general latent variables models. We illustrate through relevant simulations the performance of the proposed methodology in a nonlinear mixed effects model and in a stochastic block model.
Charlotte Baey, Maud Delattre, Estelle Kuhn, Jean-Benoist Leger, Sarah Lemler
ICML2
2014 Two-dimensional segmentation for analyzing Hi-C data
abstract
MOTIVATION: The spatial conformation of the chromosome has a deep influence on gene regulation and expression. Hi-C technology allows the evaluation of the spatial proximity between any pair of loci along the genome. It results in a data matrix where blocks corresponding to (self-)interacting regions appear. The delimitation of such blocks is critical to better understand the spatial organization of the chromatin. From a computational point of view, it results in a 2D segmentation problem. RESULTS: We focus on the detection of cis-interacting regions, which appear to be prominent in observed data. We define a block-wise segmentation model for the detection of such regions. We prove that the maximization of the likelihood with respect to the block boundaries can be rephrased in terms of a 1D segmentation problem, for which the standard dynamic programming applies. The performance of the proposed methods is assessed by a simulation study on both synthetic and resampled data. A comparative study on public data shows good concordance with biologically confirmed regions. AVAILABILITY AND IMPLEMENTATION: The HiCseg R package is available from the Comprehensive R Archive Network and from the Web page of the corresponding author.
Céline Lévy-Leduc, Maud Delattre, Tristan Mary-Huard, Stéphane Robin
Bioinform.2