LAST: Looped Audio Spectrogram Transformer

cs.SD cs.LG eess.AS Haider Al-Tahan, Sean O'Brien, Anastasia Razdaibiedina, N. Apurva Ratan Murty · Oct 1, 2026
Local to this browser
What it does
Sound classification with transformers usually demands stacking many layers, which inflates parameters and compute. LAST asks whether the same blocks can be reused to refine only a single class token while keeping audio features fixed,...
Why it matters
LAST asks whether the same blocks can be reused to refine only a single class token while keeping audio features fixed, trading depth for recurrence. Their looped Audio Spectrogram Transformer matches or exceeds deeper sequential baselines...
Main concern
The paper presents a clean architectural idea—caching audio keys and values after one full pass, then looping shared blocks over only the class token—that yields measurable efficiency and accuracy wins on AudioSet. The finding that...
Community signal
0
0 up · 0 down
Sign in to vote with arrows
AI Review AI reviewed
Plain-language introduction

Sound classification with transformers usually demands stacking many layers, which inflates parameters and compute. LAST asks whether the same blocks can be reused to refine only a single class token while keeping audio features fixed, trading depth for recurrence. Their looped Audio Spectrogram Transformer matches or exceeds deeper sequential baselines on AudioSet at roughly half the parameter count, suggesting that how tokens are updated matters as much as how many layers exist.

Critical review
Verdict
Bottom line

The paper presents a clean architectural idea—caching audio keys and values after one full pass, then looping shared blocks over only the class token—that yields measurable efficiency and accuracy wins on AudioSet. The finding that full-token recurrence degrades while class-token recurrence improves is a useful contribution. However, limited training epochs, a single random seed, and mixed transfer results temper the strength of the conclusions. The work is promising but the empirical support is thinner than it appears.

“full-token recurrence, given the same blocks and the same pass counts, gets worse with depth while costing far more.”
LAST, Section 4.1 · Section 4.1
“All models are trained from scratch for twelve epochs with one random seed.”
LAST, Section 3 · Section 3
What holds up

The architectural insight is well-motivated and the cost asymmetry is rigorous. The authors explicitly note that full-token recurrence fails: full-token recurrence falls from 0.3247 mAP at $R=2$ to 0.3099 at $R=10$, despite a fivefold increase in computation. The caching analysis is correct: a full pass costs $\mathcal{O}(D(NC^2 + N^2C))$ whereas a cached class-token pass costs $\mathcal{O}(D(C^2 + NC))$, so adding passes is cheap. This is borne out in the throughput numbers.

“full-token recurrence falls from 0.3247 mAP at R=2 to 0.3099 at R=10, despite a fivefold increase in computation.”
LAST, Section 4.1 · Section 4.1
“A full pass costs \mathcal{O}(D(NC^{2}+N^{2}C)), whereas a cached class-token pass costs \mathcal{O}(D(C^{2}+NC)): the quadratic term in N vanishes and the projection term reduces to a single query.”
LAST, Section 2.2 · Section 2.2
Main concerns

The empirical evidence has critical gaps. All models are trained for only twelve epochs with a single random seed, so variance and convergence behavior are unknown. The headline comparison pits LAST ($D=6,R=10$) against a sequential $D=12$ baseline, but the parameter savings stem largely from halving depth; against the parameter-matched sequential $D=6$ baseline, LAST needs $R \geq 6$ to win, and the absolute mAP delta remains modest. Transfer results are mixed: LAST underperforms on SC-V2, VoxCeleb, and US8K, improving on only five of eight tasks. The authors also admit a key limitation: these results do not establish whether an already trained model benefits from additional inference passes.

“Each data point in Figure 1 is a model that is trained separately, so these results do not establish whether an already trained model benefits from additional inference passes.”
LAST, Section 4.1 · Section 4.1
“All models are trained from scratch for twelve epochs with one random seed.”
LAST, Section 3 · Section 3
Evidence and comparison

The AudioSet experiments support the core claim that class-token recurrence outperforms full-token recurrence at matched computation, and the robustness probes (temporal masking and waveform corruption) are thoughtful. However, the choice of $D=6$ shared blocks feels narrow; without ablations for other depths ($D=3,9$ with recurrence), it is unclear whether the recipe generalizes. The related work discussion correctly distinguishes LAST from CaiT, which uses separate class-attention layers, and from Universal Transformers, which update all positions recurrently. The CaiT paper explicitly separates class-attention layers devoted to extract the content into a single vector. Still, the absence of comparisons to token-reduction methods leaves open whether simpler alternatives would suffice.

“LAST is fundamentally different. It targets the clip-level classification and repeatedly updates only the class token while keeping the audio features fixed after a full attention pass.”
LAST, Introduction · Introduction
“It is akin to an encoder/decoder architecture, in which we explicitly separate the transformer layers involving self-attention between patches, from class-attention layers that are devoted to extract the content of the processed patches into a single vector so that it can be fed to a linear classifier.”
Reproducibility

Reproducibility is weak. The paper states: All models are trained from scratch for twelve epochs with one random seed. One seed is insufficient to report reliable gains, especially when the absolute mAP margin over the $D=6$ baseline is small. Hyperparameters are listed, but the code, model checkpoints, and training logs are not mentioned as available. AudioSet keys and values caching is straightforward in principle, but without released code an independent reproduction would require re-implementing the exact masking, augmentation, and weight-averaging protocol. The throughput benchmark uses bfloat16 at batch size 64 on unstated hardware, limiting comparability.

“All models are trained from scratch for twelve epochs with one random seed.”
LAST, Section 3 · Section 3
“We use AdamW with weight decay 0.01, batch size 1024, and learning rate 7.54\times 10^{-5}.”
LAST, Section 3 · Section 3
Abstract

Increasing depth of transformer models improves recognition, but it comes at a substantial cost. Each additional layer requires more parameters, which makes the process computationally inefficient. We ask whether additional processing can focus on integrating features already computed. Looped Audio Spectrogram Transformer (LAST) first processes all tokens, then reuses the same blocks to refine only the class token over fixed audio features, thereby making later passes inexpensive. On AudioSet, ten-pass LAST achieves 0.345 mean average precision, exceeding a twelve-layer sequential transformer by 2.1% relative with 49.4% fewer parameters, 42% fewer multiply-accumulate operations, and 9.8% higher measured throughput. Across separately trained models, increasing the pass count from two to ten improves accuracy while adding only 1.2% computation. Further evaluations show improved robustness to temporal masking and various other auditory augmentations, with better generalization on classification tasks with music, environmental, and event sounds.

Challenge the Review

Pick a starting point or write your own. Challenges run in the background, so you can keep reading while the AI investigates.

No challenges yet. Disagree with the review? Ask the AI to revisit a specific claim.