ECCV 2026 Oral

Keep It Simple: Multi-Key Episodic Memory
Retrieval for Ultra-Long Video Understanding

Yeeun Choi1, Youngbeom Yoo1, Joon-Young Lee2, Hyolim Kang1,†, Seon Joo Kim1,†

1 Yonsei University    2 Adobe Research

† Co-corresponding authors

TL;DR

Prior ultra-long video methods pour effort into complex hierarchical or graph memory at build time — before the query is even known. MERIT flips this: it builds a simple episodic multi-key memory for high-recall retrieval, and defers query-specific reasoning to inference time via on-demand neighbor filtering. Without building complex, high-cost memory, MERIT achieves state-of-the-art results on EgoLifeQA, LVBench, and Video-MME (Long).

0:00

A simple yet effective agentic framework — MERIT — that prioritizes high-recall retrieval and defers semantic composition to inference time.

Motivation

Good retrieval doesn't need complex memory — simple, raw evidence is enough.

When a video stretches from hours to days, you can't feed it into an MLLM end-to-end. So the field splits the task into two stages: first build an external memory from the whole video — before any question is known — then, at inference time, retrieve from it to answer each query.

MERIT overview: previous hierarchical graph memory vs. MERIT's simple multi-key memory with temporal expansion, and performance comparison.
(a) Prior methods build hierarchical, graph-based memories and aggregate across them at inference. (b) MERIT builds a simple episodic multi-key memory and, at query time, retrieves matched clips with on-demand temporal expansion. (c) MERIT outperforms EgoRAG and WorldMM across EgoLifeQA, Video-MME (Long), and LVBench.

The problem

Prior work over-builds complex memory — hierarchies and graphs — running the strongest MLLMs over the whole video in many passes. Because it's query-agnostic, this expensive abstraction may not match what is ultimately asked.

Our take

Keep the memory simple and high-fidelity, and defer high-level relation reasoning to inference time — when the query finally tells you which relations and abstractions actually matter.

Key idea

Intelligence Allocation. Spending your strongest MLLM on preprocessing done before the task is even specified is wasteful. Preserve high-fidelity episodic evidence and defer semantic composition to query time. The bottleneck then shifts from pre-building static semantics to high-recall retrieval that reliably surfaces the right evidence.

MERIT turns this idea into two lightweight components: a simple, high-recall episodic memory, and query-aware refinement that composes the right evidence on demand at inference time — detailed below.

Method

MERIT = Multi-key Episodic Retrieval with Inference-time Temporal expansion.

MERIT pipeline. Stage 1: episodic memory construction with four keys per 30s clip. Stage 2: agentic retrieval with key-wise max similarity and neighbor filtering.
Stage 1 — Episodic memory construction. Each 30-second clip is densely captioned, then a multi-key extraction derives four complementary keys per clip, forming a lightweight key–value memory M. Stage 2 — Agentic retrieval & answering. The solver regenerates a query, matches it against the keys (key-wise max similarity) to retrieve relevant clips, and neighbor filtering expands the temporal context to distill query-relevant evidence for the final answer.
1

Multi-Key Memory

A clip can be relevant for very different reasons — a physical action, a spoken mention, an object being handled, or just coarse scene context. Collapsing all of that into a single index is brittle. Instead, MERIT attaches four complementary keys to every 30-second clip, and scores relevance by the maximum similarity across a clip's keys — so each clip can match through its best-aligned aspect. This late-interaction matching is what drives MERIT's high recall.

🎬

Event / Action

Observable physical actions and interactions between entities.

💬

Dialogue / Mention

Spoken content, exact words, or commands from the audio track.

📦

Object

Items handled, requested, or moved, along with state transitions.

📝

Summary

A compact keyword-style abstraction of the clip's core narrative.

2

Neighbor Filtering

The evidence needed to answer a question often spans several nearby moments, not a single 30-second clip. So when a clip is retrieved, MERIT attaches its temporally adjacent neighbors (±Δ) on demand — the simplest possible graph over the timeline — then uses the solver as a query-aware filter to distill only what's relevant. Coherent context is reconstructed at inference time, with no pre-computed hierarchies.

↔️
Temporal expansion

Pull in ±Δ adjacent clips around each retrieved anchor
(e.g. ±1 min).

🔎
Query-aware refinement

The solver filters the expanded context, keeping only query-relevant evidence.

State-of-the-Art Results

New SOTA across ultra-long and hour-long video QA.

71.2
EgoLifeQA
+5.6 vs. SOTA
71.8
LVBench
+9.9 vs. SOTA
77.7
Video-MME (Long)
+1.1 vs. SOTA
0.56
Hit rate (highest)
simplest memory

The simplest memory, yet the best retrieval.

MERIT uses only single-granularity 30-second clips with lightweight multi-keys — no hierarchies, no graphs — and still attains the highest hit rate and highest accuracy, confirming that precise retrieval is the real bottleneck in ultra-long video QA.

Results on Ultra-Long Video QA (EgoLifeQA)

Average accuracy · by backbone
Backbone
Uniform Hierarchical Graph Ours
48.6
GPT-5
52.0
EgoRAG
65.6
WorldMM
71.2
MERIT

Average accuracy (%) — best of each type, within the same backbone.

By QA type · GPT-5 backbone
Uniform Hierarchical (EgoRAG) Graph (WorldMM) MERIT
EntityLog EventRecall HabitInsight RelationMap TaskMaster

Per-QA-type accuracy (%) on the GPT-5 backbone (axes 0–80).

Show full EgoLifeQA table
ModelEntityLogEventRecallHabitInsightRelationMapTaskMasterAvg
MLLMs (Uniform Sampling)
Qwen3-VL-8B35.230.239.346.446.038.6
Gemini 2.5 Pro43.240.541.055.252.446.4
GPT-547.242.147.553.655.648.6
Hierarchical Memory Based
EgoRAG (GPT-5)40.056.362.354.452.452.0
Ego-R1 (3B)51.253.263.950.450.853.0
Graph Memory Based
LightRAG (GPT-5)40.848.467.250.444.448.8
HippoRAG (GPT-5)48.860.370.560.866.759.6
Video-RAG (GPT-5)49.656.367.255.254.055.4
HippoMM (GPT-5)45.653.270.555.258.754.6
M3-Agent (7B)44.454.862.356.854.053.5
EGAgent (Gemini 2.5 Pro)54.457.160.362.474.657.5
WorldMM (Qwen3-VL-8B)49.656.463.958.458.756.4
WorldMM (GPT-5)62.464.375.462.471.465.6
Ours
MERIT (Qwen3-VL-8B)43.254.067.253.665.154.2
MERIT (Gemini 2.5 Pro)60.861.165.665.673.064.2
MERIT (GPT-5)67.270.673.874.471.471.2

Results on Hour-Long Video QA (LVBench & Video-MME (Long))

LVBench  · GPT-5 backbone
MERIT
71.8
WorldMM
61.9
Uniform
60.4
Video-MME (Long)  · GPT-5 backbone
MERIT
77.7
WorldMM
76.6
Uniform
74.3

Accuracy (%), axis starts at 50 · the longer the video, the larger MERIT's lead.

Show full LVBench & Video-MME (Long) table
ModelLVBenchVideo-MME (L)
MLLMs (Uniform Sampling)
Gemini 2.5 Pro57.055.7
GPT-560.474.3
Hierarchical Memory Based
EgoRAG (GPT-5)32.241.1
Ego-R1 (3B)34.142.7
Graph Memory Based
LightRAG (GPT-5)30.446.6
HippoRAG (GPT-5)54.052.1
Video-RAG (GPT-5)33.155.4
HippoMM (GPT-5)38.241.6
M3-Agent (7B)49.355.3
EGAgent (Gemini 2.5 Pro)74.1
WorldMM (GPT-5)61.976.6
Ours
MERIT (Gemini 2.5 Pro)76.3
MERIT (GPT-5)71.877.7

Memory Building Cost

Against the graph-memory SOTA (WorldMM), MERIT builds its memory once per clip instead of re-reading and consolidating across many scales.

8.4×
fewer input tokens
815K vs. 6,860K
8.6×
fewer output tokens
288K vs. 2,472K
3.8×
fewer MLLM calls
6,223 vs. 23,731

For more ablations and analysis, please refer to the paper.

Qualitative Results

On EgoLifeQA: precise multi-key matching localizes the right moment, and neighbor filtering supplies the surrounding context relational queries need.

Qualitative results of MERIT on EgoLifeQA showing multi-key matching and neighbor filtering.
(a) The event key precisely matches the query, enabling retrieval of the exact target segment. (b) Both settings retrieve the correct segment, but neighbor filtering supplies the ±Δ context needed to resolve relational queries that a single clip cannot answer.

BibTeX

Please cite MERIT if you find this work useful.

@inproceedings{choi2026merit,
  title     = {Keep It Simple: Multi-Key Episodic Memory Retrieval
               for Ultra-Long Video Understanding},
  author    = {Choi, Yeeun and Yoo, Youngbeom and Lee, Joon-Young
               and Kang, Hyolim and Kim, Seon Joo},
  booktitle = {European Conference on Computer Vision (ECCV)},
  year      = {2026},
  eprint       = {2608.07663},
  archivePrefix = {arXiv},
  primaryClass = {cs.CV}
}