Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2512.04097

MultiGA: Leveraging Multi-Source Seeding in Genetic Algorithms

Isabelle Diana May-Xin Ng·Tharindu Cyril Weerasooriya·Haitao Zhu·Wei Wei
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we introduce, MultiGA, an optimization framework which applies genetic algorithm principles to address complex natural language tasks and reasoning problems by sampling from a diverse population of LLMs to initialize the population of candidate solutions. MultiGA generates a range of outputs from various parent LLMs and uses a neutral fitness function to evaluate them. Through an iterative recombination process, we mix and refine these generations until an optimal solution is achieved. Our results show that MultiGA produces high accuracy across multiple benchmarks, and these insights lay the foundation for future research looking closer at integrating multiple LLMs for unexplored tasks in which selecting only one pre-trained model is unclear or suboptimal.

Explore related subjects

cs.NEcs.AI

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Isabelle Diana May-Xin Ng, Tharindu Cyril Weerasooriya, Haitao Zhu, Wei Wei. 2026-04-02. MultiGA: Leveraging Multi-Source Seeding in Genetic Algorithms. https://arxiv.org/abs/2512.04097

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Meta-Representational Predictive Coding: Neuroscience-Informed Self-Supervised Learning

Self-supervised learning has become an important paradigm in the domains of machine intelligence and computational neuroscience. Nevertheless, current work on self-supervised learning (SSL) relies on biologically implausible credit assignment, i.e., backpropagation of errors, and feedforward inference, i.e., a sequential, non-parallel flow of information. Predictive coding (PC) offers a biologically plausible means to avoid backprop-specific limitations. However, unsupervised PC requires learning a generative model of raw input, which entails predicting high dimensional input; on the other hand, supervised PC learns a mapping between inputs to target labels and thus requires human annotation and incurs the drawbacks of supervised learning. In this work, we present a neuroscience-informed SSL model based on PC and active perception that we call meta-representational predictive coding (MPC). MPC sidesteps the need for a generative model of sensory input by learning to predict representations of data across parallel streams, resulting in an encoder-only learning-and-inference scheme.

cs.NE↗
arXiv2026

Sensing to Intelligence: Principles for Neuromorphic Circuits and Systems

Neuromorphic engineering began with the idea that the physical behavior of a system could itself be used for computation, taking inspiration from the way nervous systems sense, adapt, and evolve in time. The field has since expanded far beyond its early analog circuits to include event-based sensors, spiking processors, emerging memory devices, mixed-signal systems, and large-scale neural accelerators. With this expansion, however, the meaning of neuromorphic has become increasingly broad. In this Perspective, we argue that neuromorphic engineering should be defined neither by resemblance to biological components nor by any particular device, signal representation, or substrate. Its potential lies in identifying computational principles in biological systems and translating them into the organization and dynamics of artificial machines. A system is truly neuromorphic when the invoked biological or physical principle plays a causal, design-relevant role in how information is represented, how state evolves, or what capability the complete system achieves. We develop this view across sensing, collective computation, memory, learning, and interaction. Adaptation, nonlinear dynamics, attractor structure, variability, and closed-loop action illustrate how computation can be embedded in a machine's evolving physical state. From these examples, we identify a set of design principles for neuromorphic systems. As neuromorphic engineering moves toward wider deployment, this perspective shifts the central question from how closely machines resemble nervous systems to what computation becomes possible when their principles are understood and deliberately translated into new machines.

cs.NE↗
arXiv2026

Continuous Spiking Graph Neural Networks

Continuous graph neural networks (CGNNs) have garnered significant attention due to their ability to generalize existing discrete graph neural networks (GNNs) by introducing continuous dynamics. They typically draw inspiration from diffusion-based methods to introduce a novel propagation scheme, which is analyzed using ordinary differential equations (ODE). However, the implementation of CGNNs requires significant computational power, making them challenging to deploy on battery-powered devices. Inspired by recent spiking neural networks (SNNs), which emulate a biological inference process and provide an energy-efficient neural architecture, we incorporate the SNNs with CGNNs in a unified framework, named Continuous Spiking Graph Neural Networks (COS-GNN). We employ SNNs for graph node representation at each time step, which are further integrated into the ODE process along with time. To enhance information preservation and mitigate information loss in SNNs, we introduce the high-order structure of COS-GNN, which utilizes the second-order ODE for spiking representation and continuous propagation. Moreover, we provide the theoretical proof that COS-GNN effectively mitigates the issues of exploding and vanishing gradients, enabling us to capture long-range dependencies between nodes. Experimental results on graph-based learning tasks demonstrate the effectiveness of the proposed COS-GNN over competitive baselines.

cs.NE↗