Meta-, multi-task, and federated learning can be all viewed as solving
similar tasks, drawn from a distribution that reflects task similarities. We
provide a unified view of all these problems, as learning to act in a
hierarchical Bayesian bandit. We propose and analyze a natural hiera