VLDB 2026 Research / reviewers in the wild / expert
Charlotte Baey
dblp:174/9135
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial 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 |
Optimization for machine learning · 60% Probabilistic and Bayesian machine learning · 40% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Optimization for machine learning
convergence analysis |
0.7 | 1 | 2023 | 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.7 | 1 | 2023 | 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.7 | 1 | 2023 | 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.7 | 1 | 2023 | Efficient preconditioned stochastic gradient descent for estimation in latent variable models · ICML 2023 |
Machine learning › Optimization for machine learning
stochastic gradient descent |
0.7 | 1 | 2023 | Efficient preconditioned stochastic gradient descent for estimation in latent variable models · ICML 2023 |
Methods — techniques the papers use, named apart from their topics
fisher information matrix · 0.7EM algorithm · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Efficient preconditioned stochastic gradient descent for estimation in latent variable modelsabstractLatent 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 |
ICML | 1 |