About this paper

Studies how almost pairwise independence limits the information available to gradient-based learning attacks.

Gradient variance bounds explain why certain cryptographic function classes are difficult to learn under regular parameterizations. Experiments with Learning with Errors mappings explore how the theory appears during training.