- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper proposes Multi-task Orchestration via Sparse Atomic Interpolated Control (MOSAIC), an approach to multi-task learning that attempts, to automatically learn options (sequences of actions) that can be re-used across a multi-task learning setup, minimizing negative transfer and encouraging positive transfer across tasks with a shared structure or with similar requirements (for example, two tasks both require swiping from left-to-right, so the model could learn this atomic skill that can be activated at the right time for both tasks, while separately learning a right-to-left swipe that doesn't conflict or overwrite previous behaviors).
Critical strengths
- MOSAIC is compared comprehensively to existing strategies, such as naive multi-task learning, or gradient regularization techniques. The results show that MOSAIC learns much more robust policies that achieve significantly more consistent and reliable performance gains relative to prior work.
- The paper is clearly written and easy to understand, despite containing a fair degree of complexity for the final system. I feel that most readers will be able to follow this work, and to therefore benefit from and built off of it.
- The experiments and results present findings both on final performance in terms of success rates and also on related metrics like skill overlap and runtime efficiency. This helps to create a more complete picture of how MOSAIC performs relative to baselines, and the metrics generally show that MOSAIC performs on-par or better than all baselines while staying very competitive in terms of runtime and efficiency.
- An ablation study helps to clearly demonstrate the contributions of each component in isolation.
Critical weaknesses
- MOSAIC is a fairly complex system, so much so that significant portions of the paper have been relegated to the Appendix. While some of these elements may be part of the "usual RL pipeline", it can leave the paper in an awkward spot. For example, much of Figure 2 is actually not represented in the main text (the entire bottom half of the figure). While I finished the paper and had a good sense for what happened and how it all worked together, I would struggle to actually reproduce the results from the main text alone. The authors state that code will be released, which does help mitigate this concern.
- A related weakness of the paper is the complexity itself. The forefront of robotics is centered around scale and VLAs, and a quite complex bespoke system is unlikely to have significant impact on that forefront, as it is very unclear how such a system would apply to these state-of-the-art policies and architectures. I do not believe this is sufficient cause for rejection, but it does limit the impact of the work.
- The basis and option usage diagnostics are not very well explained, and it is not clear how to read these results. The metrics are not introduced, the rows are not really introduced, separated out, or explained. These results seem very helpful for contextualizing the claims of the paper around things like separation of bases, re-usability of skills, and contextualization of skills, so the table deserves more explanation.
- The paper uses "spike-and-slab" repeatedly in the first few pages, but this phrase is not defined or explained until page 5. I don't know if it is strictly necessary everywhere that it is currently used, and the paper could be easier to read with more readily understandable text.
Questions for authors
- Section 3 introduces the task definition vector as a language instruction, but states that it could also be a task index. A task index would likely be much more computationally demanding for learning the relevant bases, and would make generalization very implausible. Are there any experiments on MT-10 or MT-50 with task indices, or was the entire paper done with language vectors? And how were the language vectors generated?
Dear reviewers,
The author-reviewer discussion period closes on November 18 (AoE). Please engage in response periods so that we have our issues discussed thoroughly (if you haven't done so).
AC