2 citations · 2 across the 9 of their papers we have counts for
1 paper · 1 filter
Vittorio Cipriani, Valentino Delle Rose, Luca San Mauro +1
We study PAC and online learnability of hypothesis classes formed by copies of a countably infinite graph G, where each copy is induced by permuting G's vertices. This corresponds…