Papers
Topics
Authors
Recent
Search
2000 character limit reached

MixANT: Action Anticipation & Mix-Audio Augmentation

Updated 11 July 2026
  • MixANT is a state-space model extension for stochastic dense action anticipation that replaces static forget gates with an observation-dependent mixture-of-experts routing mechanism.
  • The architecture preserves linear-time scanning while generating multiple plausible per-frame future action predictions, showing improved results on datasets like Breakfast, Assembly101, and 50Salads.
  • Additionally, MixANT denotes a mix-audio augmentation strategy in music source separation that sums same-stem audio segments without label interpolation to enhance target clarity.

MixANT denotes two distinct constructs in the cited literature. In stochastic video understanding, it is an architecture for long-term dense action anticipation that introduces observation-dependent memory propagation into Mamba-like state space models by replacing the static forget gate AA with a routed mixture of experts (Wasim et al., 14 Sep 2025). In music source separation, the same acronym has also been used for “mix-audio augmentation,” a waveform-level training strategy that sums same-stem audio segments within CatNet (Song et al., 2021). The dominant technical usage is the former: a model for generating multiple plausible per-frame future action sequences over long horizons while preserving the linear-time scan of selective SSMs.

1. Task definition and motivation

MixANT was introduced for stochastic long-term dense action anticipation, defined as: given an observed prefix of a video, predict per-frame action labels for a long future horizon under uncertainty by generating multiple plausible future label sequences (Wasim et al., 14 Sep 2025). “Dense” denotes per-frame future labeling rather than a coarse transcript, so the model outputs an action label for every future frame and captures durations implicitly. “Stochastic” denotes multi-sample inference, intended to reflect uncertainty and multimodality when several continuations are equally plausible.

The evaluation protocol is parameterized by the observed fraction α\alpha and future fraction β\beta. For a video vv with nvn_v frames, the model observes the first P=αnvP=\alpha n_v frames and anticipates the next F=βnvF=\beta n_v frames, with α{0.2,0.3}\alpha \in \{0.2,0.3\} and β{0.1,0.2,0.3,0.5}\beta \in \{0.1,0.2,0.3,0.5\}. Inference produces S=25S=25 sampled futures. Performance is reported with Mean MoC and Top-1 MoC: α\alpha0

The architectural motivation is a limitation in recent selective SSMs such as Mamba. These models already make α\alpha1, α\alpha2, and α\alpha3 input-dependent, but the forget gate—the α\alpha4 matrix that governs state memory decay and propagation—remains static in vanilla Mamba. In dense anticipation, this is restrictive for three reasons stated explicitly in the paper: temporal memory should be context-aware; future frames in the conditioning are zero-padded and should sometimes be selectively ignored; and making α\alpha5 directly input-dependent with attention-like query-key mechanisms or large MLPs adds prohibitive overhead or breaks linear-time scanning. A common misconception is therefore that Mamba is already fully input-selective; in this setting, the critical memory-propagation term is not.

2. Observation-dependent memory propagation

MixANT retains the discrete-time selective-scan SSM formulation

α\alpha6

with step-size discretization

α\alpha7

but replaces the static α\alpha8 with an input-dependent mixture-of-experts forget gate (Wasim et al., 14 Sep 2025).

Each MixMamba block maintains α\alpha9 expert matrices β\beta0. A lightweight router computes a gating vector from observed features only: β\beta1 Hard routing then selects a single expert,

β\beta2

so the block acquires input dependence in β\beta3 while preserving an β\beta4 scan. MixANT keeps Mamba’s input-dependent β\beta5, β\beta6, and β\beta7; only β\beta8 changes from static to routed mixture.

The resulting MixMamba layer is bi-directional. For each layer, the input is processed by a small feed-forward subnetwork and a 1D convolution β\beta9 in forward and temporally reversed order, followed by an vv0 selective scan using the routed vv1. The forward and backward outputs are then modulated by a residual gate vv2, the backward stream is flipped back in time, and the two directions are merged by a final feed-forward layer. The router is unified across forward and backward scans rather than independent; the reported analysis states that this yields better accuracy and improves bi-directional consistency.

To avoid expert collapse, the model applies load-balancing regularization. For expert usage in layer vv3,

vv4

and the balancing objective encourages a uniform allocation: vv5 This design is the core of MixANT’s claim to observation-dependent memory propagation: each expert vv6 can specialize to a distinct temporal decay or propagation regime, and routing selects among them with negligible per-step cost.

3. End-to-end model pipeline and optimization

The full anticipation model is a conditional diffusion system whose generator vv7 is a stack of vv8 blocks, comprising vv9 initial standard bi-directional Mamba blocks followed by nvn_v0 MixMamba blocks (Wasim et al., 14 Sep 2025). The input conditioning uses pre-extracted per-frame visual features nvn_v1: I3D for Breakfast and 50Salads, and TSM for Assembly101. Future frames are represented by zero padding,

nvn_v2

During diffusion sampling, the latent label tensor nvn_v3 is concatenated with nvn_v4 along channels to form the block input nvn_v5. A final MLP maps the last block output to per-frame logits nvn_v6.

Training follows a conditional diffusion objective: nvn_v7 The reconstruction term compares the denoised sample with one-hot ground truth labels: nvn_v8 The total training loss combines reconstruction and load balancing,

nvn_v9

The reported ablation indicates that P=αnvP=\alpha n_v0 is effective.

The training recipe is fully specified. MixANT uses P=αnvP=\alpha n_v1 experts per MixMamba block, a unified router, and routing conditioned on observed frames only. Optimization uses AdamW with P=αnvP=\alpha n_v2 and P=αnvP=\alpha n_v3; the learning rate is P=αnvP=\alpha n_v4 for Breakfast and Assembly101 and P=αnvP=\alpha n_v5 for 50Salads; training lasts 90 epochs on all three datasets; diffusion training uses P=αnvP=\alpha n_v6 steps; inference uses DDIM with 50 steps on Breakfast and Assembly101 and 10 steps on 50Salads; and training is performed on a single NVIDIA A100 80GB GPU. Source and additional materials are provided through the project page linked in the paper.

4. Empirical performance and computational profile

MixANT is evaluated on Breakfast, Assembly101, and 50Salads, and the paper reports consistent improvements over prior methods across all settings (Wasim et al., 14 Sep 2025). Breakfast uses 4-fold cross-validation, 48 classes, I3D features, and anticipation up to 5.4 minutes. Assembly101 uses the validation split, 202 coarse actions, TSM features, and anticipation beyond 12 minutes. 50Salads uses 5-fold cross-validation, 17 actions, I3D features, and anticipation up to 5.1 minutes.

On Breakfast, Mean MoC at P=αnvP=\alpha n_v7 is P=αnvP=\alpha n_v8 for P=αnvP=\alpha n_v9, compared with MANTA’s F=βnvF=\beta n_v0. At F=βnvF=\beta n_v1, Mean MoC is F=βnvF=\beta n_v2, compared with F=βnvF=\beta n_v3. Top-1 MoC at F=βnvF=\beta n_v4 is F=βnvF=\beta n_v5, compared with F=βnvF=\beta n_v6; at F=βnvF=\beta n_v7, it is F=βnvF=\beta n_v8, compared with F=βnvF=\beta n_v9.

On Assembly101, Mean MoC at α{0.2,0.3}\alpha \in \{0.2,0.3\}0 is α{0.2,0.3}\alpha \in \{0.2,0.3\}1, compared with MANTA’s α{0.2,0.3}\alpha \in \{0.2,0.3\}2. At α{0.2,0.3}\alpha \in \{0.2,0.3\}3, Mean MoC is α{0.2,0.3}\alpha \in \{0.2,0.3\}4, compared with α{0.2,0.3}\alpha \in \{0.2,0.3\}5. Top-1 MoC at α{0.2,0.3}\alpha \in \{0.2,0.3\}6 is α{0.2,0.3}\alpha \in \{0.2,0.3\}7, compared with α{0.2,0.3}\alpha \in \{0.2,0.3\}8; at α{0.2,0.3}\alpha \in \{0.2,0.3\}9, it is β{0.1,0.2,0.3,0.5}\beta \in \{0.1,0.2,0.3,0.5\}0, compared with β{0.1,0.2,0.3,0.5}\beta \in \{0.1,0.2,0.3,0.5\}1.

On 50Salads, Mean MoC at β{0.1,0.2,0.3,0.5}\beta \in \{0.1,0.2,0.3,0.5\}2 is β{0.1,0.2,0.3,0.5}\beta \in \{0.1,0.2,0.3,0.5\}3, compared with MANTA’s β{0.1,0.2,0.3,0.5}\beta \in \{0.1,0.2,0.3,0.5\}4. At β{0.1,0.2,0.3,0.5}\beta \in \{0.1,0.2,0.3,0.5\}5, Mean MoC is β{0.1,0.2,0.3,0.5}\beta \in \{0.1,0.2,0.3,0.5\}6, compared with β{0.1,0.2,0.3,0.5}\beta \in \{0.1,0.2,0.3,0.5\}7. Top-1 MoC at β{0.1,0.2,0.3,0.5}\beta \in \{0.1,0.2,0.3,0.5\}8 is β{0.1,0.2,0.3,0.5}\beta \in \{0.1,0.2,0.3,0.5\}9, compared with S=25S=250; at S=25S=251, it is S=25S=252, compared with S=25S=253.

The paper also reports additional evidence on EK-100 short-term anticipation: Testra+MixMamba achieves overall verb/noun/action recall@5 of S=25S=254, compared with S=25S=255 for an attention baseline and S=25S=256 for a Mamba baseline.

The efficiency comparison is reported for Breakfast with S=25S=257, S=25S=258, and 25 samples, on a per-video basis:

Model Params / Memory / Time Top-1 MoC
GTDA 3.9M / 19.2GB / 71.8s 48.9
Transformer (15 blocks) 1.2M / 11.3GB / 15.6s 48.8
Transformer (18 blocks) 1.4M / 13.2GB / 18.2s 50.3
MANTA 1.4M / 10.2GB / 1.1s 52.7
Large MLP for S=25S=259 8.0M / 38.7GB / 137.4s 47.4
Query-Key for α\alpha00 2.3M / 22.7GB / 24.4s 52.3
MixANT (α\alpha01) 1.6M / 10.9GB / 1.7s 54.1

These results support the paper’s central empirical claim: hard-routing the forget gate preserves the linear-time scan and adds only small overhead relative to MANTA, while naive realizations of input-dependent α\alpha02 are substantially more expensive. The reported expert-scaling analysis further notes a small increase in speed cost from 1 to 2 experts and minimal additional overhead beyond that, which is presented as evidence for the practicality of α\alpha03.

5. Ablations, qualitative analyses, and theoretical observations

The ablation studies isolate several architectural choices that materially affect performance (Wasim et al., 14 Sep 2025). The number of experts α\alpha04 improves performance from α\alpha05 (equivalent to Mamba) to a peak around α\alpha06, after which accuracy declines because of sparse gradient flow and reduced usage. The number of initial static blocks α\alpha07 is also sensitive: Top-1 values across α\alpha08 are α\alpha09, and α\alpha10 is used in the main configuration. The paper interprets this as a trade-off: too few static blocks harm early feature extraction, whereas too many reduce adaptive capacity.

Router design is another decisive factor. A unified router shared by forward and backward scans outperforms independent routers. Conditioning the router on observed frames only also outperforms conditioning on observed-plus-future inputs, because zero-padded future frames dilute the routing signal. Load balancing with α\alpha11 yields the best accuracy and avoids second-expert dominance.

The paper’s analytical discussion centers on expressivity and controllability. Making α\alpha12 input-dependent through MoE increases the capacity of temporal memory control because each α\alpha13 can specialize to a distinct decay or propagation regime. At the same time, MixANT does not impose explicit stability constraints such as spectral radius bounds on α\alpha14. Empirical training is reported as stable without such constraints. The authors note that, if necessary, stability could be further encouraged through spectral normalization or diagonal-plus-low-rank parameterizations. This suggests a separation between the method’s empirical effectiveness and formal stability control: the former is demonstrated directly, while the latter remains a possible extension rather than a built-in guarantee.

The qualitative analyses report that, on Breakfast videos involving pancake, sandwich, and coffee preparation, MixANT predictions align better with ground truth temporally than MANTA and produce diverse yet plausible stochastic samples. The paper also reports that t-SNE visualizations of expert selections cluster by high-level activities such as “making salad” and “making tea,” even though training is performed on atomic actions. A plausible implication is that expert routing is capturing semantically structured temporal regimes rather than only low-level duration statistics.

6. Relation to adjacent model families, limitations, and future directions

MixANT is positioned against several neighboring model classes (Wasim et al., 14 Sep 2025). Relative to Transformers, the comparison emphasized in the paper is complexity: attention is quadratic in sequence length, which limits long-horizon dense anticipation, whereas MixANT retains near-linear SSM scans while improving accuracy and inference time. Relative to S4/S6 and vanilla Mamba, the key distinction is selectivity: S4/S6 offer efficient long-sequence modeling, Mamba adds input-dependent α\alpha15, α\alpha16, and α\alpha17, and MixANT extends this progression by making the forget gate α\alpha18 input-dependent through MoE routing. The paper explicitly characterizes this as the first such modification inside Mamba-like blocks.

The relation to other MoE variants around Mamba is narrower. Prior MoE formulations are described as targeting MLP components outside SSM blocks or retaining a shared α\alpha19. MixANT’s novelty is therefore not the presence of experts per se, but the routing of the forget gate itself. Within action anticipation, the paper contrasts deterministic dense methods, which output a single future, with diffusion-based stochastic approaches such as GTDA and DiffAnt. MANTA is the immediate antecedent because it introduced Mamba into diffusion for efficient stochastic dense anticipation; MixANT is presented as an improvement over MANTA through observation-dependent memory propagation.

The reported limitations are correspondingly specific. Router collapse can occur if load balancing is insufficient, leading to underutilized experts and reduced generalization. Performance is sensitive to the choice of α\alpha20 and α\alpha21. Domain transfer is also identified as a concern: expert specializations learned on cooking or assembly data may not transfer directly to different domains without re-routing or retraining.

The future directions named in the paper follow directly from those limitations. They include stability-aware parameterizations of α\alpha22, soft routing or temperature annealing, modality-aware routing for multi-modal inputs, hierarchical experts, per-time-step routing when computation permits, and uncertainty-aware decoders beyond the reported α\alpha23 reconstruction objective, such as class-conditional diffusion losses and calibration-oriented designs.

7. Homonymous usage in music source separation

An earlier and conceptually separate use of the term “MixANT” appears in CatNet for music source separation, where it abbreviates mix-audio augmentation rather than a state-space architecture (Song et al., 2021). In that formulation, the augmentation randomly mixes multiple audio segments drawn from the same source stem. If α\alpha24 are α\alpha25 segments from one source class, the augmented stem is

α\alpha26

For multi-stem separation, the mixture presented to the network is

α\alpha27

where α\alpha28 indexes stems such as vocals, drums, bass, and other. Because summation is intra-source, the target remains within the same stem identity; no label interpolation is used.

This augmentation is applied to 3-second waveform segments sampled uniformly at random from the same stem’s training pool. The paper describes direct summation, does not specify mixing coefficients or amplitude normalization, and treats MixANT as effectively always-on in the reported “+ aug” runs. It is explicitly distinguished from mixup and SpecAugment: mixup uses convex combinations with interpolated labels, whereas MixANT uses intra-source waveform summation; SpecAugment applies time-frequency masking, whereas MixANT operates directly on raw waveforms.

Within CatNet, MixANT is integrated into a two-branch end-to-end system consisting of a spectrogram UNet branch and a time-domain WavUNet branch. The spectrogram pathway computes STFTs inside the network with fixed differentiable 1D convolution kernels using a Hann window of size α\alpha29 and hop α\alpha30, predicts a spectrogram mask, reconstructs with mixture phase, and returns to waveform through differentiable iSTFT. The time-domain branch processes the waveform directly with 1D convolutions. The two outputs are fused by time-domain summation, and training uses an α\alpha31 waveform loss.

On MUSDB18, CatNet + MixANT reports a median vocals SDR of α\alpha32 dB, compared with α\alpha33 dB for MMDenseNet. In the ablation table, MixANT improves vocals SDR for both WavUNet and CatNet, although bass shows mixed effects. The two meanings of MixANT are therefore technically unrelated beyond the acronym: one is a routed forget-gate mechanism for stochastic dense action anticipation, and the other is an intra-source audio-mixing augmentation for music source separation.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (2)

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to MixANT.