Training on large-scale graphs has achieved remarkable results in graph representation learning, but its cost and storage have attracted increasing concerns.
In this paper, we propose a theoretically-principled measure for the invertibility of instance encoding based on Fisher information that is broadly applicable to a wide range of popular encoders.