Factorization Machine with Quadratic-Optimization Annealing for RNA Inverse Folding and Evaluation of Binary-Integer Encoding and Nucleotide Assignment

• URL: http://arxiv.org/abs/2602.16643v1
• Date: Wed, 18 Feb 2026 17:32:55 GMT
• Title: Factorization Machine with Quadratic-Optimization Annealing for RNA Inverse Folding and Evaluation of Binary-Integer Encoding and Nucleotide Assignment
• Abstract summary: This study investigates the influence of integer-to-nucleotide assignments and binary-integer encoding on the performance of FMQA.<n>One-hot and domain-wall encodings outperform binary and unary encodings in terms of the normalized ensemble defect value.
• Score: 0.7519872646378835
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The RNA inverse folding problem aims to identify nucleotide sequences that preferentially adopt a given target secondary structure. While various heuristic and machine learning-based approaches have been proposed, many require a large number of sequence evaluations, which limits their applicability when experimental validation is costly. We propose a method to solve the problem using a factorization machine with quadratic-optimization annealing (FMQA). FMQA is a discrete black-box optimization method reported to obtain high-quality solutions with a limited number of evaluations. Applying FMQA to the problem requires converting nucleotides into binary variables. However, the influence of integer-to-nucleotide assignments and binary-integer encoding on the performance of FMQA has not been thoroughly investigated, even though such choices determine the structure of the surrogate model and the search landscape, and thus can directly affect solution quality. Therefore, this study aims both to establish a novel FMQA framework for RNA inverse folding and to analyze the effects of these assignments and encoding methods. We evaluated all 24 possible assignments of the four nucleotides to the ordered integers (0-3), in combination with four binary-integer encoding methods. Our results demonstrated that one-hot and domain-wall encodings outperform binary and unary encodings in terms of the normalized ensemble defect value. In domain-wall encoding, nucleotides assigned to the boundary integers (0 and 3) appeared with higher frequency. In the RNA inverse folding problem, assigning guanine and cytosine to these boundary integers promoted their enrichment in stem regions, which led to more thermodynamically stable secondary structures than those obtained with one-hot encoding.

Related papers

• Escaping Confidence Trap: Evolutionary Decoding for Mathematical Reasoning in Diffusion LLMs [69.52853771994451]
  We analyze the decoding trajectories of LLaDA 2.0 and identify a recurring diffusion confidence trap.<n>We propose Evolutionary Decoding, a training-free test-time scaling framework that views diffusion decoding as an evolutionary process.
  arXiv  Detail & Related papers  (2026-08-01T11:48:25Z)
• Formulation-Level Auto-Tuning for QUBO-Based Machine Learning: A Case Study Across Multiple Quantum-Inspired Annealers [0.0]
  This paper presents an Optuna-based formulation-level auto-tuning framework for support vector machines (SVMs)<n> continuous dual variables are discretized and converted into a quadratic unconstrained binary optimization (QUBO) model.<n>Experiments on linear and nonlinear classification tasks with 0-20% label noise show mean gains over grid search of approximately 0.8 and 2.1 percentage points, respectively.
  arXiv  Detail & Related papers  (2026-07-21T06:56:43Z)
• Stage-dependent integer-binary encoding in factorization-machine black-box optimization [0.612477318852572]
  Black-box optimization deals with problems where objective functions lack explicit analytical forms and are expensive to evaluate.<n>We propose a stage-dependent FMQA framework and derive conversion formulas between one-hot and domain-wall QUBO matrices.<n>We evaluate the OhDw variant, which employs one-hot encoding for learning and domain-wall encoding for search.
  arXiv  Detail & Related papers  (2026-06-22T11:36:27Z)
• Improving FMQA via Initial Training Data Design Considering Marginal Bit Coverage in One-Hot Encoding [0.5387709967970504]
  We propose a black-box optimization method that combines a factorization machine (FM) surrogate with QUBO-based search by an Ising machine.<n>When FMQA is applied to integer or discretized continuous variables via one-hot encoding, uniform random initial sampling can leave many binary variables never active in the initial training data.<n>We address this by designing the initial training data to achieve complete marginal bit coverage, namely, ensuring that every binary variable obtained by one-hot encoding takes the value one at least once.
  arXiv  Detail & Related papers  (2026-05-06T12:16:34Z)
• Quantum feedback algorithms for DNA assembly using FALQON variants [31.458406135473805]
  We analyze long-read DNA fragments from SARS-CoV-2 and human DNA using standard FALQON, second-order FALQON (SO-FALQON), and time-rescaled FALQON (TR-FALQON)<n> Numerical results show that both variants improve convergence to the ground state and increase success probabilities at reduced circuit depths.
  arXiv  Detail & Related papers  (2026-02-24T16:44:24Z)
• Effectiveness of Binary Autoencoders for QUBO-Based Optimization Problems [0.669087470775851]
  In black-box optimization, objective evaluations are often expensive, so high quality solutions must be found under a limited budget.<n>Recent work combines FMQA with a binary autoencoder that learns a compact binary latent code from feasible solutions.<n>We show that the bAE reconstructs feasible tours accurately and, compared with manually designed encodings at similar compression, better aligns tour distances with latent Hamming distances.
  arXiv  Detail & Related papers  (2026-02-10T17:59:29Z)
• Eigen-1: Adaptive Multi-Agent Refinement with Monitor-Based RAG for Scientific Reasoning [53.45095336430027]
  We develop a unified framework that combines implicit retrieval and structured collaboration.<n>On Humanity's Last Exam (HLE) Bio/Chem Gold, our framework achieves 48.3% accuracy.<n>Results on SuperGPQA and TRQA confirm robustness across domains.
  arXiv  Detail & Related papers  (2025-09-25T14:05:55Z)
• Comparative Studies of Quantum Annealing, Digital Annealing, and Classical Solvers for Reaction Network Pathway Analysis and mRNA Codon Selection [0.0]
  Digital and quantum annealers have the potential to identify near-optimal solutions for optimisation problems.<n>This work benchmarks two use cases to evaluate the utility of QUBO solvers for optimization problems.<n>For reaction pathway analysis, classical MIP/CP solvers are observed to solve the problem to optimality in reasonable time frames.
  arXiv  Detail & Related papers  (2025-09-11T21:22:50Z)
• Regulatory DNA sequence Design with Reinforcement Learning [56.20290878358356]
  We propose a generative approach that leverages reinforcement learning to fine-tune a pre-trained autoregressive model.<n>We evaluate our method on promoter design tasks in two yeast media conditions and enhancer design tasks for three human cell types.
  arXiv  Detail & Related papers  (2025-03-11T02:33:33Z)
• KodCode: A Diverse, Challenging, and Verifiable Synthetic Dataset for Coding [49.56049319037421]
  KodCode is a synthetic dataset that addresses the persistent challenge of acquiring high-quality, verifiable training data.<n>It comprises question-solution-test triplets that are systematically validated via a self-verification procedure.<n>This pipeline yields a large-scale, robust and diverse coding dataset.
  arXiv  Detail & Related papers  (2025-03-04T19:17:36Z)
• A Fresh Look at Generalized Category Discovery through Non-negative Matrix Factorization [83.12938977698988]
  Generalized Category Discovery (GCD) aims to classify both base and novel images using labeled base data. Current approaches inadequately address the intrinsic optimization of the co-occurrence matrix $barA$ based on cosine similarity. We propose a Non-Negative Generalized Category Discovery (NN-GCD) framework to address these deficiencies.
  arXiv  Detail & Related papers  (2024-10-29T07:24:11Z)
• A resource-efficient variational quantum algorithm for mRNA codon optimization [0.5120567378386615]
  optimizing the mRNA codon has an essential impact on gene expression for a specific target protein. This research presents a way to encode codons for implementing mRNA codon optimization via the variational quantum eigensolver algorithms on a gate-based quantum computer.
  arXiv  Detail & Related papers  (2024-04-23T09:23:22Z)
• Quantum Annealing Solutions for the Closest String Problem with D-Wave Systems [0.0]
  Closest String Problem is an NP-complete problem which appears more commonly in bioinformatics and coding theory. Two QUBO formulations have been proposed, with one being a slight modification over the other. DWave annealers have been used, while providing guidelines for optimality on certain platform-specific concerns.
  arXiv  Detail & Related papers  (2023-10-19T16:03:25Z)
• Deciphering RNA Secondary Structure Prediction: A Probabilistic K-Rook Matching Perspective [63.3632827588974]
  We introduce RFold, a method that learns to predict the most matching K-Rook solution from the given sequence. RFold achieves competitive performance and about eight times faster inference efficiency than state-of-the-art approaches.
  arXiv  Detail & Related papers  (2022-12-02T16:34:56Z)
• Infinite-Dimensional Sparse Learning in Linear System Identification [0.2867517731896504]
  This paper proposes an infinite-dimensional sparse learning algorithm based on atomic norm regularization. The difficulty in solving the problem lies in the fact that there are an infinite number of possible atomic models.
  arXiv  Detail & Related papers  (2022-03-28T13:18:48Z)
• Fast Batch Nuclear-norm Maximization and Minimization for Robust Domain Adaptation [154.2195491708548]
  We study the prediction discriminability and diversity by studying the structure of the classification output matrix of a randomly selected data batch. We propose Batch Nuclear-norm Maximization and Minimization, which performs nuclear-norm on the target output matrix to enhance the target prediction ability. Experiments show that our method could boost the adaptation accuracy and robustness under three typical domain adaptation scenarios.
  arXiv  Detail & Related papers  (2021-07-13T15:08:32Z)

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.