The Geno-Synthetic Algorithm: Type-Factored Coevolutionary Optimization for Heterogeneous Genotypes and Assembled Phenotypes

• URL: http://arxiv.org/abs/2605.13365v1
• Date: Wed, 13 May 2026 11:25:24 GMT
• Title: The Geno-Synthetic Algorithm: Type-Factored Coevolutionary Optimization for Heterogeneous Genotypes and Assembled Phenotypes
• Abstract summary: Geno-Synthetic Algorithm (GSA) is a type-factored coevolutionary framework in which gene families are partitioned by representational type.<n>GSA is formalized as a typed product-space search procedure with an explicit assembly operator.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Many real-world optimization problems are not naturally homogeneous vectors but composite design objects with heterogeneous parameters: integers, real values, Booleans, categoricals, complex-valued descriptors, and embedding vectors. Standard evolutionary algorithms flatten these into a single chromosome and apply generic operators with rounding and repair, sacrificing representational fidelity. We introduce the Geno-Synthetic Algorithm (GSA), a type-factored coevolutionary framework in which gene families are partitioned by representational type, evolved in parallel with type-native operators, and assembled into executable phenotypes for joint fitness evaluation. GSA is formalized as a typed product-space search procedure with an explicit assembly operator. An open-source reference implementation (gsa-experiments, MIT-licensed) is released. A focused empirical study compares eight GSA variants against five baselines across seven benchmark problems (six synthetic plus the external COCO BBOB-MixInt suite) at budgets from 5,000 to 100,000 evaluations. The headline finding is architectural: GSA is the only method that operates when gene families include complex-valued descriptors or embedding vectors. On smooth synthetic multi-family problems, well-tuned flattened differential evolution remains the strongest baseline; on BBOB-MixInt at 100,000 evaluations, GSA_DIRECT becomes statistically indistinguishable from FLATTENED_DE while FLATTENED_EA drops from second to fifth rank, an asymptotic crossover. Ablations confirm that type-native operators are essential, elite credit dominates ensemble credit, and active assembly outperforms passive concatenation on gated benchmarks. The framework extends naturally to prompt and embedding optimization for large language model systems.

Related papers

• Influence-Guided Symbolic Regression: Scientific Discovery via LLM-Driven Equation Search with Granular Feedback [56.69850045068714]
  We introduce textitInfluence-Guided Regression (IGSR), a method that frames equation discovery as an iterative two-step process.<n>We demonstrate IGSRs effectiveness on a diverse suite of benchmarks, including LLM-SRBench, pharmacological PKPD models, an epidemiological simulation, and real-world genomic data.
  arXiv  Detail & Related papers  (2026-05-27T23:48:01Z)
• SAVE: A Generalizable Framework for Multi-Condition Single-Cell Generation with Gene Block Attention [10.404186274295222]
  SAVE is a unified generative framework based on conditional Transformers for single-cell modeling.<n>We evaluate SAVE on a range of benchmarks including conditional generation, batch effect correction, and perturbation prediction.<n>Save offers a scalable and generalizable solution for modeling complex single-cell data.
  arXiv  Detail & Related papers  (2026-04-18T01:45:16Z)
• STABLE: Efficient Hybrid Nearest Neighbor Search via Magnitude-Uniformity and Cardinality-Robustness [59.119196450578364]
  Hybrid Approximate Nearest Neighbor Search (Hybrid ANNS) is a foundational search technology for large-scale heterogeneous data.<n>We propose the robuSt heTerogeneity-Aware hyBrid retrievaL framEwork, STABLE, to overcome the Compatibility Barrier for Similarity Magnitude Heterogeneity and the Tolerance Bottleneck to Attribute Cardinality.
  arXiv  Detail & Related papers  (2026-04-02T04:52:35Z)
• Amortized Molecular Optimization via Group Relative Policy Optimization [38.75198089892667]
  We introduce GRXForm, adapting a pre-trained Graph Transformer model that optimize molecules via sequential atom-and-bond additions.<n> GRXForm generalizes to out-of-distribution molecular scaffolds without inference-time oracle calls or refinement.
  arXiv  Detail & Related papers  (2026-02-12T16:43:59Z)
• Beyond Independent Genes: Learning Module-Inductive Representations for Gene Perturbation Prediction [48.80217316452559]
  scBIG is a module-inductive prediction framework that explicitly models coordinated gene programs.<n> scBIG consistently outperforms state-of-the-art methods, particularly on unseen and perturbation settings.
  arXiv  Detail & Related papers  (2026-02-03T16:43:40Z)
• Generalization and Completeness of Stochastic Local Search Algorithms [0.0]
  We generalize Local Search (SLS) algorithms into a unique formal model.<n>This model has two key components: a common structure designed to be as large as possible and a parametric structure intended to be as small as possible.<n>We use our model to prove the Turing-completeness of SLS algorithms in general.
  arXiv  Detail & Related papers  (2026-01-20T18:17:45Z)
• Sequential, Parallel and Consecutive Hybrid Evolutionary-Swarm Optimization Metaheuristics [43.05659890525653]
  This paper explores hybrid evolutionary-swarm metaheuristics that combine the features of PSO and GA in a sequential, parallel and consecutive manner.<n>The experimental results demonstrate that the hybrid approaches achieve superior convergence and consistency.<n>The paper introduces a novel consecutive hybrid PSO-GA evolutionary algorithm that ensures continuity between PSO and GA steps through explicit information transfer mechanisms.
  arXiv  Detail & Related papers  (2025-08-01T00:23:36Z)
• GenoMAS: A Multi-Agent Framework for Scientific Discovery via Code-Driven Gene Expression Analysis [12.311957227670598]
  GenoMAS orchestrates six specialized agents through typed message-passing protocols.<n>At the heart of GenoMAS lies a guided-planning framework.<n>GenoMAS surfaces biologically plausible gene-phenotype associations corroborated by the literature.
  arXiv  Detail & Related papers  (2025-07-28T17:55:08Z)
• UniGenX: a unified generative foundation model that couples sequence, structure and function to accelerate scientific design across proteins, molecules and materials [62.72989417755985]
  We present UniGenX, a unified generative model for function in natural systems.<n>UniGenX represents heterogeneous inputs as a mixed stream of symbolic and numeric tokens.<n>It achieves state-of-the-art or competitive performance for the function-aware generation across domains.
  arXiv  Detail & Related papers  (2025-03-09T16:43:07Z)
• Factorizers for Distributed Sparse Block Codes [45.29870215671697]
  We propose a fast and highly accurate method for factorizing distributed block codes (SBCs) Our iterative factorizer introduces a threshold-based nonlinear activation, conditional random sampling, and an $ell_infty$-based similarity metric. We demonstrate the feasibility of our method on four deep CNN architectures over CIFAR-100, ImageNet-1K, and RAVEN datasets.
  arXiv  Detail & Related papers  (2023-03-24T12:31:48Z)
• Optimal Clustering with Bandit Feedback [57.672609011609886]
  This paper considers the problem of online clustering with bandit feedback. It includes a novel stopping rule for sequential testing that circumvents the need to solve any NP-hard weighted clustering problem as its subroutines. We show through extensive simulations on synthetic and real-world datasets that BOC's performance matches the lower boundally, and significantly outperforms a non-adaptive baseline algorithm.
  arXiv  Detail & Related papers  (2022-02-09T06:05:05Z)
• Genetic Programming is Naturally Suited to Evolve Bagging Ensembles [0.0]
  We show that minor changes to fitness evaluation and selection are sufficient to make a simple and otherwise-traditional GP algorithm evolve efficiently. Our algorithm fares very well against state-of-the-art ensemble and non-ensemble GP algorithms.
  arXiv  Detail & Related papers  (2020-09-13T16:28:11Z)
• Semantically-Oriented Mutation Operator in Cartesian Genetic Programming for Evolutionary Circuit Design [0.5414308305392761]
  We propose a semantically-oriented mutation operator (SOMO) suitable for the evolutionary design of combinational circuits. Compared to the common CGP and its variants, the proposed method converges on common Boolean benchmarks substantially faster. The most complex circuits were evolved in less than one hour with a single-thread implementation running on a common CPU.
  arXiv  Detail & Related papers  (2020-04-23T08:15:48Z)

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.