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

Estelle Kuhn

dblp:128/4806 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
1since 2021 · last 2023
0000-0002-1236-8190ORCID · corroborated

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

Graphics, computer vision, multimedia, augmented reality and games · 2Artificial 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%

Topics — the 5 heaviest of 5, 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

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

fisher information matrix · 0.7EM algorithm · 0.7
YearPublicationVenuePosition
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
ICML3
2015 Bayesian Mixed Effect Atlas Estimation with a Diffeomorphic Deformation Model
abstract
In this paper we introduce a diffeomorphic constraint on the deformations considered in the deformable Bayesian mixed effect template model. Our approach is built on a generic group of diffeomorphisms, which is parameterized by an arbitrary set of control point positions and momentum vectors. This enables us to estimate the optimal positions of control points together with a template image and parameters of the deformation distribution which compose the atlas. We propose to use a stochastic version of the expectation-maximization algorithm where the simulation is performed using the anisotropic Metropolis adjusted Langevin algorithm. We propose also an extension of the model including a sparsity constraint to select an optimal number of control points with relevant positions. Experiments are carried out on the United States Postal Service database, on mandibles of mice, and on three-dimensional murine dendrite spine images.
Stéphanie Allassonnière, Stanley Durrleman, Estelle Kuhn
SIAM J. Imaging Sci.3
2006 Generative Model and Consistent Estimation Algorithms for Non-Rigid Deformable Models
abstract
The link between Bayesian and variational approaches is well known in the image analysis community in particular in the context of deformable models. However, true generative models and consistent estimation procedures are usually not available and the current trend is the computation of statistics mainly based on PCA analysis. We advocate in this paper a careful statistical modeling of deformable structures and we propose an effective and consistent estimation algorithm for the various parameters (geometric and photometric) appearing in the models
Stéphanie Allassonnière, Estelle Kuhn, Alain Trouvé, Yali Amit
ICASSP (5)2