- Rating
- 1
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes GTA+-PS to improve the scalability of graph-topology-augmented prioritized planning in non-stationary reinforcement learning. It uses batched Woodbury updates to maintain resolvent operators under localized transition changes, introduces a trace-derived Spectral Trust statistic for priority weighting and Gumbel-based selection, and employs coherent commits to keep numerical and queue states consistent.
Critical strengths
-
Batched low-rank updates and separation of operator changes from reward-only refreshes directly address a relevant computational bottleneck in topology-aware planning.
-
Coherent commits, sparse/dense backends, and numerical checks form a useful framework for maintaining consistent planning state under asynchronous updates.
Critical weaknesses
-
In Table 2, all 12 recovery-time entries for GTA-PS and GTA+-PS are explicitly marked as projected, yet they are presented alongside measured baseline results to support substantial wall-clock improvements.
-
Stage I mainly considers reward shifts, whereas the Woodbury maintenance scheme is intended for changes in transition dynamics. There is a lack of more direct assessments conducted in contexts where transfer characteristics change.
-
The wall-clock experiments compare CPU-based baselines with GPU-accelerated variants, and Stage II reports only one independent training run per method. These limitations make the improvements less conclusive.
Questions for authors
-
Table 2 marks all 12 recovery-time results for GTA-PS and GTA+-PS as projected rather than measured, despite using them to support the paper's central efficiency claims. Why are projected values presented as benchmark results, and what empirical evidence supports these numbers?
-
Can the authors provide actual per-seed wall-clock measurements? Without such evidence, how can the claimed speedups be considered experimentally validated?
-
Can the authors evaluate GTA+-PS under explicit transition-model changes, rather than primarily reward shifts, to show when incremental operator maintenance is beneficial?
-
The no-jitter variant is useful, but can the authors further isolate the effect of Spectral Trust?
3 comments
The response did not address my concerns; I am keeping my original rating.
Regardless of whether this is actually the case, the paper reads as though it were generated primarily—if not entirely—by a large language model (LLM), including the data and figures; as such, it is fundamentally unreviewable. There is virtually no evidence of human input. While the work may contain some interesting ideas, the entire paper requires a complete rewrite; it is certainly not suitable for publication at this conference. Furthermore, it is impossible to provide specific suggestions for improvement; I recommend studying high-quality papers previously published at ICLR to better understand the expected standards. I apologize if this sounds harsh, but asking reviewers to spend their time evaluating such rough, unpolished material is, in itself, quite inconsiderate.
You should at least get a number for such bold claim.
https://opentextdetector.com/?collection=iclr%2F2027&q=52511
This is neatly in the lower quartile (if not the lower 10%) of AI-smelliness for this year.
Not everyone is born white.
With the variation of our wording and latex/markdown formatting, we have put significant efforts to maintain readability and smoothness of our exposition. Our metadata and paper statement reflect all the assists, with due uniformity till now. Of course you dont have anything to back yours "virtually no evidence of human input".
You put 2 for clarity. Have you read back what is the description for such? The other two agree on presentation being understandable.
"Unreviewable"?, "impossible to provide specific suggestions for improvement"? DeuG shows substantial extensive angles. We addressed both yours and theirs already.
"The response did not address my concerns". And without any elaboration for such, you turn counterclockwise for a big d*mn red-herring: committing in AI witch-hunting.
What concern?
Your concern about the tex/seaborn figure? The writer of such code is Claude. The data, color palette, margin, sketch, layout,... is of us. I bet you find such figures in ICLR, at least of your batch, that is not at least scripted by AI. We are approaching one-year anniversary of this new normal.
Your concern about our standard? Have you read the predecessor paper? Make a comparison of such? Writing? Pedagogy? Our paper definitely aces, within your criteria.
GTA-PS is accepted in NeurIPS, by a convenient margin.
And dont let us to use Pangram. On your comments. The result is...
We think you should have accepted that you can not poke more professional criticism. Confidence 4 with such shallow angles.
You are not an expert of LLM writing as you thought.
Official Rebuttal of 33uu's Review by Authors
We thank Reviewer 33uu for the direct and precise review. We apologize for the projected entries in Table 2. Please disregard them.
This reply first gives the measured Stage-I results. We then answers each weakness and question in order.
Requested Data
We demonstrate the stage-I canonical result, under more developed engineering.
We adjusted three protocols: a 90% gap target (was 80%), 30 seeds at 1k (was 10), and added transition changes. All improve the result's fidelity.
Table C.1. Wall time per seed (s), mean ± 95% interval.
CargoTaxi uses the sparse option for low branching factor (~5) and inherent 2D model (low-dimensional).
Table C.2. Paired backups against Standard-PS. (x/y): the method wins on x of the y seeds where both reach the target.
We provide one more table of sparse-dense backend capacity on 1k's:
Table C.3. 1k time against topology memory, GTA-Full (sparse / dense).
This is crucial to address CargoTaxi-4500's dire clock performance of GTA(+) later.
Elaboration
We address the weaknesses first:
Canonical data. As above. Clear win for the dense backend of GTA-Full. GTA-Trust holds its ground, implying the Spectral Trace does raise transparent efficiency and robustness.
Topological non-stationarity gain. As of our localized mass shift -- identical for all methods -- the GTA family retains proficiency. If GTA-PS can beat the two vanillas on such (of both the predecessor's and ours), GTA+ methods should, and have beated, all the three controls.
CPU against GPU. We agree, and we elaborate why in our metareview. We will provide GPU implementation and ablation on further demand.
Stage-II. As per metareview.
We then address the remaining question 4 of the no-jitter variant.
Post-mortem analysis
This is not of your scope but of the data and method understanding.
We ask the Reviewer to assess the data, its integrity, and our subsequent analysis, with openness. The data reflects the theory neatly, and we hope that its fidelity can merit your score adjustment.
Sincerely,
Authors