Overview

Conditional computation studies how to vary a model’s work across inputs, tasks, or runtime budgets instead of executing every layer and component every time. Common approaches use learned gates to route tokens among experts or attention modes, skip layers or regions, choose activations, or allocate additional reasoning when confidence is low. These methods are tested across language models, vision and video, edge inference, and scientific screening, with comparisons focused on accuracy at matched FLOPs, memory, latency, or energy. A central challenge is turning adaptive routing into real hardware savings: gates can add overhead, routing can become unbalanced, and dynamic behavior must be distinguished from static sparsity or parameter changes that do not reduce actual execution.

Latest papers

CardsList

38 papers10 papers in the last four weeks, up 150% on the four weeks before. 0.1% of all new papers.

  1. Switch Attention: Towards Dynamic and Fine-grained Hybrid Transformers

    Mar 27, 2026Yusheng Zhao, Hourun Li, Bohan Wu +5Hybrid Transformer ArchitecturesHybrid Attention

  2. Dynamic sparsity in tree-structured feed-forward layers at scale

    Mar 18, 2026Reza Sedghi, Robin Schiewer, Anand Subramoney +1Transformer FFNsStructured Sparsity

  3. Motivation is Something You Need

    Feb 24, 2026Mehdi Acheli, Walid GaaloulNeural Network Training DynamicsConditional Computation

  4. Switchable Activation Networks

    Feb 17, 2026Laha Ale, Ning Zhang, Scott A. King +1Efficient Neural Network InferenceDynamic Neural Networks

  5. evMLP: An Efficient Event-Driven MLP Architecture for Vision

    Jul 2, 2025Zhentan ZhengEfficient Neural Network InferenceConditional Computation