Demo Data from EDBT 2026 / reviewers in the wild / expert
Antoine Baker
dblp:41/10990
· DBLP profile ↗
3ranked-venue papers
2as first author
1since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 2 · 1 first-authorArtificial intelligence and machine learning · 1 · 1 first-author · 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 |
Probabilistic and Bayesian machine learning · 56% Graph learning · 44% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Graph learning › graph neural network › message passing
approximate message passing |
0.7 | 1 | 2023 | Tree-AMP: Compositional Inference with Tree Approximate Message Passing · J. Mach. Learn. Res. 2023 |
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models › factor graphs
factor graph inference |
0.7 | 1 | 2023 | Tree-AMP: Compositional Inference with Tree Approximate Message Passing · J. Mach. Learn. Res. 2023 |
Methods — techniques the papers use, named apart from their topics
state evolution · 0.7free entropy · 0.7approximate message passing · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Tree-AMP: Compositional Inference with Tree Approximate Message PassingabstractWe introduce Tree-AMP, standing for Tree Approximate Message Passing, a python package for compositional inference in high-dimensional tree-structured models. The package provides a unifying framework to study several approximate message passing algorithms previously derived for a variety of machine learning tasks such as generalized linear models, inference in multi-layer networks, matrix factorization, and reconstruction using non-separable penalties. For some models, the asymptotic performance of the algorithm can be theoretically predicted by the state evolution, and the measurements entropy estimated by the free entropy formalism. The implementation is modular by design: each module, which implements a factor, can be composed at will with other modules to solve complex inference tasks. The user only needs to declare the factor graph of the model: the inference algorithm, state evolution and entropy estimation are fully automated. Antoine Baker, Florent Krzakala, Benjamin Aubin, Lenka Zdeborová |
J. Mach. Learn. Res. | 1 |
| 2012 | Replication Fork Polarity Gradients Revealed by Megabase-Sized U-Shaped Replication Timing Domains in Human Cell LinesabstractIn higher eukaryotes, replication program specification in different cell types remains to be fully understood. We show for seven human cell lines that about half of the genome is divided in domains that display a characteristic U-shaped replication timing profile with early initiation zones at borders and late replication at centers. Significant overlap is observed between U-domains of different cell lines and also with germline replication domains exhibiting a N-shaped nucleotide compositional skew. From the demonstration that the average fork polarity is directly reflected by both the compositional skew and the derivative of the replication timing profile, we argue that the fact that this derivative displays a N-shape in U-domains sustains the existence of large-scale gradients of replication fork polarity in somatic and germline cells. Analysis of chromatin interaction (Hi-C) and chromatin marker data reveals that U-domains correspond to high-order chromatin structural units. We discuss possible models for replication origin activation within U/N-domains. The compartmentalization of the genome into replication U/N-domains provides new insights on the organization of the replication program in the human genome. Antoine Baker, Benjamin Audit, Chun-Long Chen, Benoit Moindrot, Antoine Leleu, Guillaume Guilbaud, Aurélien Rappailles, Cédric Vaillant, Arach Goldar, Fabien Mongelard, Yves D'Aubenton-Carafa, Olivier Hyrien, Claude Thermes, Alain Arneodo |
PLoS Comput. Biol. | 1 |
| 2011 | Evidence for Sequential and Increasing Activation of Replication Origins along Replication Timing Gradients in the Human GenomeabstractGenome-wide replication timing studies have suggested that mammalian chromosomes consist of megabase-scale domains of coordinated origin firing separated by large originless transition regions. Here, we report a quantitative genome-wide analysis of DNA replication kinetics in several human cell types that contradicts this view. DNA combing in HeLa cells sorted into four temporal compartments of S phase shows that replication origins are spaced at 40 kb intervals and fire as small clusters whose synchrony increases during S phase and that replication fork velocity (mean 0.7 kb/min, maximum 2.0 kb/min) remains constant and narrowly distributed through S phase. However, multi-scale analysis of a genome-wide replication timing profile shows a broad distribution of replication timing gradients with practically no regions larger than 100 kb replicating at less than 2 kb/min. Therefore, HeLa cells lack large regions of unidirectional fork progression. Temporal transition regions are replicated by sequential activation of origins at a rate that increases during S phase and replication timing gradients are set by the delay and the spacing between successive origin firings rather than by the velocity of single forks. Activation of internal origins in a specific temporal transition region is directly demonstrated by DNA combing of the IGH locus in HeLa cells. Analysis of published origin maps in HeLa cells and published replication timing and DNA combing data in several other cell types corroborate these findings, with the interesting exception of embryonic stem cells where regions of unidirectional fork progression seem more abundant. These results can be explained if origins fire independently of each other but under the control of long-range chromatin structure, or if replication forks progressing from early origins stimulate initiation in nearby unreplicated DNA. These findings shed a new light on the replication timing program of mammalian genomes and provide a general model for their replication kinetics. Guillaume Guilbaud, Aurélien Rappailles, Antoine Baker, Chun-Long Chen, Alain Arneodo, Arach Goldar, Yves D'Aubenton-Carafa, Claude Thermes, Benjamin Audit, Olivier Hyrien |
PLoS Comput. Biol. | 3 |