~/talk

Probabilistic Lipschitz Analysis of Neural Networks

Talkat SAS 2020 · 2020-11-18..11-20· [machine-learning]
links:none on file
links:none on file
links:none on file
slides:none on file

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

  1. 0:00Intro
  2. 1:32Learning neural networks
  3. 3:10Notions of correctness for neural networks
  4. 4:16Why care about robustness?
  5. 5:08Notions of robustness
  6. 7:07Representing input distribution D
  7. 8:13pcat language
  8. 9:16Verifying probabilistic Lipschitzness
  9. 10:23Lipschitzness via Jacobians
  10. 11:37Jacobian analysis
  11. 12:43Computing probabilistic mass
  12. 13:50Some empirical results
  13. 16:40Open questions
  14. 17:51In the paper
  15. 18:25Conclusion
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.