Response to reviewer fnTY
**Comparison with Tang et al. 2022**
Thank you for bringing this piece of research to our attention, which we have now included in our Related Work section. While both studies operate in the realm of Q-function decomposition within factored action spaces, there are two key distinctions with respective to their theoretical analyses.
First and foremost, our analysis focuses on the bias/variance of the error between the true and (function) approximated Q-values, whereas Tang et al. focus on the fundamental properties of the Q-values themselves. The outcomes of our respective analyses reflect how these related, but distinct, attributes change when moving from the standard Q-learning approach to one based on value-decomposition, and hence these analyses can be thought of as complementary rather than contradictory.
Second, there is a minor difference in the value-decomposition itself. We use the decomposition proposed by Seyde et al., which involves taking a _mean_ of utility values to approximate the global Q-values, whereas Tang et al. take the _sum_ of utility values. For completeness, we have added a section in Appendix B that analyses this sum variant under our framework, and we find this time that both the bias and variance are higher. We could of course mirror Tang et al’s. analysis using the mean instead of the sum, but this is beyond the intended scope of our paper which is interested in the error as stated above.
In summary, the apparent discrepancies concerning variance can be attributed to varying methodologies and distinct theoretical frameworks, which when taken together provide complementary perspectives and insights into Q-learning in FMDPs using value-decomposition.
**Q-value decomposition**
Our analysis assumes that the Q-function can be decomposed for practical approximation, an approach extended to the true Q-function in Equation (4.2). While, as Tang et al. 2022 highlight, such decomposition may not perfectly align with the true Q-function in practice, we posit that it offers a close enough approximation for the purposes of reinforcement learning, where exact representations are often unattainable. This assumption underpins our theoretical framework and the development of REValueD. The strong empirical results, acknowledged by the reviewer, provide further evidence that this decomposition approach is adequate in many practical tasks.
**Performance of BDQ**
Thank you for pointing out that a more like-for-like comparison of BDQ would be to compare to BDQ with an ensemble. In Appendix K we have added some comparisons with BDQ-ensemeble in the environments where the bin size is 3, and in the variants with larger bin sizes, and find that the performance remains largely unchanged when equipping BDQ with an ensemble.
As for the performance of BDQ in Figures 1 vs. 2, it is important to note that the x-axis scale (also note as per request of reviewer Athy we have changed x-axis scale from updates to environment interactions) changes slightly between Figures 1 and 2 for the dog-walk task. In Figure 1 we cut the figure off after 750k environment interactions, at which point BDQ obtains a score of ~500, whereas BDQ in Figure 2 is achieving approximately this score after 1M env interactions for $n = 10, 30$, so it is taking more environment interactions to achieve the same score when using a higher bin size, though the performance does not diminish as quickly as DecQN when using a higher bin size.
**Presentation suggestions**
Regarding your suggestion for Table 2, we agree that bolding the best results for each task would significantly enhance readability and quick comprehension of the table. We have incorporated this in the revised version of the manuscript.