- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This submission proposes Indeterminate Cognitive Automata, a graph-based memory-retrieval architecture for lifelong learning. Sensory representations are mapped by an unspecified projection to bounded-degree graph nodes; retrieval follows a greedy, potential-decreasing walk for at most hops and is paired with a sketched SRAM processing-in-memory substrate. The paper claims exact globally optimal retrieval in repository-size-independent time, exponentially decaying error, and storage. However, fixed-hop greedy search cannot generally guarantee a global optimum, the error bound assumes rather than derives contraction, and no graph-construction procedure, implementation, simulation, dataset, numerical measurements, or supplementary code supports the claims.
Critical strengths
-
Reducing the latency and energy of large, dynamically updated memory retrieval is an important systems-and-ML problem, and considering algorithm/hardware co-design could be consequential if instantiated and validated.
-
Algorithm 1 makes the intended fixed-budget greedy graph walk recognizable, and the authors transparently disclose that Gemini assisted with language, notation, and proof derivations. These positives make the claims auditable, but they do not offset the fundamental validity and evidence problems.
Critical weaknesses
-
The result assumes a constant , cannot guarantee the claimed global optimum even on a path graph, omits entry-point and dimensional costs, and uses undefined graph gradients/convexity. The error-bound appendix assumes rather than derives exponential contraction. Core representations, scores, learning, graph construction, and online updates are also undefined. Therefore neither the algorithm nor its "provable" guarantees are valid in their present form.
-
The "Results" section has no results; the complexity table is not a simulation, and there is no code or supplement. The PIM proposal is one paragraph without a circuit/microarchitecture, synthesis or simulation, precision/dataflow description, or latency/energy/area accounting. The comparison to Transformers and ANN systems is not task-matched, relevant dynamic-ANN literature is missing, and multiple references appear untraceable or bibliographically conflated. The disclosed use of Gemini to refine proof derivations is not itself a problem, but the combination of assertion-heavy prose, invalid proofs, and malformed citations contradicts the claim of complete human verification and substantially reduces confidence in the manuscript.
Questions for authors
-
What are the complete definitions of , , , , graph construction/update, and query-dependent selection of ? Under exactly which checkable data-distribution and graph assumptions can a fixed , independent of , return the global optimum or a stated approximation? In particular, how does Theorem 1 avoid the bounded-degree path-graph counterexample above, and how is Eq. (2) derived rather than assumed?
-
Were any "simulation benchmarks" actually run? If so, please provide the implementation and complete results on standard static and streaming ANN benchmarks, including recall/accuracy versus latency, , , memory, index construction, insertion/deletion cost, and strong HNSW/DiskANN-style dynamic baselines. For the PIM claim, please provide a reproducible architecture/circuit model and area, power, latency, bandwidth, routing, and technology-node assumptions. This is evidence needed for the present claims, not an optional future-work suggestion.
-
Please provide stable bibliographic identifiers or anonymized-access artifacts for [2], [3], [5], and [9]. In particular, [5] and [9] appear to combine titles, authors, venues, and page ranges from different real PIM publications. Please also reconcile the claim of simulation benchmarks with the absence of any reported experiment.