- Rating
- 4
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
ActBasis parameterizes network-scheduling actions using compact coefficients over a fixed temporal basis, reconstructing timing scores over the full scheduling grid before selecting a feasible route and transmission time. The paper provides representation and decision-stability analyses and evaluates the method on an A380-style network and a controlled single-resource task. The results show scheduling performance close to dense timing-score policies, with up to 125× fewer timing outputs per link and a measured 9.81× reduction in replay transition payload.
Critical strengths
-
ActBasis substantially reduces timing-output dimensionality while retaining comparable scheduling performance under a matched encoder, TD3 learner, critic interface, and decoder. At the high-resolution 1,000-message setting, it achieves 94.87% success versus Dense’s 95.30%, using 64 rather than 8,000 timing outputs per link. The measured replay-payload reduction makes this compression result practically relevant.
-
The controlled study separates grid resolution from coefficient dimension and includes independent test instances, numerical-precision controls, and untrained-policy comparisons. These experiments show both a capacity–performance trade-off and an initialization effect, providing more information about the representation than a final-performance comparison alone.
Critical weaknesses
-
The initialization results in Section 5.4 make this distinction consequential. At the finest grid, untrained ActBasis-64 achieves 68.94% success, compared with 69.61% after training and 66.93% for trained Dense. The paper acknowledges that much of the advantage exists before learning, but the current controls do not explain which properties of the representation produce this advantage or whether other compact parameterizations would provide similar benefits.
-
The paper lacks comparisons with other compact action representations. Without comparisons against methods such as an interpolated low-resolution score head or another fixed basis, it is difficult to assess the advantage of the proposed harmonic parameterization over other compact alternatives.
Questions for authors
-
How many independently generated network traffic instances underlie Table 1? Do any existing network results evaluate workloads that were not used for policy optimization or checkpoint selection?
-
What motivates the choice of a fixed temporal basis in Section 4.1? How does the proposed parameterization differ from a compact score head followed by interpolation?
-
Section 5.4 shows that much of the single-resource advantage is already present before training. Do the existing network runs show a similar initialization advantage, and how much additional improvement comes from learning?
3 comments
Thank you for the clear response. They address my questions, and I look forward to seeing what you find about how ActBasis generalizes to unseen network traffic.
Thanks for the constructive feedback. We are glad our response was helpful and will keep working on ActBasis's generalization to unseen traffic.
Thank you for your feedback.
Q1: How many independent traffic instances underlie Table 1? Was any network traffic evaluated that was not used for optimization or checkpoint selection?
Res1: The original Table 1 was based on a single A380 traffic sequence of 1,000 messages. Each of the six topologies in the new Table 1 uses a separately generated traffic instance. Message attributes are fixed once generated. Different grid sizes H within the same topology share the same traffic instance, and three seeds are used to compute the standard deviation across training runs.
Policy optimization and checkpoint selection in the network experiments use their corresponding fixed instances, and no separate test traffic was generated, as our goal is to compare how different action representations solve the same scheduling problem. The single-resource experiments instead use separate training, validation, and test instances, as described in Appendix B.3. Generalization of network policies to unseen traffic is the focus of our next research phase, since, as reviewer ovMJ noted, such changes may affect the feasible set, deadlines, and state distribution.
Q2: Why was a fixed temporal basis adopted, and how does this differ from interpolation following a compact scoring head?
Res2: As shown in §4.1, Figure 8, and Appendix E.1, a fixed basis uses a small number of coefficients to generate action values for the full action matrix. The harmonic basis (which we use) determines the scores at all action positions through sine and cosine components, while linear interpolation generates piecewise-linear scores from adjacent node values. Both can be viewed as fixed basis mappings.
The distinction lies in the basis structure. Linear interpolation is equivalent to a first-order piecewise-linear, locally supported basis, where the score at each position is determined solely by adjacent nodes. In contrast, the harmonic basis consists of global frequency components, with each coefficient influencing the scores at all action positions. Our newly added basis-comparison experiments on the controlled single-resource task (Appendix E) support the advantage of the global, ordered structure. As shown in Table 14, the cubic B-spline (also a locally supported basis) reaches 67.60% after training, below the harmonic basis (69.61%) and DCT-II (69.29%). This indicates that a global, ordered frequency structure preserves scheduling capability better than local interpolation, with our default harmonic basis achieving the highest overall performance.
Q3: Do the network runs show a similar initialization advantage, and how much additional improvement comes from learning?
Res3: As shown in our newly added Table 2, the network runs do not exhibit a consistent initialization advantage like that of the single-resource task, but our ActBasis maintains scheduling performance comparable to Dense both before and after training. The single-resource task removes the additional effects of routing and cross-link coordination, whereas action-value estimation in the network must jointly satisfy multi-link and periodic constraints, so the relative performance at initialization varies with the topology and grid size.
As shown in Table 13, across the 30 topology–grid pairs where multiple flows compete for limited slots, training improves the success rate by 0.38 percentage points for Dense and 0.77 for ActBasis under the same episode budget. The gains vary by topology and grid size, with the S topology at H = 400 showing the largest improvement (2.03 and 3.36 percentage points, respectively). Complete results are provided in Appendix D.3.