- Rating
- 3
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper introduces tangle-core abstractions, a topology-aware approach to discovering overlapping regions in empirical transition graphs. It provides extensive theoretical results, including value bounds and fixed-budget interface guarantees, clarifying when overlapping representations can improve decision-making. Empirical evaluations across several domains demonstrate favourable compression–return trade-offs compared with existing baselines, while diagnostic experiments identify the settings in which the approach is most effective.
Critical strengths
-
The theoretical part is strong and helps clarify the context and scale of the paper.
-
The proposed method is presented clearly, intuitively, and in a well-structured manner, making the overall framework, its key components, and their interactions easy to follow and understand. The paper coherently explains the methodological design and clearly motivates the role of each component within the broader approach. This clarity helps readers understand the underlying rationale and appreciate how the different components work together to achieve the intended objectives.
Critical weaknesses
-
The paper would benefit from a more comprehensive analysis of the computational costs of tangle-core abstractions relative to competing methods, as such results are currently reported only for the Corridor-9 environment. Although the proposed framework demonstrates promising performance, its additional computational overhead may limit its practical applicability. The authors should therefore report and compare metrics such as training time or return-training time curves across tangle-core abstractions and baseline methods in more environments. If the performance gains are modest relative to the additional computational costs, the practical benefits of the proposed approach may be less substantial than the results suggest.
-
The effectiveness and scalability of the proposed method would be better demonstrated by evaluating it on additional, more challenging discrete environments beyond those considered in the paper. Potential examples include larger MiniGrid MultiRoom and DoorKey environments, as well as procedurally generated navigation tasks with multiple goals, bottlenecks, and more complex topologies. Experiments across environments of increasing size and complexity would provide stronger evidence of the method's scalability and clarify whether its advantages persist in more challenging settings.
Questions for authors
Please refer to the Weaknesses section, as it reflects my main concerns and questions for the authors. Any additional clarifications would be appreciated. Regarding scalability, further experiments are not strictly necessary; additional intuition or empirical evidence would also help address my concerns.
Response to Reviewer GFz5
Thank you for the positive assessment and the request for cost results. The table summarizes our answers, and the text after it gives the details.
Sixteen-room comparison. All methods share the ground data, the execution assistance, the compression-selection rule, and paired start and goal queries. Independently generated layouts are the replication units.
Let a baseline have construction time CB and planning time tB, and let the tangle method have CT and tT<tB. Tangle cores then have the lower total cost once the number of queries exceeds (CT−CB)/(tB−tT). This is 76 queries against ground value iteration and 340 against Detected-B. The comparison therefore concerns a tradeoff between return and amortized cost, not a single-query advantage. At a larger scale, the construction on a sparse graph of 25,000 states and 101,400 edges takes 171.4±9.7 seconds and 2.1 GB on one AMD EPYC 7543 core (Section 3).
Construction time in every environment. The tangle-core runtime is 0.8 s on FourRooms, 3.4 s on Corridor-9, 6.2 s on Multi-Goal, 18.5 s on Synthetic-Folding, 4.1 s per random maze, 5.5 s on MiniGrid, and 0.4 s on Chain-100 (Table 3). On Taxi, MultiRoom-N6, and DoorKey-16×16 it is 2.7 s, 8.6 s, and 6.9 s, and core discovery takes most of it (Table 24). Value iteration on the abstract model takes at most 0.08 s.
Larger MiniGrid domains. Every abstraction uses the same gateway controller.
Tangle cores use far fewer abstract states than bisimulation at a slightly lower return. They use fewer states than Detected-B and spectral clustering at a higher return. This is a compression–return tradeoff, not an advantage in absolute return.
We hope the cost results help, and we would be glad to answer further questions.