Sequence Search: Automated Sequence Design using Neural Architecture Search

• URL: http://arxiv.org/abs/2604.14788v1
• Date: Thu, 16 Apr 2026 08:50:22 GMT
• Title: Sequence Search: Automated Sequence Design using Neural Architecture Search
• Abstract summary: "Sequence Search" is an automated sequence design framework based on neural architecture search.<n>The framework successfully replicated conventional spin-echo, T2-weighted spin-echo, and inversion recovery sequences.
• Score: 2.827594783979491
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Developing an MR sequence is challenging and remains largely constrained by human intuition. Recently, AI-driven approaches have been proposed; however, most require an initial sequence for parameter optimization or extensive training datasets, limiting their general applicability. In this study, we propose "Sequence Search," an automated sequence design framework based on neural architecture search. The method takes tissue properties, imaging parameters, and design objectives as inputs and generates pulse sequences satisfying the design objectives, without requiring prior knowledge of conventional sequence structures. Sequence Search iteratively generates candidate sequences through neural architecture search and optimizes them via a differentiable Bloch simulator and objective-specific loss functions using gradient-based learning. The framework successfully replicated conventional spin-echo, T2-weighted spin-echo, and inversion recovery sequences. Less intuitive solutions were also discovered, such as three-RF spin-echo-like sequences with reduced RF energy and refocusing phases deviating from the conventional Hahn-echo. This work establishes a generalizable framework for automated MR sequence design, highlighting the potential to explore configurations beyond conventional designs based on human intuition.

Related papers

• Neuro-Evolved Heuristics for Variable Gapped Common Subsequence Identification [40.920500181764986]
  This study addresses the Variable Gapped Longest Common Subsequence Problem (VGLCSP)<n>VGLCSP is a variant of the classical longest common subsequence problem with additional gap constraints.<n>We propose a learning-based approach for automatically designing more effective data-driven robustnesss.
  arXiv  Detail & Related papers  (2026-08-01T22:36:35Z)
• Spanning Tree Autoregressive Visual Generation [51.7635842702602]
  We present Spanning Tree Autoregressive (STAR) modeling, which can incorporate prior knowledge of images, such as center bias and locality, to maintain sampling performance.
  arXiv  Detail & Related papers  (2025-11-21T09:45:17Z)
• 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)
• Warmup Generations: A Task-Agnostic Approach for Guiding Sequence-to-Sequence Learning with Unsupervised Initial State Generation [34.55224347308013]
  Traditional supervised fine-tuning (SFT) strategies for sequence-to-sequence tasks often train models to directly generate the target output.<n>We introduce a task-agnostic framework that enables models to generate intermediate "upwarm" sequences.<n>We show that our approach outperforms traditional SFT methods, and offers a scalable and flexible solution for sequence-to-sequence tasks.
  arXiv  Detail & Related papers  (2025-02-17T20:23:42Z)
• Decoupled Sequence and Structure Generation for Realistic Antibody Design [45.72237864940556]
  A dominant paradigm is to train a model to jointly generate the antibody sequence and the structure as a candidate.<n>We propose an antibody sequence-structure decoupling (ASSD) framework, which separates sequence generation and structure prediction.<n>ASSD shows improved performance in various antibody design experiments, while the composition-based objective successfully mitigates token repetition of non-autoregressive models.
  arXiv  Detail & Related papers  (2024-02-08T13:02:05Z)
• Retrieving Continuous Time Event Sequences using Neural Temporal Point Processes with Learnable Hashing [24.963828650935913]
  We propose NeuroSeqRet, a first-of-its-kind framework designed specifically for end-to-end CTES retrieval. We develop four variants of the relevance model for different kinds of applications based on the trade-off between accuracy and efficiency. Our experiments show the significant accuracy boost of NeuroSeqRet as well as the efficacy of our hashing mechanism.
  arXiv  Detail & Related papers  (2023-07-13T18:54:50Z)
• Protein Design with Guided Discrete Diffusion [67.06148688398677]
  A popular approach to protein design is to combine a generative model with a discriminative model for conditional sampling. We propose diffusioN Optimized Sampling (NOS), a guidance method for discrete diffusion models. NOS makes it possible to perform design directly in sequence space, circumventing significant limitations of structure-based methods.
  arXiv  Detail & Related papers  (2023-05-31T16:31:24Z)
• HKNAS: Classification of Hyperspectral Imagery Based on Hyper Kernel Neural Architecture Search [104.45426861115972]
  We propose to directly generate structural parameters by utilizing the specifically designed hyper kernels. We obtain three kinds of networks to separately conduct pixel-level or image-level classifications with 1-D or 3-D convolutions. A series of experiments on six public datasets demonstrate that the proposed methods achieve state-of-the-art results.
  arXiv  Detail & Related papers  (2023-04-23T17:27:40Z)
• Diversifying Design of Nucleic Acid Aptamers Using Unsupervised Machine Learning [54.247560894146105]
  Inverse design of short single-stranded RNA and DNA sequences (aptamers) is the task of finding sequences that satisfy a set of desired criteria. We propose to use an unsupervised machine learning model known as the Potts model to discover new, useful sequences with controllable sequence diversity.
  arXiv  Detail & Related papers  (2022-08-10T13:30:58Z)
• Benchmarking deep generative models for diverse antibody sequence design [18.515971640245997]
  Deep generative models that learn from sequences alone or from sequences and structures jointly have shown impressive performance on this task. We consider three recently proposed deep generative frameworks for protein design: (AR) the sequence-based autoregressive generative model, (GVP) the precise structure-based graph neural network, and Fold2Seq that leverages a fuzzy and scale-free representation of a three-dimensional fold. We benchmark these models on the task of computational design of antibody sequences, which demand designing sequences with high diversity for functional implication.
  arXiv  Detail & Related papers  (2021-11-12T16:23:32Z)
• HpGAN: Sequence Search with Generative Adversarial Networks [21.770047587104923]
  This article proposes a novel method, called HpGAN, to search desired sequences algorithmically using generative adversarial networks (GAN) HpGAN is based on the idea of zero-sum game to train a generative model, which can generate sequences with characteristics similar to the training sequences.
  arXiv  Detail & Related papers  (2020-12-10T13:05:20Z)
• AdaLead: A simple and robust adaptive greedy search algorithm for sequence design [55.41644538483948]
  We develop an easy-to-directed, scalable, and robust evolutionary greedy algorithm (AdaLead) AdaLead is a remarkably strong benchmark that out-competes more complex state of the art approaches in a variety of biologically motivated sequence design challenges.
  arXiv  Detail & Related papers  (2020-10-05T16:40:38Z)
• Iterative Algorithm Induced Deep-Unfolding Neural Networks: Precoding Design for Multiuser MIMO Systems [59.804810122136345]
  We propose a framework for deep-unfolding, where a general form of iterative algorithm induced deep-unfolding neural network (IAIDNN) is developed. An efficient IAIDNN based on the structure of the classic weighted minimum mean-square error (WMMSE) iterative algorithm is developed. We show that the proposed IAIDNN efficiently achieves the performance of the iterative WMMSE algorithm with reduced computational complexity.
  arXiv  Detail & Related papers  (2020-06-15T02:57:57Z)

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.