Recently,researchers extended 1-hop message passing to K-hop message passing by aggregating information fromK-hop neighbors of nodes simultaneously. However, there is no work on analyzing the expressive powerofK-hopmessagepassing.

We then propose a novel algorithm based on minimum-distance functionals in the setting where the transition model is given and the expert is deterministic.Thealgorithmissuboptimalby .|S|H3/2/N,matchingourlower