- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The paper asks when splitting agent memory into types helps compared with a strong flat retriever. It treats types as subspaces of a frozen embedding space and argues that typing adds no capacity at a fixed rank budget. Any benefit instead has to come from easier estimation within recovered blocks or different retention policies for content that drifts at different rates. SOMA learns routing, subspaces, decay, and reliability, while a spectral variant is used for the analysis. The experiments report gains over target-aware flat memory, especially with limited task supervision, and use controls to separate blockwise estimation from the benefit of separate stores.
Critical strengths
I like the question and the effort to make the flat baseline strong. STRUCT-FLAT gets the recovered blocks too, so the comparison can separate the benefit of blockwise estimation from anything specific to separate stores. That's a useful distinction for someone deciding whether typed memory is worth adding to an agent.
The empirical work covers several plausible explanations for the gain: the full-objective K=1 control, alternative target constructions, the probe-budget sweep, and the drift intervention. I also took app. M into account. The ten-seed results give clearer evidence for the small store-specific increment, and there are task results on additional backbones. The aggregate task improvement has support within this protocol. What I struggle with is the claimed connection between the analysis and what the retrieval system actually does.
Critical weaknesses
My main concern is the link between store coverage and actual retrieval. How can the top-12 item span have only 0.03–0.08 slack relative to the full store in table 5, given the reported target effective rank? Under the common target covariance described in app. G, this seems inconsistent with the paper's own rank bound. If the calculation actually uses query-conditioned targets or pools retrievals across queries, the definition needs fixing. It would also leave open whether the subspace guarantees say much about the context returned to the agent.
I also don't see why target energy outside the recovered blocks should upper-bound the worst block-angle error in prop. 4(vi), p. 27. Capturing the combined span doesn't ensure that individual blocks were recovered. The claim that the measured recovery cost is conservative needs justification.
Questions for authors
-
What exactly is measured in table 5? Please give one benchmark's store coverage, average top-12-span coverage, and target effective rank.
-
What justifies the recovery-proxy upper bound in prop. 4(vi)? If it needs correction, do the TYPE-IF0 decisions change?
-
How does prop. 5 handle near-ties between eigenvalues from different blocks at the pooled budget cutoff? Within-block gaps alone don't seem to prevent the allocation from changing.
-
Does Stage A recover more than B basis directions? App. E specifies St(d, B), but algorithm 6 then selects B directions. As written, there appears to be nothing left to select.