Skip to content

Successive Capacity Growth: Task-Complexity-Driven Width and Depth Expansion for Vision Transformer Encoders in JEPA World Models

Aug 2026 · 0 citations · 10 references
Computer Science

TL;DR

Successive Capacity Growth (SCG) is proposed, a method that starts from a minimal encoder and grows incrementally in width or depth and can grow successively as the task demands, achieving significant compute and data efficiency while maintaining representation quality.

Abstract

Joint-Embedding Predictive Architectures (JEPAs) for world modeling typically employ fixed-size Vision Transformer encoders that are over-provisioned for simple tasks and under-provisioned for complex ones, with significant redundancy across attention heads. We propose Successive Capacity Growth (SCG), a method that starts from a minimal encoder (1 head, 2 layers, 283K parameters) and grows incrementally in width (adding attention heads for low-level semantic capacity) or depth (adding transformer blocks for higher-order semantic abstraction), driven by a task-agnostic test-and-verify mechanism that exploits function-preserving expansion to safely trial architectural changes and roll back if they do not improve prediction loss. The Sketched Isotropic Gaussian Regularizer (SIGReg) ensures that all learned semantic dimensions remain statistically independent and aligned with the predictive objective, preventing collapse even as the architecture grows. On a 60-dimensional multi-object dynamics task, SCG naturally triggers depth expansion, improving prediction loss by 20.3% over the fixed small baseline with 56 times greater parameter efficiency than scaling to the fixed large model; on a 2D navigation task, a single width expansion yields even an 23% improvement over the fixed large model. Across all three tested environments of increasing complexity, the adaptive encoder matches or exceeds the fixed small baseline, with zero false-positive expansions and bit-exact function preservation (ratio = 1.0, absolute difference = 0.0). The take-away is that JEPA world model encoders need not be pre-allocated at maximum capacity - they can grow successively as the task demands, achieving significant compute and data efficiency while maintaining representation quality.

View source

Similar papers

Distilling and Scaling Hierarchical Vision Transformer to 30B Parameters

This work proposes EHV, an Efficient Hierarchical ViT architecture designed for massive scaling, and introduces a Sparse Mixture-of-Experts (SMoE) variant, pushing the scale to an industry-leading 30B parameters.

Shuguang Dou, Dongqian Li, Haoyang Jiang et al. · 0 citations
#machine learning Preprint Sep 2026

Cache-Aware Conv3D Lowering Across Embedded World-Model Decoders

Generative world models can provide visual rollouts for embodied planning, yet their feasibility on edge devices depends not only on the learned model but also on how the execution runtime represents its operations. We introduce a cache-aware lowering that expresses supported causal Conv3D calls as batched spatial Conv...

Jia-Ming Zhang, Wu Yang, Shu-Han Tao et al. · 0 citations
#machine learning Preprint Sep 2026

Not All Layers Need Tuning: Diagnosing and Directing Adaptation in Vision-Language-Action Models

Fine-tuning a Vision-Language-Action (VLA) model for a new deployment environment is expensive, yet most methods apply uniform-capacity adapters to every network region as if every region requires equal adjustment. This paper tests that assumption on five architecturally diverse VLAs (OpenVLA-OFT, $\pi_0$, SmolVLA, DTP...

Shahram Najam Syed, Arthur Jakobsson, Prayuj Sachdev et al. · 0 citations
#machine learning Preprint Sep 2026

Beyond Selection: Token Parameterization for Extreme Visual Token Compression

Braco is a lightweight four-step coder that combines transform-basis truncation, input-independent basis-coordinate embeddings, budget-dependent orthogonal re-parameterization, and learned spatial residual tokens from lightweight pooling that forms the favorable empirical accuracy-efficiency frontier under compression.

Rui-Lian Zhong, Yu Li, Zhe-Yu Yan et al. · 0 citations
#artificial intelligence Preprint Sep 2026

HiLRP: Toward One Trustworthy Explanation for Vision Transformer: Conservation-Valid Attribution via Attention Primitives

HiLRP alone preserves conservation across windowed, spatial-reduction, multi-axis, and linear-attention models, where naive extensions can produce zero or inflated relevance, and localizes attribution failures in class activation mapping.

Sathiyamohan Nishankar, Pubudu Sanjeewani, Asanka Perera et al. · 0 citations
Open access Aug 2026

Lightweight Redesign of Long-Used Operators in Vision Backbones for Efficient Visual Recognition

This paper revisits long-used fundamental operators and proposes three operator-level redesigns: Subtractive Residual Connection, Learnable Gating Response Function (LGRF), and statistics-discrepancy-guided Dynamic Dual Normalization (DDN).

Zhan-Yi Lian, Kepeng Luo, Yunfeng Wang · 0 citations

Related blog posts

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