A Goal-Set Characterization of Task Composition in the Boolean Task Algebra

In three linesBoolean Task Algebra (BTA) enables zero-shot task composition in RL. Authors prove that in deterministic MDPs, optimal Q-value functions collapse to universal and empty tasks, making logarithmic base tasks redundant. They propose a goal-set-based composition method reducing learning and composition costs while maintaining policy performance across tabular, visual, and continuous-control domains.

Summary generated by Claude — human-verified