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

Clément Roussel

dblp:269/3901 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
—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% Representation and self-supervised learning · 9%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › monte carlo methods
markov chain monte carlo
0.812024
Accelerated Sampling with Stacked Restricted Boltzmann Machines · ICLR 2024
Machine learning › Probabilistic and Bayesian machine learning › boltzmann machine
restricted boltzmann machine
0.812024
Accelerated Sampling with Stacked Restricted Boltzmann Machines · ICLR 2024
Machine learning › Probabilistic and Bayesian machine learning
sampling
0.812024
Accelerated Sampling with Stacked Restricted Boltzmann Machines · ICLR 2024
Machine learning › Representation and self-supervised learning › representation learning
unsupervised representation learning
0.212024
Accelerated Sampling with Stacked Restricted Boltzmann Machines · ICLR 2024

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

stacked RBMs · 0.8replica exchange · 0.8parallel tempering · 0.8
YearPublicationVenuePosition
2024 Accelerated Sampling with Stacked Restricted Boltzmann Machines
abstract
Sampling complex distributions is an important but difficult objective in various fields, including physics, chemistry, and statistics. An improvement of standard Monte Carlo (MC) methods, intensively used in particular in the context of disordered systems, is Parallel Tempering, also called replica exchange MC, in which a sequence of MC Markov chains at decreasing temperatures are run in parallel and can swap their configurations. In this work we apply the ideas of parallel tempering in the context of restricted Boltzmann machines (RBM), a paradigm of unsupervised architectures, capable to learn complex, multimodal distributions. Inspired by Deep Tempering, an approach introduced for deep belief networks, we show how to learn on top of the first RBM a stack of nested RBMs, using the representations of a RBM as ’data’ for the next one along the stack. In our Stacked Tempering approach the hidden configurations of a machine can be exchanged with the visible configurations of the next one in the stack. Replica exchanges between the different RBMs is facilitated by the increasingly clustered representations learnt by deeper RBMs, allowing for fast transitions between the different modes of the data distribution. Analytical calculations of mixing times in a simplified theoretical setting shed light on why Stacked Tempering works, and how hyperparameters, such as the aspect ratios of the RBMs and weight regularization should be chosen. We illustrate the efficiency of the Stacked Tempering method with respect to standard and replica exchange MC on several datasets: MNIST, in-silico Lattice Proteins, and the 2D-Ising model.
Jorge Fernandez-de-Cossío-Diaz, Clément Roussel, Simona Cocco, Rémi Monasson
ICLR2