arXiv subjects

Ryan K. Krueger

Publications and source records attributed to Ryan K. Krueger.

4 recordsLinked to original sources

arXiv2026

Differentiable RNA Secondary Structure Extraction for Deep Learning

Many deep learning approaches to RNA secondary structure prediction have recently been proposed. They typically output a weight matrix $W$ where $W_{ij}$ is an arbitrary weight for base $i$ pairing with base $j$. Converting this matrix to a predicted secondary structure or base-pairing probability matrix typically involves ad hoc and problematic downstream algorithms. Despite the importance of this conversion step, which we refer to as structure extraction, it has received relatively little attention in the literature. In this work, we analyze how the congruence between training and extraction methods affects prediction performance. To do this, we compare four extraction algorithms: a Nussinov-like dynamic programming method, maximum-weight graph matching and the greedy extraction algorithms used by SPOT-RNA and RiNALMo. These are evaluated on outputs from the pretrained RiNALMo model and three toy models trained in this paper: a differentiable Nussinov-like model, a binary cross-entropy (BCE) baseline, and a model that incorporates a novel symmetric doubly stochastic matrix (SDSM) normalization algorithm during training which allows it to output base-pairing probability matrices directly, without a separate extraction step. This SDSM normalization algorithm is differentiable and can be added inline to any deep learning model during training and evaluation. We find that the performance of each extraction method depends strongly on how the corresponding model was trained. Considering the toy models themselves, the SDSM model showed the strongest overall performance: it outperformed the BCE baseline under all four extraction algorithms and produced pre-extraction outputs closest to the ground truth. These results suggest that SDSM normalization is a tractable alternative to traditional structure extraction.

cs.LG↗

arXiv2026

General Purpose Inverse Design of Heterogeneous Finite-Sized Assemblies

Designing heterogeneous, self-assembling systems is a central challenge in soft matter and biology. We present a framework that uses gradient-based optimization to invert an analytical yield calculation, tuning systems toward target equilibrium yields. We design systems ranging from simple dimers to temperature-controlled shells to polymerizing systems, achieving precise control of self- and non-self-limiting assemblies. By operating directly on closed-form calculations, our framework bypasses trajectory-based instabilities and enables efficient optimization in otherwise challenging regimes.

cond-mat.soft↗

arXiv2025

Differentiable Folding for Nearest Neighbor Model Optimization

The Nearest Neighbor model is the $\textit{de facto}$ thermodynamic model of RNA secondary structure formation and is a cornerstone of RNA structure prediction and sequence design. The current functional form (Turner 2004) contains $\approx13,000$ underlying thermodynamic parameters, and fitting these to both experimental and structural data is computationally challenging. Here, we leverage recent advances in $\textit{differentiable folding}$, a method for directly computing gradients of the RNA folding algorithms, to devise an efficient, scalable, and flexible means of parameter optimization that uses known RNA structures and thermodynamic experiments. Our method yields a significantly improved parameter set that outperforms existing baselines on all metrics, including an increase in the average predicted probability of ground-truth sequence-structure pairs for a single RNA family by over 23 orders of magnitude. Our framework provides a path towards drastically improved RNA models, enabling the flexible incorporation of new experimental data, definition of novel loss terms, large training sets, and even treatment as a module in larger deep learning pipelines. We make available a new database, RNAometer, with experimentally-determined stabilities for small RNA model systems.

q-bio.BM↗

arXiv2025

Fitting Coarse-Grained Models to Macroscopic Experimental Data via Automatic Differentiation

Developing physics-based models for molecular simulation requires fitting many unknown parameters to diverse experimental datasets. Traditionally, this process is piecemeal and difficult to reproduce, leading to a fragmented landscape of models. Here, we establish a systematic, extensible framework for fitting coarse-grained molecular models to macroscopic experimental data by leveraging recently developed methods for computing low-variance gradient estimates with automatic differentiation. Using a widely validated DNA force field as an exemplar, we develop methods for optimizing structural, mechanical, and thermodynamic properties across a range of simulation techniques, including enhanced sampling and external forcing, spanning micro- and millisecond timescales. We highlight how gradients enable efficient sensitivity analyses that yield physical insight. We then demonstrate the broad applicability of these techniques by optimizing diverse biomolecular systems, including RNA and DNA-protein hybrid models. We show how conflict-free gradient methods from multi-task learning can be adapted to impose multiple constraints simultaneously without compromising accuracy. This approach provides a foundation for transparent, reproducible, community-driven force field development, accelerating progress in molecular modeling.

physics.bio-ph↗