Neural Genetic Search in Discrete Spaces

• URL: http://arxiv.org/abs/2502.10433v2
• Date: Mon, 16 Jun 2025 20:45:59 GMT
• Title: Neural Genetic Search in Discrete Spaces
• Abstract summary: We introduce a novel test-time search method, Neural Genetic Search (NGS)<n>NGS incorporates the evolutionary mechanism of genetic algorithms into the generation procedure of deep models.<n>This approach offers a versatile and easy-to-implement search algorithm for deep generative models.
• Score: 14.666165546724159
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Effective search methods are crucial for improving the performance of deep generative models at test time. In this paper, we introduce a novel test-time search method, Neural Genetic Search (NGS), which incorporates the evolutionary mechanism of genetic algorithms into the generation procedure of deep models. The core idea behind NGS is its crossover, which is defined as parent-conditioned generation using trained generative models. This approach offers a versatile and easy-to-implement search algorithm for deep generative models. We demonstrate the effectiveness and flexibility of NGS through experiments across three distinct domains: routing problems, adversarial prompt generation for language models, and molecular design.

Related papers

• GENERator: A Long-Context Generative Genomic Foundation Model [66.46537421135996]
  We present a generative genomic foundation model featuring a context length of 98k base pairs (bp) and 1.2B parameters.<n>The model adheres to the central dogma of molecular biology, accurately generating protein-coding sequences.<n>It also shows significant promise in sequence optimization, particularly through the prompt-responsive generation of promoter sequences.
  arXiv  Detail & Related papers  (2025-02-11T05:39:49Z)
• Heuristically Adaptive Diffusion-Model Evolutionary Strategy [1.8299322342860518]
  Diffusion Models represent a significant advancement in generative modeling. Our research reveals a fundamental connection between diffusion models and evolutionary algorithms. Our framework marks a major algorithmic transition, offering increased flexibility, precision, and control in evolutionary optimization processes.
  arXiv  Detail & Related papers  (2024-11-20T16:06:28Z)
• Neural Lineage [56.34149480207817]
  We introduce a novel task known as neural lineage detection, aiming at discovering lineage relationships between parent and child models. For practical convenience, we introduce a learning-free approach, which integrates an approximation of the finetuning process into the neural network representation similarity metrics. For the pursuit of accuracy, we introduce a learning-based lineage detector comprising encoders and a transformer detector.
  arXiv  Detail & Related papers  (2024-06-17T01:11:53Z)
• Discovering Physics-Informed Neural Networks Model for Solving Partial Differential Equations through Evolutionary Computation [5.8407437499182935]
  This article proposes an evolutionary computation method aimed at discovering the PINNs model with higher approximation accuracy and faster convergence rate. In experiments, the performance of different models that are searched through Bayesian optimization, random search and evolution is compared in solving Klein-Gordon, Burgers, and Lam'e equations.
  arXiv  Detail & Related papers  (2024-05-18T07:32:02Z)
• An automatic selection of optimal recurrent neural network architecture for processes dynamics modelling purposes [0.0]
  The research has included four original proposals of algorithms dedicated to neural network architecture search. Algorithms have been based on well-known optimisation techniques such as evolutionary algorithms and gradient descent methods. The research involved an extended validation study based on data generated from a mathematical model of the fast processes occurring in a pressurised water nuclear reactor.
  arXiv  Detail & Related papers  (2023-09-25T11:06:35Z)
• A Survey on Generative Diffusion Model [75.93774014861978]
  Diffusion models are an emerging class of deep generative models. They have certain limitations, including a time-consuming iterative generation process and confinement to high-dimensional Euclidean space. This survey presents a plethora of advanced techniques aimed at enhancing diffusion models.
  arXiv  Detail & Related papers  (2022-09-06T16:56:21Z)
• JANUS: Parallel Tempered Genetic Algorithm Guided by Deep Neural Networks for Inverse Molecular Design [1.6114012813668934]
  Inverse molecular design, i.e., designing molecules with specific target properties, can be posed as an optimization problem. Janus is a genetic algorithm inspired by parallel tempering that propagates two populations, one for exploration and another for exploitation. Janus is augmented by a deep neural network that approximates molecular properties via active learning for enhanced sampling of the chemical space.
  arXiv  Detail & Related papers  (2021-06-07T23:41:34Z)
• Deep Bayesian Active Learning for Accelerating Stochastic Simulation [74.58219903138301]
  Interactive Neural Process (INP) is a deep active learning framework for simulations and with active learning approaches. For active learning, we propose a novel acquisition function, Latent Information Gain (LIG), calculated in the latent space of NP based models. The results demonstrate STNP outperforms the baselines in the learning setting and LIG achieves the state-of-the-art for active learning.
  arXiv  Detail & Related papers  (2021-06-05T01:31:51Z)
• 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)
• Factorized Deep Generative Models for Trajectory Generation with Spatiotemporal-Validity Constraints [10.960924101404498]
  Deep generative models for trajectory data can learn expressively explanatory models for sophisticated latent patterns. We first propose novel deep generative models factorizing time-variant and time-invariant latent variables. We then develop new inference strategies based on variational inference and constrained optimization to thetemporal validity.
  arXiv  Detail & Related papers  (2020-09-20T02:06:36Z)
• Guiding Deep Molecular Optimization with Genetic Exploration [79.50698140997726]
  We propose genetic expert-guided learning (GEGL), a framework for training a deep neural network (DNN) to generate highly-rewarding molecules. Extensive experiments show that GEGL significantly improves over state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-07-04T05:01:26Z)

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.