- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes SuperMem, an omni-native super-hypergraph memory framework. The framework consists of three main components: (1) omni-native super-hypergraph memory construction, (2) joint cross-modal recall with sufficiency gating, and (3) conservative consolidation without deletion. These components aim to address three challenges in long-term multimodal memory: modality collapse in storage, modality gaps in retrieval, and repetition and revision during memory updates. The proposed method demonstrates strong performance across nine text, multimodal, and omni-modal benchmarks using three frozen backbones, outperforming existing memory baselines in average performance.
Critical strengths
-
Strong performance and comprehensive evaluation across diverse benchmarks and backbones. The proposed method demonstrates strong performance across nine text, multimodal, and omni-modal benchmarks using three different frozen backbone models. SuperMem consistently achieves the best average performance compared to existing memory-based methods. The extensive comparisons with 13 baselines, along with ablation, efficiency, and robustness analyses, further support the effectiveness of the proposed framework.
-
Unified omni-native memory with no additional LLM calls. The proposed framework integrates hypergraph-based memory with omni-native representations, while constructing and consolidating memory through deterministic operations without additional LLM calls beyond shared media rendering. This provides a practical approach to organizing and maintaining long-term omni-modal memory.
Critical weaknesses
Major Weaknesses
- Insufficient justification for the super-hypergraph structure. Although the paper provides an arity-based ablation for first-level hyperedges (Appendix F.3), it remains unclear what advantages the proposed super-hypergraph offers over conventional hierarchical graph-based memory. The unit-level and episode-level relationships could potentially be represented using a hierarchical graph structure. Furthermore, the contribution of the second-level hyperedges is not independently evaluated. Appendix D.2 states that the store is emptied for each episode before writing its stream. Since each stream corresponds to one episode and the default setting uses $k_2=8$, episode-level filtering appears to have no effect under this evaluation protocol. This raises questions about the necessity and effectiveness of the proposed two-level super-hypergraph structure.
Minor Weaknesses
-
Inconsistent citation. In Lines 143–144, the citation (Lee et al., 2025) refers to the earlier Gemini Embedding model, whereas Lines 335–336 specify Gemini Embedding 2 [1] as the encoder used in the experiments. The citation should be updated accordingly.
-
Figure clarity and consistency. The two bar charts in Figure 2(d) appear to present identical results, making the visualization redundant. Additionally, the boundaries between first-level and second-level hyperedges in Figure 3(a) are somewhat ambiguous compared to Figure 2(c). A more consistent visualization would help clarify the proposed memory structure.
-
Clarity of writing. Although the overall framework is understandable, some sentences are difficult to follow due to complex phrasing and dense mathematical notation, particularly in the methodology section. Simplifying these explanations would improve the readability of the paper.
[1] Shanbhogue, Madhuri, et al. "Gemini Embedding 2: A Native Multimodal Embedding Model from Gemini." arXiv preprint arXiv:2605.27295 (2026).
Questions for authors
-
Evaluation subset selection. The paper evaluates 128 questions from each of the nine benchmarks (Table 5), but the selection criteria are not clearly described. How were these questions selected, and how representative are they of the original benchmarks? Clarifying the sampling strategy and reporting the category-wise question distribution would help assess the representativeness of the evaluation results.
-
Super-hypergraph structure. Could the authors clarify what advantages the proposed super-hypergraph provides over a conventional hierarchical graph that connects episode, unit, and media nodes? Additionally, given the per-episode evaluation protocol in Appendix D.2, how does the second-level hypergraph contribute to retrieval performance? A comparison with a conventional hierarchical graph under the same native media access and retrieval settings, or an evaluation involving multiple streams in the same memory store, would help clarify its necessity.
-
Sufficiency gate. How was the sufficiency threshold determined? How frequently does the gate filter retrieved evidence across the benchmarks, and how does its removal affect performance? Since sufficiency-gated delivery is one of the main components, these results would help clarify its actual contribution.
-
Conservative consolidation. The repeated-write experiments demonstrate the effectiveness of consolidation in preventing memory duplication and preserving retrieval performance. However, it remains unclear whether MERGE correctly identifies semantically equivalent information and whether SUPERSEDE accurately handles revised or conflicting information. An analysis of the frequency and correctness of these operations, along with concrete examples of memory updates, would help better understand the effectiveness of the proposed consolidation mechanism.
-
Hyperparameter selection. The proposed framework involves several heuristic hyperparameters across memory construction, retrieval, and consolidation. How were these hyperparameters selected? In particular, were they tuned on a separate validation set or using the same 128 evaluation questions from each benchmark? Clarifying the hyperparameter selection protocol and whether the evaluation questions were kept separate from tuning would help assess the robustness and fairness of the evaluation.
-
Qualitative examples and failure analysis. While the paper provides a successful retrieval case study in Table 4, additional examples of the constructed memory, including first-level and second-level hyperedges, would help clarify how the proposed structure works in practice. Furthermore, an analysis of failure cases would help better understand the limitations of the proposed framework.
3 comments
Response to Reviewer 3xeV (Part 2/2)
Q4: Correctness of MERGE and SUPERSEDE
Thank you very much. We added controlled write probes on fresh stores (new in App. F.8, pp.28–29; in teal, shared with Reviewer HAeo): all 88 exact repeats merge into their own edge and all 88 unrelated facts are inserted.
- MERGE: rewriting each stream of LoCoMo, Mem-Gallery and MemEye up to merges every repeat, so store size and R@5 equal those of a single write, while an append-only store grows and loses 26.4 R@5 (§4.6, Fig. 7, Table 13).
- SUPERSEDE: when a near-identical unit changes a number+unit slot (Eqs. 9–10), the new unit is inserted and the old one leaves the live set; it is still recalled for "before / originally" questions (Eq. 11) and never deleted (Prop. 3). In LoCoMo conv-41 (verbatim), "He was such an important part of our family for 10 years", rewritten with 11 years, supersedes the original unit.
As a result, no merge or supersede hits a wrong unit.
Q5: Whether hyperparameters were "tuned on a separate validation set or using the same 128 evaluation questions"
Thank you very much. We set the knobs during development on these benchmarks and then froze them everywhere (Table 9; App. E.6 notes one backbone-specific exception). We also added a re-run and one-knob changes (new, §4.10, Fig. 11b; App. F.9):
- Three re-runs of the released code give identical answers and average 39.2 (Table 2: 39.9, from earlier runs), against 30.1 for the strongest baseline.
- Changing one knob at a time gives 39.2 with , 37.4 with and 36.6 with , and a 2k- or 8k-character note budget gives 31.9 or 36.7 (Fig. 8a), all above 30.1.
- Recall is flat once and across , peaks at and rises with (Table 15, Fig. 9a).
- In paired tests, SuperMem beats each baseline on 64.2% to 83.5% of questions where they disagree (sign test, ; Table 16, Fig. 9b).
Therefore, every changed value stays above the strongest baseline.
Q6(a): Examples of the constructed memory
Thank you very much. The case study is now RQ10 (§4.11): Table 4 (p.10), App. F.10 (p.29) and Fig. 14 (p.18) trace one recall from the M3-Bench-robot store (276 first-level hyperedges in 17 episodes, Table 12).
- Episode
bedroom_07is one second-level hyperedge nesting 16 first-level hyperedges, one per two-minute clip. - Each binds 3 text nodes (subtitles with the shared rendering, plus passages), 3 frames 40 s apart and the clip's audio (arity 7; 6 for the last, shorter clip).
- Fig. 14 prints the eight delivered notes with their per-modality similarities.
Hence, the example runs from episode to delivered notes.
Q6(b): Failure cases
Thank you very much. Of SuperMem's 693 wrong answers on gemini-2.5-flash-lite (Table 2), most lie in the backbone's reading or in telling similar episodes apart:
- 64.4% came after the right evidence was delivered.
- 30.3% have the top unit from a confusable episode. For example, "Which book does Lucy like?" (M3-Bench-robot) ranks a clip of
study_03above the askedstudy_06. - 5.3% miss the gold evidence in the right episode.
Therefore, recall rarely misses inside the right episode.
Minor weaknesses
Thank you very much. We revised all three:
- Inconsistent citation: p.3 (§3, after Eq. 1) now cites Gemini Embedding 2 (Shanbhogue et al., 2026) instead of Lee et al. (2025), matching the encoder of every run,
gemini-embedding-2(§4.1, p.6; Table 8, p.23). - Figure clarity and consistency: Fig. 2(d) is now one horizontal chart naming each backbone's strongest baseline (p.2). Fig. 3(a), like Fig. 2(c), now labels the dashed episode (second-level) hyperedge and the shaded first-level hyperedges (p.4).
- Clarity of writing: each module of §3 now opens with one plain sentence naming its challenge, Table 1 (p.3) contrasts one representative per design, and Algorithm 1 (App. C, p.21) walks through the three phases.
Hence, all three are now fixed.
Summary of Revisions
| Where | Change |
|---|---|
| App. D.2, opening Write-then-query sentences (p.22) | One store per benchmark, shared by all its episodes (revised, in blue) |
| §4.9 (RQ8), Fig. 10a; App. F.8, Table 17 | New: HierGraph in per-benchmark and all-benchmark stores |
| §4.10 (RQ9), Fig. 11b; App. F.9, Table 19 | New: re-run, one-knob changes, gate separation |
| §4.11, App. F.10 | Case study, now RQ10 |
| Fig. 2(d), Fig. 3(a) | One horizontal chart; labelled first- and second-level hyperedges |
At last, we sincerely appreciate your valuable feedback. We have carefully considered all your suggestions and substantially improved and updated the paper accordingly. If our responses and revisions address your concerns, we would be deeply grateful if you could kindly reconsider raising the score further. Thank you very much!
Thank you for the detailed response and additional experiments. I appreciate the authors' efforts to address my concerns, and most of my questions have been addressed. However, it remains unclear what specific advantages the super-hypergraph structure provides over a conventional hierarchical graph, as the new comparison also differs in its retrieval scoring mechanism. I will therefore maintain my original score.
Response to Reviewer 3xeV (Part 1/2)
Thank you very much for your time and thorough review, and for recognizing the strong performance, comprehensive evaluation and unified omni-native memory with no additional LLM calls. Your concerns are the super-hypergraph vs. a hierarchical graph, the second level if "the store is emptied for each episode" (App. D.2), the sufficiency threshold and the gate, how the questions were selected, how representative they are, the correctness of MERGE and SUPERSEDE, hyperparameter tuning, examples of the constructed memory, failure cases, and minor weaknesses.
We have substantially improved the paper's writing, figure and table layout, and supplementary experiments, among other details, and we kindly invite you to open the revised PDF to view them.
In the revised PDF, our revisions for you are in blue (mainly p.9 and App. F.8–F.9), and red marks changes addressing points raised by several reviewers. Part 2 answers Q4 to Q6 and the minor weaknesses.
W1: Super-hypergraph vs. a hierarchical graph
Thank you very much. We added the hierarchical graph you suggested (HierGraph) on the same store (new RQ8, §4.9, Fig. 10a; Table 17, p.29): the super-hypergraph wins, most clearly in one store holding all nine benchmarks.
Therefore, HierGraph-max trails the super-hypergraph by 2.1 R@5, 4.2 Own@1 and 3.8 accuracy points, by 10.9 R@5 in the 14,329-unit store (363 episodes), and by 5.6 to 18.8 on every media set there.
Q2: The second level if "the store is emptied for each episode"
Thank you very much. We revised the Write-then-query sentences that open App. D.2 (p.22, in blue): App. D.2 now reads "A benchmark's episodes share one store".
Hence, the second level scopes updates and time, and recall is robust to it.
Q3: The sufficiency threshold θd=0.45 and the gate
Thank you very much. θd equals the frozen file floor θfile=0.45 (Table 9, p.25), so one threshold serves delivery and file hand-back. We tested the gate signal (new in §4.10, App. F.9, Table 19) with the median s⋆ per benchmark:
As a result, the score the gate thresholds separates in-store from out-of-store questions on every benchmark (0.98 or more on LoCoMo, MemEye and LongDocURL).
Q1(a): How the questions were selected
Thank you very much. The subsets are drawn as follows:
Therefore, every subset follows a fixed, stated rule.
Q1(b): How representative they are
Thank you very much. Each subset's category mix is much closer to the full release than a same-size random draw (total-variation distance, lower is closer):
Within their chosen videos, M3-Bench-robot and LVOmniBench match almost exactly (0.004 and 0.007). Hence, results reflect each benchmark's own question mix.