- The selector is a soft form of MMR, and the paper neither compares it with tuned diversity methods nor ablates its own parts. From Eq. 9 the score is bm−∑sαsGms. With one memory selected, the simplex fixes its weight at 1 (the ridge is 10−10), so the second pick maximizes bm−Gm,m1, which has the same argmax as MMR with λ=0.5. Fig. 2 illustrates exactly this step and the Fig. 8 test runs at ∣S∣=1, so neither separates MemPursuit from MMR. Later picks subtract a weighted average of similarities to the selected set where MMR subtracts the maximum, which is a softer penalty. Greedy selection with a full simplex refit is itself standard (fully corrective Frank-Wolfe, OMP), so the case for the method has to be made empirically.
The empirical case is thin. The only diversity baseline is MMR at λ=0.5 in Appendix C.5 (81.04 vs 77.08 at K=10, 85.06 vs 83.31 at K=20, 87.08 vs 86.10 at K=50), with no sweep over λ. DPP, xQuAD and submodular selection are cited and never run, and MMR is absent from the coverage analysis, the cross-framework tables and Table 2. The refit, which the contributions list as a core part of the method, is never ablated against uniform weights, a pursuit without refitting, or nonnegative weights without the sum-to-one constraint. A 4-point gap at K=10 against one MMR setting does not show that reconstruction beats a tuned redundancy penalty, which is the paper's main methodological claim.
- The claim that MemPursuit recalls what is missing goes beyond what the score can do and what the experiments show. The residual lies in the span of the query and the selected memories, so a candidate gains only through its own similarity to the query and loses through its similarity to what is already selected. A bridge fact that reaches the query through an entity in a selected memory (the second hop of a chain) is pushed down. Every example in the paper (Fig. 1, Tables 5 to 8) is a set of parallel facts that each resemble the query: three deaths, two ages, two adoption dates, a weight warning and a diagnosis, two event dates. Removing near-duplicates is enough for these. Proposition 1 assumes the same regime. Assumption B.1 requires every required-fact memory to beat every distractor in query similarity by a margin γ, with nearly equal query similarities across facts (M>0). The required facts are then the top cosine matches already, and the result only rules out one fact's duplicates crowding out the others. The case-study facts sit at hybrid ranks 11, 12, 26 and 41, and the paper never checks how often the assumption holds.
The coverage evidence is at the session level. Fig. 3 counts gold sessions, and swapping 70.8% of the selected memories for memories spread over more sessions raises that count by itself, yet the figure has no MMR or random baseline; Table 8 itself notes that source coverage can miss an omitted fact. By my count of the Fig. 8 histogram, about 53 of the 136 questions favor the semantic comparator. The paper also does not discuss a cost of the redundancy penalty: dated versions of the same fact look redundant in embedding space, and temporal questions need them. On LongMemEval temporal reasoning with GPT-4o-mini, MemPursuit answers 81 of 133 questions, against 99 for Mem0 and 103 for LightMem, and with Qwen it scores 62.41% against 75.94% for Mem0. Without a Mem0-v3-only row (weakness 3) I cannot say how much of this comes from the pursuit, but the paired results lean the same way. The LoCoMo temporal gain at K=10 is 0.9 points (73.2 vs 72.3, Fig. 4a), and MemoryBank loses 4.05 temporal points at K=10.
- Table 2 does not isolate MemPursuit, and its budgets are not matched. MemPursuit runs at K=50 on Mem0-v3, while the baselines keep their native budgets: 10 for A-MEM and MemoryOS, 40 for MemOS, 50 for MemoryBank, 60 for LightMem and Mem0, and all memories for SimpleMem. Fig. 4b shows that budget alone moves the hybrid order from 73.8 at K=10 to 84.2 at K=50. That 84.2 is the Mem0-v3 backbone with no pursuit, and with GPT-4o-mini it already matches MemOS (84.48), the strongest baseline. Of the 21.3-point gap between MemPursuit (87.08) and the Mem0 row (65.78), 2.9 points come from the pursuit. Appendix A.3 suggests the Mem0 row is the older paper release (two speaker stores, K=60) and not Mem0-v3. There is no backbone-only row for LongMemEval or BEAM, so the best results on all three benchmarks cannot be credited to MemPursuit; with GPT-4o-mini the LongMemEval lead over Mem0 is 356 against 352 correct answers out of 500.
No result comes with a confidence interval or repeated runs. The gains in all eight framework-budget configurations include LightMem at K=20, where the gain is 0.32 points, or 5 of 1,540 questions. In Table 9, MemPursuit's own per-category accuracies give 84.5 overall instead of the reported 85.1, while every other row in that table reproduces.
Thank you for your great detailed analysis and responses, the updated work with these results is much stronger and ive raised my score.