AIarXiv

Ranked by formulaVerdict: Notable

MoG-VLM: Efficient Video Anomaly Detection through Motion-Guided Vision-Language Models

Vision-Language Models (VLMs) have shown strong potential for video anomaly detection, but dense frame-level inference makes them impractical for real-time deployment.

By Dawoud, Zaheer, Muhammad +1

Score████░░░░░░4.3

Key numbers

  • 1.31x inference speedup
  • 78.96% AUC-ROC on XD-Violence
  • 0.57% while delivering a 1.31

VerdictWorth a reader's time today.

Read the originalPDFCode

Abstract

Vision-Language Models (VLMs) have shown strong potential for video anomaly detection, but dense frame-level inference makes them impractical for real-time deployment. Existing acceleration commonly relies on uniform sampling, which ignores content dynamics and can either waste computation on static segments or miss localized anomalies. We propose MoG-VLM a motion-adaptive anomaly detection framework that leverages motion purely as a lightweight control signal to decide when VLM inference is necessary. To this end, we introduce Temporal Gradient Magnitude (TGM) which performs content-aware sampling to concentrate computation on informative regions while avoiding redundant processing. We further introduce a hierarchical dual-stream design in which dense multi-frame VLM reasoning is activated only around frames with elevated anomaly likelihood, via anchor-triggered context-window expansion with early termination. A fusion module then reconciles these instantaneous semantic cues with temporal action dynamics. Across four benchmarks, our method achieves 91.91%, 84.30%, 87.88%, and 78.96% AUC-ROC on XD-Violence, UCF-Crime, MSAD, and ShanghaiTech, respectively, establishing new state of the art on three benchmarks under the zero-shot, training-free setting. On XD-Violence, we improve over the previous best result by +0.57% while delivering a 1.31x inference speedup. These results demonstrate that content-aware allocation of VLM capacity, processing fewer frames more intelligently rather than all frames uniformly, is a more effective axis of progress than uniformly densifying VLM inference across frames. Code is available on GitHub: https://github.com/kdawoud91/MoG-VLM.

Khaled Waleed Dawoud, Muhammad Zaigham Zaheer, Khan Muhammad, Muhammad Haris Khan

The editor's rubric

Heuristic review

Leverage4 / 5
A general-purpose tool used across several fields (Adam, ResNet, LoRA, next-generation sequencing).
24% of this desk’s rubric
Magnitude4 / 5
A qualitative jump: a capability or regime that did not exist before.
18% of this desk’s rubric
Evidence3 / 5
Solid: multiple benchmarks or cohorts, ablations, fair baselines, released code or data.
14% of this desk’s rubric
Novelty3 / 5
A genuinely new approach to an open problem.
16% of this desk’s rubric
Trajectory3 / 5
A clear path to scale.
18% of this desk’s rubric
Stakes2 / 5
Benefits a professional community (practitioners, clinicians, engineers).
10% of this desk’s rubric

Editor’s rationale

Heuristic triage from title and abstract text only, not a reading of the paper. Cues found: method (we propose); breadth (many tasks, zero/few-shot); gains (x-fold, relative gain, state of the art); novelty (alternative to status quo, new kind); verification (multiple benchmarks, code released); scale (efficient); stakes (general AI).

How the score was computed

rank-2026-10-18

Score████░░░░░░4.3

Score = 10 × (65% × adjusted merit / 10 + 25% × attention + 10% × freshness)

Desks place stronger verdicts first, then use this score to order work within the same verdict.

Merit
6.6 / 10
Weighted rubric, evidence-gated.
Adjusted merit
5.3 / 10
Shrunk toward the desk prior by editor confidence (50%).
Attention
0%
Citations, upvotes, points, mentions.
Freshness
88%
Half-life decay since publication.

No attention signals recorded yet.

The record

  • Reviewed by heuristic-v7 on Oct 23, 2026, 02:53 UTC. Paper type: method.
  • Categories: cs.CV, cs.AI, cs.LG
  • BRIEF, No.5 in the Artificial Intelligence edition of October 23, 2026.