1. Insufficient novelty and limited scientific insight.
My primary concern is that the paper does not establish a sufficiently substantial research contribution. The central observation—that sharing information across related decisions can be detrimental when the assumed relationships are inaccurate or the learning mechanisms are not properly calibrated—is already well understood in structured estimation and online learning. The reported outcome therefore does not, by itself, provide a particularly surprising or generalizable insight.
The paper does not propose a fundamentally new learning principle, establish theoretical guarantees, or identify general conditions under which the hierarchical mechanism should outperform or underperform alternative methods. The main contribution is instead an empirical comparison of two specific implementations.
The additive decomposition of edge scores into node-level and edge-specific components is perhaps the most concrete modeling element in the paper. However, its novelty and general applicability are insufficiently established. Such a decomposition resembles conventional additive-effect models, and its usefulness depends on whether the underlying reward structure can be meaningfully represented through shared node contributions and local edge effects.
The paper does not explain why this particular representation is appropriate beyond the chosen routing environment, nor does it investigate how the mechanism behaves under alternative dependency structures, more complex interactions, or different graph topologies.
Consequently, even this modeling component remains insufficiently developed as a general methodological contribution.
2. The experimental evidence is too limited to explain the observed performance differences.
A second major concern is that the experimental design does not isolate the effect of information sharing from other differences between the learning mechanisms.
According to Section 4.2, the compared methods differ not only in their parameter representations but also in their updating procedures, score construction, and parameter constraints. The subsequent analysis confirms that these differences lead to substantially different action-selection behavior.
For example, Table 2 reports normalized path entropies of 0.629 and 0.969 for the edge-based and hierarchical methods, respectively. Their maximum path-selection probabilities also differ considerably (0.468 versus 0.076). These discrepancies indicate that the algorithms operate under very different effective exploration behaviors.
As a result, the reported difference in recovery time cannot be attributed specifically to the proposed information-sharing structure. It may instead reflect differences in score scaling, parameter updates, or the resulting exploration patterns.
Furthermore, the experiments rely on a single small graph family, a fixed disruption magnitude, and a limited set of algorithm configurations. There is no systematic component-wise analysis that separates the effects of node parameters, edge parameters, regularization, and action selection. Nor is there sufficient evidence showing that the conclusions persist across substantially different structured decision problems.
The observed performance difference may therefore be specific to the implementations and configurations being compared.
More importantly, the paper does not establish a general mechanism explaining when hierarchical information sharing is useful, when it becomes harmful, or how its effectiveness depends on the underlying problem structure.
Without such an explanation, the findings remain primarily descriptive rather than providing a substantial advance in our understanding of structured online learning.