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.

Charlie B. Tan

dblp:392/4317 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 first-author · 2 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
2 papers
Generative modeling · 100%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Computational science and engineering · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling
normalizing flow
1.722025
Amortized Sampling with Transferable Normalizing Flows · NeurIPS 2025
Scalable Equilibrium Sampling with Sequential Boltzmann Generators · ICML 2025
Machine learning › Generative modeling
amortized sampling
0.912025
Amortized Sampling with Transferable Normalizing Flows · NeurIPS 2025
Machine learning › Generative modeling › normalizing flow
boltzmann generator
0.912025
Scalable Equilibrium Sampling with Sequential Boltzmann Generators · ICML 2025
Computational science and engineering › computational chemistry
molecular simulation
0.912025
Scalable Equilibrium Sampling with Sequential Boltzmann Generators · ICML 2025
Computational science and engineering › computational chemistry › molecular simulation
molecular dynamics
0.312025
Amortized Sampling with Transferable Normalizing Flows · NeurIPS 2025

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

sequential monte carlo · 3.5importance sampling · 3.5transformer · 1.7fine-tuning · 1.7annealed langevin dynamics · 1.7
YearPublicationVenuePosition
2025 Scalable Equilibrium Sampling with Sequential Boltzmann Generators
abstract
Scalable sampling of molecular states in thermodynamic equilibrium is a long-standing challenge in statistical physics. Boltzmann generators tackle this problem by pairing normalizing flows with importance sampling to obtain uncorrelated samples under the target distribution. In this paper, we extend the Boltzmann generator framework with two key contributions, denoting our framework Sequential Boltzmann Generators (SBG). The first is a highly efficient Transformer-based normalizing flow operating directly on all-atom Cartesian coordinates. In contrast to the equivariant continuous flows of prior methods, we leverage exactly invertible non-equivariant architectures which are highly efficient during both sample generation and likelihood evaluation. This efficiency unlocks more sophisticated inference strategies beyond standard importance sampling. In particular, we perform inference-time scaling of flow samples using a continuous-time variant of sequential Monte Carlo, in which flow samples are transported towards the target distribution with annealed Langevin dynamics. SBG achieves state-of-the-art performance w.r.t. all metrics on peptide systems, demonstrating the first equilibrium sampling in Cartesian coordinates of tri-, tetra- and hexa-peptides that were thus far intractable for prior Boltzmann generators.
Charlie B. Tan, Joey Bose, Chen Lin 0003, Leon Klein, Michael M. Bronstein, Alexander Tong 0001
ICML1
2025 Amortized Sampling with Transferable Normalizing Flows
abstract
Efficient equilibrium sampling of molecular conformations remains a core challenge in computational chemistry and statistical inference. Classical approaches such as molecular dynamics or Markov chain Monte Carlo inherently lack amortization; the computational cost of sampling must be paid in full for each system of interest. The widespread success of generative models has inspired interest towards overcoming this limitation through learning sampling algorithms. Despite performing competitively with conventional methods when trained on a single system, learned samplers have so far demonstrated limited ability to transfer across systems. We demonstrate that deep learning enables the design of scalable and transferable samplers by introducing Prose, a 285 million parameter all-atom transferable normalizing flow trained on a corpus of peptide molecular dynamics trajectories up to 8 residues in length. Prose draws zero-shot uncorrelated proposal samples for arbitrary peptide systems, achieving the previously intractable transferability across sequence length, whilst retaining the efficient likelihood evaluation of normalizing flows. Through extensive empirical evaluation we demonstrate the efficacy of Prose as a proposal for a variety of sampling algorithms, finding a simple importance sampling-based finetuning procedure to achieve competitive performance to established methods such as sequential Monte Carlo. We open-source the Prose codebase, model weights, and training dataset, to further stimulate research into amortized sampling methods and finetuning objectives.
Charlie B. Tan, Majdi Hassan, Leon Klein, Saifuddin Syed, Dominique Beaini, Michael M. Bronstein, Alexander Tong 0001, Kirill Neklyudov
NeurIPS1