← Back to Blog
Publications

Bayesian approximation of RNA folding times

This workshop paper introduces the core KinPFN idea: approximating RNA first-passage-time distributions with a prior-data fitted network trained on synthetic folding-time priors.

Bayesian approximation of RNA folding times with KinPFN
Bayesian approximation of RNA folding times with KinPFN

This workshop paper presents the core idea behind KinPFN in a compact form: model RNA folding-time distributions directly, instead of recomputing them through thousands of simulator runs for every new case. The target quantity is the cumulative distribution of first passage times, a useful kinetic summary because it reflects how quickly different fractions of molecules reach a structure of interest.

The proposed solution uses prior-data fitted networks, trained not on a large corpus of experimentally measured RNAs, but on synthetic multi-modal distributions chosen to resemble the behavior of real folding-time data. Given just a few example folding times from a kinetics simulator, the model predicts the posterior distribution of folding times and from that the full cumulative distribution function. That makes the method especially attractive where only a small kinetic sample is available but a full distribution estimate would be useful.

What makes this interesting for RNA folding kinetics is the combination of speed and modularity. The method does not require rewriting the underlying simulator or abandoning physically motivated kinetic models. Instead, it acts as an approximation layer that reduces the number of expensive simulations needed for downstream interpretation. The workshop paper therefore gives a proof of principle for integrating modern probabilistic machine learning into RNA kinetics workflows.

Relative to the full conference paper, this version is shorter and more focused on the central idea, but it already makes the key argument clearly: approximating folding-time distributions can be enough for many practical tasks, and those approximations can be learned efficiently from a synthetic prior. For anyone interested in the intersection of RNA folding kinetics and AI, this paper is a useful entry point into the broader KinPFN project.

It also connects directly to kinetics-aware RNA design, because many design decisions do not require a perfect kinetic simulation. They require a fast and credible way to compare whether one candidate is likely to behave more cleanly than another.

Abstract of the paper

RNA is a dynamic biomolecule with its function largely determined by its folding into complex structures. During the folding process, an RNA traverses through a series of intermediate structural states, with each transition occurring at variable rates that collectively influence the time required to reach the functional form. Understanding these folding kinetics is vital for predicting RNA behavior and optimizing applications in synthetic biology and drug discovery. While in silico kinetic RNA folding simulators are often computationally intensive and time-consuming, accurate approximations of the folding times can already be very informative to assess the efficiency of the folding process. Here, we present KinPFN, a novel approach that leverages prior-data fitted networks to directly model the posterior predictive distribution of RNA folding times. Trained on synthetic data representing arbitrary prior folding times, KinPFN efficiently approximates the cumulative distribution function of RNA folding times in a single forward pass, given only a few initial folding time examples. Our method offers a modular extension to RNA kinetics algorithms, promising significant computational speed-ups orders of magnitude faster, while achieving comparable results.

Citation

Bayesian Approximation of RNA Folding Times
Dominik Scheuer, Frederic Runge, Jörg K.H. Franke, Michael T. Wolfinger, Christoph Flamm, Frank Hutter
ICLR 2025 Workshop on AI for Nucleic Acids (2025) | doi:10.5281/zenodo.15228717 | PDF