mlsanityData to 14 Oct 2026

GrapNet: A Programmable Dynamic-Architecture Neural Graph Substrate

arXiv 2606.18923 ↗First posted 17 Jun 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Programmability is a missing first-class interface in fixed-tensor neural networks: editing a relation, freezing a subgraph, auditing a local function, or changing the execution backend should be an operation on the neural program rather than ad-hoc parameter surgery. GrapNet studies this graph-as-network setting. The graph is the architecture and executable program, not an input data graph. Each compute node owns its next-layer child references and a trainable allocation vector aligned with those references; deleting a relation physically removes both the child reference and the corresponding allocation coordinate. Structural rules and execution policies live outside the node core, so the same child-owned graph can be grown, frozen, structurally edited, grouped into trainable family blocks, routed by attention over active relations, or lowered to dense snapshots after topology stabilizes. GrapNet composes with conventional modules through a vector-valued parent interface: dense layers, CNN encoders, ResNet feature extractors, attention blocks, and transformer representations can all feed one sensory GrapNode per coordinate. The evaluation is organized as a programmability stress suite rather than as a new replay benchmark. In a matched ten-seed Split Fashion-MNIST study, a plastic GrapNet+ER head reaches 63.16 percent seen-class accuracy versus 51.08 percent for a parameter-larger dense MLP+ER under the same seen-class loss and replay memory, with paired delta 12.08 points and p=1.3e-5. On Split CIFAR-10 with a frozen ImageNet ResNet-18 encoder, the same substrate improves the online head over MLP-256 by 3.81 points, with p=0.0026. These results support GrapNet as an editable neural graph substrate whose core value is structural programmability with faithful execution views.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 15 of its 21 references that are in the map. First posted on arXiv 17 Jun 2026.

Builds on

15 of 21 references.

References · 15

  1. 2017Attention Is All You Needcited by 60,361
  2. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  3. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  4. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
  5. 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,434
  6. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  7. 2016Progressive Neural Networkscited by 1,361
  8. 2021Learning to Prompt for Continual Learningcited by 944
  9. 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 911
  10. 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 898
  11. 2017Lifelong Learning with Dynamically Expandable Networkscited by 694
  12. 2018Overcoming catastrophic forgetting with hard attention to the taskcited by 681
3 more
  1. 2019Rigging the Lottery: Making All Tickets Winnerscited by 495
  2. 2021DyTox: Transformers for Continual Learning with DYnamic TOken eXpansioncited by 291
  3. 2022Class-Incremental Continual Learning into the eXtended DER-versecited by 124

Built on by

Not cited yet.