Formalizing and Estimating Task-Space Complexity for Zero-shot Generalization

arXiv:2606.20967v2 Announce Type: replace-cross Abstract: Generalization is crucial for modern control, but learning across tasks can be costly. Recent work shows that zero-shot transfer, in which a controller designed for a source task is directly deployed to a target task, can achieve strong performance. We formalize task-space complexity, which characterizes the difficulty of achieving sufficiently good performance across a collection of tasks, by casting source selection as a covering problem. We provide bounds on the complexity and demonstrate its applicability.