Sampling-based Continuous Optimization with Coupled Variables for RNA Design

• URL: http://arxiv.org/abs/2412.08751v1
• Date: Wed, 11 Dec 2024 19:46:54 GMT
• Title: Sampling-based Continuous Optimization with Coupled Variables for RNA Design
• Abstract summary: We develop continuous optimization methods for RNA design problems.<n>Our work consistently outperforms state-of-the-art methods in key metrics such as Boltzmann probability, ensemble defect, and energy gap.
• Score: 4.226911519009711
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The task of RNA design given a target structure aims to find a sequence that can fold into that structure. It is a computationally hard problem where some version(s) have been proven to be NP-hard. As a result, heuristic methods such as local search have been popular for this task, but by only exploring a fixed number of candidates. They can not keep up with the exponential growth of the design space, and often perform poorly on longer and harder-to-design structures. We instead formulate these discrete problems as continuous optimization, which starts with a distribution over all possible candidate sequences, and uses gradient descent to improve the expectation of an objective function. We define novel distributions based on coupled variables to rule out invalid sequences given the target structure and to model the correlation between nucleotides. To make it universally applicable to any objective function, we use sampling to approximate the expected objective function, to estimate the gradient, and to select the final candidate. Compared to the state-of-the-art methods, our work consistently outperforms them in key metrics such as Boltzmann probability, ensemble defect, and energy gap, especially on long and hard-to-design puzzles in the Eterna100 benchmark. Our code is available at: http://github.com/weiyutang1010/ncrna_design.

Related papers

• Stabilizing Extrapolation in Looped Transformers via Learned Stochastic Stopping [56.14767235650558]
  Looped Transformers, which repeatedly apply a shared transformer block, are an architecturally natural fit for variable-length computation tasks.<n>We trace this variance to the spurious correlation in simple algorithmic tasks between sequence length and number of loops.<n>Our work suggests that "when to stop" should be treated as a training design choice, not merely an inference-time-allocation rule.
  arXiv  Detail & Related papers  (2026-06-29T08:58:09Z)
• Empirical Evaluation of No Free Lunch Violations in Permutation-Based Optimization [0.0]
  We study an iterative-search setting with sampling without replacement, where algorithms differ only in evaluation order.<n>Results show how objective reformulation and benchmark design can generate structured local departures from NFL intuition.<n>This message applies to evolutionary computation as well as to statistical procedures based on relabeling, resampling, and permutation tests.
  arXiv  Detail & Related papers  (2026-03-04T00:55:25Z)
• GauS: Differentiable Scheduling Optimization via Gaussian Reparameterization [10.649335239505584]
  We propose a differentiable framework, GauS, for efficient operator scheduling.<n>By representing schedules as continuous Gaussian variables, we successfully capture the ordinal nature of time.<n>Our method is highly flexible to represent various objectives and constraints, which provides the first differentiable formulation for the complex pipelined scheduling problem.
  arXiv  Detail & Related papers  (2026-02-23T23:58:32Z)
• Designing RNAs with Language Models [3.332772772624738]
  RNA design is a challenge due to the exponentially large sequence space and exponentially many competing folds.<n>We introduce a reusable neural approxorimator, instantiated as an autoregressive language model (LM), that maps target structures directly to sequences.<n>Across four datasets, our approach outperforms state-of-the-art systems on key metrics such as Boltzmann probability while being 1.7x faster.
  arXiv  Detail & Related papers  (2026-02-12T22:57:09Z)
• Local Entropy Search over Descent Sequences for Bayesian Optimization [48.7994415668802]
  A practical alternative is to iteratively refine the neighborhood of an initial design using local optimization methods such as gradient descent.<n>We propose local entropy search (LES), a Bayesian optimization paradigm that explicitly targets the solutions reachable by the descent sequences.
  arXiv  Detail & Related papers  (2025-11-24T15:52:17Z)
• Correlated Mutations for Integer Programming [0.0]
  This study seeks to establish the groundwork for Evolution Strategies (IESs)<n>IESs already excel in treating IP in practice, but accomplish it via discretization and by applying sophisticated patches to their continuous operators.<n>We focus on mutation distributions for integer decision variables.<n>We explore their theoretical properties, including entropy functions, and propose a procedure to generate scalable correlated mutation distributions.
  arXiv  Detail & Related papers  (2025-06-27T08:24:15Z)
• Combining Local Symmetry Exploitation and Reinforcement Learning for Optimised Probabilistic Inference -- A Work In Progress [2.2164989053903805]
  Efficient probabilistic inference by variable elimination in graphical models requires an optimal elimination order. We adapt a reinforcement learning approach to find efficient contraction orders in tensor networks. We show that leveraging specific structures during inference allows for introducing compact encodings of intermediate results.
  arXiv  Detail & Related papers  (2025-03-11T18:00:23Z)
• SplAgger: Split Aggregation for Meta-Reinforcement Learning [32.25672143072966]
  Black box methods do so by training off-the-shelf sequence models end-to-end. task inference methods explicitly infer a posterior distribution over the unknown task. Recent work has shown that task inference sequence models are not necessary for strong performance. We present evidence that task inference sequence models are indeed still beneficial.
  arXiv  Detail & Related papers  (2024-03-05T14:57:04Z)
• Messenger RNA Design via Expected Partition Function and Continuous Optimization [4.53482492156538]
  We develop a general framework for continuous optimization based on a generalization of classical partition function. We consider the important problem of mRNA design with wide applications in vaccines and therapeutics.
  arXiv  Detail & Related papers  (2023-12-29T18:37:38Z)
• Generalization Bounds for Stochastic Gradient Descent via Localized $\varepsilon$-Covers [16.618918548497223]
  We propose a new covering technique localized for the trajectories of SGD. This localization provides an algorithm-specific clustering measured by the bounds number. We derive these results in various contexts and improve the known state-of-the-art label rates.
  arXiv  Detail & Related papers  (2022-09-19T12:11:07Z)
• Combating Mode Collapse in GANs via Manifold Entropy Estimation [70.06639443446545]
  Generative Adversarial Networks (GANs) have shown compelling results in various tasks and applications. We propose a novel training pipeline to address the mode collapse issue of GANs.
  arXiv  Detail & Related papers  (2022-08-25T12:33:31Z)
• Multi-block-Single-probe Variance Reduced Estimator for Coupled Compositional Optimization [49.58290066287418]
  We propose a novel method named Multi-block-probe Variance Reduced (MSVR) to alleviate the complexity of compositional problems. Our results improve upon prior ones in several aspects, including the order of sample complexities and dependence on strongity.
  arXiv  Detail & Related papers  (2022-07-18T12:03:26Z)
• Improved Convergence Rate of Stochastic Gradient Langevin Dynamics with Variance Reduction and its Application to Optimization [50.83356836818667]
  gradient Langevin Dynamics is one of the most fundamental algorithms to solve non-eps optimization problems. In this paper, we show two variants of this kind, namely the Variance Reduced Langevin Dynamics and the Recursive Gradient Langevin Dynamics.
  arXiv  Detail & Related papers  (2022-03-30T11:39:00Z)
• Scaling Structured Inference with Randomization [64.18063627155128]
  We propose a family of dynamic programming (RDP) randomized for scaling structured models to tens of thousands of latent states. Our method is widely applicable to classical DP-based inference. It is also compatible with automatic differentiation so can be integrated with neural networks seamlessly.
  arXiv  Detail & Related papers  (2021-12-07T11:26:41Z)
• Local policy search with Bayesian optimization [73.0364959221845]
  Reinforcement learning aims to find an optimal policy by interaction with an environment. Policy gradients for local search are often obtained from random perturbations. We develop an algorithm utilizing a probabilistic model of the objective function and its gradient.
  arXiv  Detail & Related papers  (2021-06-22T16:07:02Z)
• Alleviate Exposure Bias in Sequence Prediction \\ with Recurrent Neural Networks [47.52214243454995]
  A popular strategy to train recurrent neural networks (RNNs) is to take the ground truth as input at each time step. We propose a fully differentiable training algorithm for RNNs to better capture long-term dependencies.
  arXiv  Detail & Related papers  (2021-03-22T06:15:22Z)
• Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics [78.46689176407936]
  We show that families of algorithms fail to produce nearly optimal solutions with high probability. For the case of Boolean circuits, our results improve the state-of-the-art bounds known in circuit complexity theory.
  arXiv  Detail & Related papers  (2020-04-25T05:45:59Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.