SwiftReTaKe: Quick and Accurate Redundancy Reduction for Cloud-Edge Collaborative Video-Language Understanding
Bibliographic record
Abstract
Vision Language Models (VLMs) can enhance Internet of Things (IoT) applications by efficiently extracting valuable information from excessively long videos captured by IoT cameras. Due to the large volume of video data and the high computation overhead of VLMs, a practical deployment strategy is to transmit the video to the cloud only on demand and also deploy the VLMs on the cloud for video analytics. Yet, the interaction experience between humans and VLMs is degraded by the high latency in such cloud-edge collaboration applications. The latency is caused by both the video transmission process and the heavy VLM inference process. We propose SwiftReTaKe, a two-round transmission framework coupled with a low-latency pre-pruning strategy to reduce both network and inference latency. By first sending keyframes for relevance estimation and then adaptively transmitting informative frames, SwiftReTaKe minimizes data transfer and LLM computation. Compared to the state-of-the-art (SOTA) long video processing method, SwiftReTaKe reduces the latency by 6 times with only 3.33% accuracy drop.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.003 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 0.002 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".