Boolean Task Algebra formalized for RL task composition

Arxiv CS.LG (machine learning)

The paper revisits the Boolean Task Algebra (BTA) and formalizes a collapse in its structural assumptions. It provides a goal-set characterization for zero-shot composition of goal-reaching tasks using Boolean operations in reinforcement learning.

Arxiv CS.LG (machine learning)·Eduardo Terr\'es-CaballeroHerke van Hoof

7 days ago