Skip to content

Tensor-Accelerated Eager Multi-Resolution Grids for Evolving Large-Scale Substrates

Jul 2026 · Proceedings of the Genetic and Evolutionary Computation Conference Companion · pp. 533-536 · 0 citations · 10 references
Computer Science

TL;DR

This work presents Eager Multi-Resolution HyperNEAT (EMR-HyperNEAT), which reformulates adaptive substrate discovery as a batch tensor operation: shared position grids are precomputed for all depths, every position is evaluated in one vectorized CPPN call, then the same variance criterion filters the output.

Abstract

Evolvable-Substrate HyperNEAT (ES-HyperNEAT) discovers neural network topology by querying a Compositional Pattern-Producing Network (CPPN) at spatial positions and placing nodes where output variance is high. Its sequential quadtree cannot be tensorized directly: each network produces a different tree with dynamic shapes. We present Eager Multi-Resolution HyperNEAT (EMR-HyperNEAT), which reformulates adaptive substrate discovery as a batch tensor operation: shared position grids are precomputed for all depths, every position is evaluated in one vectorized CPPN call, then the same variance criterion filters the output. This tensor formulation supports population-level batching, one-time JIT compilation, chunked memory streaming, and six substrate configurations (feedforward through full recurrent) that sequential traversal could not support at scale. On the CRSP/Compustat financial dataset (94K samples), EMR-HyperNEAT achieves 5.5× speedup at depth 6; on XOR (pop 1000), 12–34× per-generation GPU speedup at depths 5–7 (~100× over 30 generations). The reformulation also discovers a superset of ES-HyperNEAT's positions, yielding higher empirical solve rates. We validate substrate evolution up to depth 13 (358M positions, streamed from disk).

Read PDF

Similar papers

#machine learning Preprint Aug 2026

On Scaling Coordinate-Based Neuroevolution: The Quadtree Bottleneck in ES-HyperNEAT

These findings define the structural constraints any substrate-discovery method must satisfy to scale coordinate-based neuroevolution; the companion EMR-HyperNEAT reformulation, which replaces adaptive subdivision with eager evaluation of a static multi-resolution grid, satisfies them and resolves the bottleneck this p...

Romain Claret, Michael O'Neill, Paul Cotofrei et al. · 0 citations
Preprint Aug 2026

FlashBoot: Sub-Second Weight Loading for Large Models at Rack Scale

FlashBoot is presented, a hardware-friendly, framework-workflow co-designed weight-loading subsystem built on SGLang that accelerates single-node weight loading by up to 50x and concurrent rack-level weight loading by>270x and scales poorly to concurrent multi-node bring-up.

Issac Zhu, Hscos Zhang, Ke Jiang et al. · 0 citations
Preprint Aug 2026

Adaptive Matrix Multiplication for Dynamic Shapes on Ascend NPUs

This work proposes AdaptCore, an adaptive framework for universally high-performance MatMul on Ascend NPUs, which systematically decouples operator optimization into spatial tiling and instruction orchestration and integrates a composable optimization library with a deterministic analytical performance model.

Yuhang Zhou, Jianglan Peng, Qian-Yu Jiang et al. · 0 citations
Open access Jul 2026

CoDSA: A Hybrid Tensor Compilation Framework Integrating Coordinate Descent with Dynamic Simulated Annealing

This paper proposes CoDSA (Coordinate Descent with Dynamic Simulated Annealing), a hybrid auto-tuning framework that integrates an enhanced Droplet Search algorithm into the Ansor ecosystem and introduces three improvements to the droplet coordinate descent strategy.

Rui-Ting Sun, Honglu He, Guan-Wen Zhang et al. · 0 citations
Jun 2026

ThunderGNN: Unlocking Tensor Cores for Graph Neural Networks

ThunderGNN is a hardware-aware acceleration system designed to reconcile graph irregularity with Tensor Core rigidity and significantly outperforms state-of-the-art systems, achieving geometric mean speedups of 1.89× over DGL and 2.59× over PyG.

Yuang Chen, Si-Yi Teng, Wen-Qi Zeng et al. · 0 citations
#machine learning Preprint Sep 2026

Affinity-Aware Sharding for Delayed Tensor Parallelism

It is shown that maximising the affinity between the KV heads and the FFN neurons co-located on a device, by permuting the dense model before sharding, speeds up the distillation or retraining process, and that the co-located affinity score at initialisation predicts the KL to the base model after training, across seve...

Eloi de Reynal · 0 citations

Related blog posts

MIT News · Artificial Intelligence Sep 29, 2026

Who we become when we talk to machines

Professor Sherry Turkle’s new book, “Artificial Intimacy,” offers a withering critique of chatbots and the antisocial dynamics she believes they encourage.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.