VisionHOPE: Visual Backbones as Self-Modifying Learning Systems

Siran Peng, Tianshuo Zhang, Tianyu Fu, Weisong Zhao, Haoyuan Zhang, Jiankuo Zhao, Minghui Wu, Ping Jiang and 3 others

Mininglamp Technology · CASIA · UCAS · M.U.S.T.

Published September 27, 2026 · on the feed September 29, 2026 · ▲ 215 · arXiv 2609.33325

The abstract

Visual backbones have evolved from Convolutional Neural Networks (CNNs) with local aggregation to Vision Transformers (ViTs) with global interactions, State-Space Models (SSMs) with input-dependent state transitions, and Test-Time Training (TTT) layers that adapt an inner learner while processing an image. Across this progression, visual computation has become increasingly adaptive to each input, yet the rules governing that adaptation remain largely prescribed by the trained backbone. We introduce VisionHOPE, the first generic visual backbone formulated as a self-modifying learning system, in which what the model remembers and how it learns co-evolve within an image. Building on the self-referential construction of Nested Learning (NL), VisionHOPE realizes this co-evolution through five coupled memories that store content, generate key and value representations, and govern learning rate and retention. These memories evolve jointly as visual context accumulates along each scan. However, directly applying the unconstrained self-referential update to a visual backbone leads to instability. We therefore derive a stability-matched step-size control scheme that combines a soft cap on self-referential injection with a spectral clamp on the retained memory transition, and prove that the resulting memory dynamics are non-expansive along each scan. For two-dimensional feature maps, we adapt NL's chunk formulation by aligning chunks with image rows and columns across four directional scans. The proposed VisionHOPE achieves competitive results on ImageNet-1K, COCO, and ADE20K, establishing self-modifying learning systems as a practical foundation for general-purpose visual backbones. The code is available at https://github.com/PSRben/VisionHOPE.

The Brief

2:59

A short podcast summary of the paper. Written and voiced by AI.

Transcript

VisionHOPE. Visual Backbones as Self-Modifying Learning Systems. By Siran Peng and ten others, from Mininglamp Technology, the Institute of Automation, Chinese Academy of Sciences, and two other institutions. Published on the twenty-seventh of September. Its code repository is worked out: about one hundred and ten source files, with a readme and a licence.

Visual backbones have moved through a sequence of designs. Convolutional Neural Networks aggregate locally. Vision Transformers interact globally. State-Space Models make their state transitions depend on the input. And Test-Time Training layers adapt an inner learner while an image is being processed. Along that path, computation has grown steadily more adaptive to each input. What has not changed much is who sets the rules for that adaptation. Those rules are still largely prescribed by the trained backbone. A model may update some inner state as it reads an image, but the way it updates was fixed when training ended. That is the next step the progression has not yet taken.

VisionHOPE is presented as the first generic visual backbone formulated as a self-modifying learning system. Within a single image, what the model remembers and how it learns evolve together. Memory and learning rule are not separate things set at different times. Both change as the image is read, and each shapes the other. It builds on the self-referential construction of Nested Learning, abbreviated NL.

The co-evolution is carried by five coupled memories. Between them they store content, generate key and value representations, and govern the learning rate and how much is retained. All five evolve jointly as visual context builds up along each scan. Notice that two of the five are about learning itself: the rate at which things change, and how much is kept. Those are exactly the quantities a conventional backbone would fix in advance.

Applying the unconstrained self-referential update directly to a visual backbone turns out to be unstable, so the authors derive a stability-matched control scheme for the step size. It combines a soft cap on self-referential injection with a spectral clamp on the retained memory transition, and they prove that the resulting memory dynamics are non-expansive along each scan. Images are two-dimensional, so a further adaptation is needed. The chunk formulation from NL is aligned with the rows and columns of the image, across four directional scans. The sequence-style machinery of the original construction is thereby fitted to the grid of an image, with each scan direction reading the feature map in its own order.

VisionHOPE reports competitive results on ImageNet-1K, on COCO, and on ADE20K. On the strength of those results the authors argue that self-modifying learning systems are a practical foundation for general-purpose visual backbones. The code is available.

Each earlier backbone made the computation more responsive to its input while keeping the learning rule fixed. VisionHOPE lets the learning rule move too, inside one image, and then spends real effort making sure that movement stays bounded. The stability proof is what turns a self-referential idea into something that can sit underneath ordinary vision tasks.

Paper Quest · 6 chapters · about 35 min

Play this paper

Learn it by doing: make the calls the authors made, guess the result before you see it, and defend it in a viva graded on your own words. Chapter 1 is right here.

Chapter 1 🧩 · The problem

Vision backbones keep getting more adaptive. One thing has not moved yet.

You are designing a vision backbone. Each generation has grown more adaptive to the image: local kernels, then global attention, then input-dependent states, then inner learners updated while reading the image.

The road ahead

  1. 1 · The problem ~7 min Vision backbones have grown steadily more adaptive to each image, but the rule for how they adapt is still frozen once training ends.
  2. 2 · The key idea ~9 min Make the learning rate and retention into memories that update while the image is read, so the learning rule itself adapts inside the image.
  3. 3 · Choose your own research ~3 min
  4. 4 · Build the method ~8 min Take Nested Learning's self-referential memories, evolve five of them per scan, keep the updates stable, and fit the chunks to image rows and columns.
  5. 5 · What they found ~3 min
  6. 6 · The viva ~5 min Three questions from the examiners, answered in your own words. Win it for the paper’s trophy.
Join free to play the whole quest ›

Free, with Google or an email address. Your stars and progress are kept.

KipQuest: the day’s AI research, as podcasts and quests. All papers Android app Privacy Contact Episodes are written and voiced by AI from each paper. Summaries can contain mistakes: the paper is the source.