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

O. Deniz Akyildiz

dblp:409/0284 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

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

Artificial 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
Probabilistic and Bayesian machine learning · 91% Optimization for machine learning · 9%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › structured models
latent variable model
0.912025
Learning Latent Variable Models via Jarzynski-adjusted Langevin Algorithm · NeurIPS 2025
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › parameter estimation
maximum marginal likelihood estimation
0.912025
Learning Latent Variable Models via Jarzynski-adjusted Langevin Algorithm · NeurIPS 2025
Machine learning › Probabilistic and Bayesian machine learning › monte carlo methods
sequential monte carlo
0.912025
Learning Latent Variable Models via Jarzynski-adjusted Langevin Algorithm · NeurIPS 2025
Machine learning › Optimization for machine learning
stochastic gradient descent
0.312025
Learning Latent Variable Models via Jarzynski-adjusted Langevin Algorithm · NeurIPS 2025

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

unadjusted langevin algorithm · 0.9sequential monte carlo · 0.9jarzynski equality · 0.9
YearPublicationVenuePosition
2025 Learning Latent Variable Models via Jarzynski-adjusted Langevin Algorithm
abstract
We utilise a sampler originating from nonequilibrium statistical mechanics, termed here Jarzynski-adjusted Langevin algorithm (JALA), to build statistical estimation methods in latent variable models. We achieve this by leveraging Jarzynski’s equality and developing algorithms based on a weighted version of the unadjusted Langevin algorithm (ULA) with recursively updated weights. Adapting this for latent variable models, we develop a sequential Monte Carlo (SMC) method that provides the maximum marginal likelihood estimate of the parameters, termed JALA-EM. Under suitable regularity assumptions on the marginal likelihood, we provide a nonasymptotic analysis of the JALA-EM scheme implemented with stochastic gradient descent and show that it provably converges to the maximum marginal likelihood estimate. We demonstrate the performance of JALA-EM on a variety of latent variable models and show that it performs comparably to existing methods in terms of accuracy and computational efficiency. Importantly, the ability to recursively estimate marginal likelihoods—an uncommon feature among scalable methods—makes our approach particularly suited for model selection, which we validate through dedicated experiments.
James Cuin, Davide Carbone, O. Deniz Akyildiz
NeurIPS3