Probabilistic Lipschitz Analysis of Neural Networks
summary
Defines probabilistic Lipschitzness: for pairs sampled from a generative input model, nearby inputs map to nearby outputs with high probability. Models inputs as a pcat program that samples a standard Gaussian then runs a generator g, analyzes f on g(S) by picking box-shaped S, computing S' = g(S), and proving k-Lipschitzness via a Jacobian analysis that bounds each partial derivative interval and over-approximates the operator norm. Gaussian mass of boxes is computed by z-table lookup. Empirically runs on MNIST and CIFAR show larger boxes and larger networks increase iteration time; code and proofs provided.
AI-written summary · about
chapters (15)
- 0:00Intro
- 1:32Learning neural networks
- 3:10Notions of correctness for neural networks
- 4:16Why care about robustness?
- 5:08Notions of robustness
- 7:07Representing input distribution D
- 8:13pcat language
- 9:16Verifying probabilistic Lipschitzness
- 10:23Lipschitzness via Jacobians
- 11:37Jacobian analysis
- 12:43Computing probabilistic mass
- 13:50Some empirical results
- 16:40Open questions
- 17:51In the paper
- 18:25Conclusion
related talks
54mGraph Machine Learning & Random Graph Models
01h 03mLogic and Probabilistic Circuits 2
17mUniversality of Neural Networks
48mProvable Robustness Beyond Bound Propagation
01h 05mLogic and Probabilistic Circuits 1
45mStudying Generalization in Deep Learning via PAC-Bayes
59mTutorial: Statistical Learning Theory and Neural Networks I
01h 02mTutorial: Statistical Learning Theory and Neural Networks II
