Fetching the paper…
Reading the bibliography…
The local Lipschitz constant of a neural network is a useful metric with applications in robustness, generalization, and fairness evaluation.
Generalized gradients and applications
Frank H Clarke · 1975
Earlier work this paper cites.
Complexity of k-sat
R. Impagliazzo and R. Paturi · 1999
Earlier work this paper cites.
Lectures on Lipschitz analysis
Juha Heinonen · 2005
Earlier work this paper cites.
Analysis of different norms and corresponding lipschitz constants for global optimization
Remigijus Paulavičius and Julius Žilinskas · 2006
Earlier work this paper cites.
Linear degree extractors and the inapproximability of max clique and chromatic number
David Zuckerman · 2007
Earlier work this paper cites.
Evaluating derivatives: principles and techniques of algorithmic differentiation , volume 105
Andreas Griewank and Andrea Walther · 2008
Earlier work this paper cites.
Fairness through awareness, 2011
Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold, and Rich Zemel · 2011
Earlier work this paper cites.
The design of approximation algorithms
David P Williamson and David B Shmoys · 2011
Earlier work this paper cites.
Intriguing properties of neural networks
Christian Szegedy, Wojciech Zaremba, Ilya Sutskever, Joan Bruna, Dumitru Erhan, Ian Goodfellow, and Rob Fergus · 2013
Earlier work this paper cites.
Evaluating an element of the clarke generalized jacobian of a composite piecewise differentiable function
Kamil A Khan and Paul I Barton · 2013
Earlier work this paper cites.
Algorithmics for hard problems: introduction to combinatorial optimization, randomization, approximation, and heuristics
Juraj Hromkovič · 2013
Earlier work this paper cites.
Adam: A method for stochastic optimization
Diederik P Kingma and Jimmy Ba · 2014
Earlier work this paper cites.
Delving deep into rectifiers: Surpassing Human-Level performance on ImageNet classification
Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun · 2015
Earlier work this paper cites.
Wasserstein GAN
Martin Arjovsky, Soumith Chintala, and Léon Bottou · 2017
Cited alongside, same era.
Parseval networks: Improving robustness to adversarial examples
Moustapha Cisse, Piotr Bojanowski, Edouard Grave, Yann Dauphin, and Nicolas Usunier · 2017
Cited alongside, same era.
On the regularization of wasserstein GANs
Henning Petzka, Asja Fischer, and Denis Lukovnicov · 2017
Cited alongside, same era.
Spectrally-normalized margin bounds for neural networks
Peter Bartlett, Dylan J Foster, and Matus Telgarsky · 2017
Cited alongside, same era.
Automatic differentiation in pytorch
Adam Paszke, Sam Gross, Soumith Chintala, Gregory Chanan, Edward Yang, Zachary DeVito, Zeming Lin, Alban Desmaison, Luca Antiga, and Adam Lerer · 2017
Cited alongside, same era.
An approach to reachability analysis for feed-forward ReLU neural networks
Alessio Lomuscio and Lalit Maganti · 2017
Cited alongside, same era.
Training for faster adversarial robustness verification via inducing ReLU stability
Kai Y Xiao, Vincent Tjeng, Nur Muhammad Shafiullah, and Aleksander Madry · 2018
Later among the works it cites.
Fast and effective robustness certification
Gagandeep Singh, Timon Gehr, Matthew Mirman, Markus Püschel, and Martin Vechev · 2018
Later among the works it cites.
Semidefinite relaxations for certifying robustness to adversarial examples
Aditi Raghunathan, Jacob Steinhardt, and Percy Liang · 2018
Later among the works it cites.
Efficient neural network robustness certification with general activation functions
Huan Zhang, Tsui-Wei Weng, Pin-Yu Chen, Cho-Jui Hsieh, and Luca Daniel · 2018
Later among the works it cites.
Lipschitz constant estimation of neural networks via sparse polynomial optimization
Fabian Latorre, Paul Rolland, and Volkan Cevher · 2019
Later among the works it cites.
Deep ReLU networks have surprisingly few activation patterns
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Evaluating robustness of neural networks with mixed integer programming
Vincent Tjeng, Kai Xiao, and Russ Tedrake · 2017
Cited alongside, same era.
Output range analysis for deep neural networks
Souradeep Dutta, Susmit Jha, Sriram Sanakaranarayanan, and Ashish Tiwari · 2017
Cited alongside, same era.
Maximum resilience of artificial neural networks
Chih-Hong Cheng, Georg Nührenberg, and Harald Ruess · 2017
Cited alongside, same era.
Provable defenses against adversarial examples via the convex outer adversarial polytope
J Zico Kolter and Eric Wong · 2017
Cited alongside, same era.
Provably correct automatic sub-differentiation for qualified programs
Sham M Kakade and Jason D Lee · 2018
Cited alongside, same era.
Lipschitz regularity of deep neural networks: analysis and efficient estimation
Aladin Virmaux and Kevin Scaman · 2018
Cited alongside, same era.
Boris Hanin and David Rolnick · 2019
Later among the works it cites.
An abstract domain for certifying neural networks
Singh, Gehr, Püschel, and Vechev · 2019
Later among the works it cites.
Efficient and accurate estimation of lipschitz constants for deep neural networks
Mahyar Fazlyab, Alexander Robey, Hamed Hassani, Manfred Morari, and George Pappas · 2019
Later among the works it cites.
Adversarial robustness through local lipschitzness, 2020
Yao-Yuan Yang, Cyrus Rashtchian, Hongyang Zhang, Ruslan Salakhutdinov, and Kamalika Chaudhuri · 2020
Closest in time.
Training individually fair ml models with sensitive subspace robustness
Mikhail Yurochkin, Amanda Bower, and Yuekai Sun · 2020
Closest in time.
Verification of deep convolutional neural networks using imagestars, 2020
Hoang-Dung Tran, Stanley Bak, Weiming Xiang, and Taylor T. Johnson · 2020
Closest in time.
6.892 algorithmic lower bounds: Fun with hardness proofs (spring ’19)
Erik Demaine · 2020
Closest in time.
Gurobi optimizer reference manual, 2020
LLC Gurobi Optimization · 2020
Closest in time.