Fetching the paper…
Reading the bibliography…
The Lipschitz constant of a network plays an important role in many applications of deep learning, such as robustness certification and Wasserstein Generative Adversarial Network.
Anneaux préordonnés
Jean-Louis Krivine · 1964
Earlier work this paper cites.
A nullstellensatz and a positivstellensatz in semialgebraic geometry
Gilbert Stengle · 1974
Earlier work this paper cites.
Quadratic optimization problems
Naum Z Shor · 1987
Earlier work this paper cites.
Positive polynomials on compact semi-algebraic sets
Mihai Putinar · 1993
Earlier work this paper cites.
Global optimization with polynomials and the problem of moments
Jean B Lasserre · 2001
Earlier work this paper cites.
A comparison of the sherali-adams, lovász-schrijver, and lasserre relaxations for 0–1 programming
Monique Laurent · 2003
Earlier work this paper cites.
Yalmip: A toolbox for modeling and optimization in matlab
Johan Löfberg · 2004
Earlier work this paper cites.
Convergent sdp-relaxations in polynomial optimization with sparsity
Jean B Lasserre · 2006
Earlier work this paper cites.
Sums of squares and semidefinite program relaxations for polynomial optimization problems with structured sparsity
Hayato Waki, Sunyoung Kim, Masakazu Kojima, and Masakazu Muramatsu · 2006
Earlier work this paper cites.
Gloptipoly 3: moments, optimization and semidefinite programming
Didier Henrion, Jean-Bernard Lasserre, and Johan Löfberg · 2009
Earlier work this paper cites.
Dsos and sdsos optimization: Lp and socp-based alternatives to sum of squares optimization
Amir Ali Ahmadi and Anirudha Majumdar · 2014
Earlier work this paper cites.
Optimality conditions and finite convergence of lasserre’s hierarchy
Jiawang Nie · 2014
Earlier work this paper cites.
An introduction to polynomial and semi-algebraic optimization
Jean Bernard Lasserre · 2015
Earlier work this paper cites.
Computational analysis of sparsity-exploiting moment relaxations of the opf problem
D. K. Molzahn, I. A. Hiskens, C. Josz, and P. Panciatici · 2016
Earlier work this paper cites.
Wasserstein generative adversarial networks
Martin Arjovsky, Soumith Chintala, and Léon Bottou · 2017
Cited alongside, same era.
Julia: A fresh approach to numerical computing
Jeff Bezanson, Alan Edelman, Stefan Karpinski, and Viral B Shah · 2017
Cited alongside, same era.
Improved training of wasserstein gans
Ishaan Gulrajani, Faruk Ahmed, Martin Arjovsky, Vincent Dumoulin, and Aaron C Courville · 2017
Cited alongside, same era.
A bounded degree sos hierarchy for polynomial optimization
Jean B Lasserre, Kim-Chuan Toh, and Shouguang Yang · 2017
Cited alongside, same era.
Certified roundoff error bounds using semidefinite programming
V. Magron, G. Constantinides, and A. Donaldson · 2017
Cited alongside, same era.
Evaluating robustness of neural networks with mixed integer programming
Vincent Tjeng, Kai Xiao, and Russ Tedrake · 2017
Lipschitz regularity of deep neural networks: Analysis and efficient estimation
Aladin Virmaux and Kevin Scaman · 2018
Later among the works it cites.
Towards fast computation of certified robustness for relu networks
Tsui-Wei Weng, Huan Zhang, Hongge Chen, Zhao Song, Cho-Jui Hsieh, Duane Boning, Inderjit S Dhillon, and Luca Daniel · 2018
Later among the works it cites.
Evaluating the robustness of neural networks: An extreme value theory approach
Tsui-Wei Weng, Huan Zhang, Pin-Yu Chen, Jinfeng Yi, Dong Su, Yupeng Gao, Cho-Jui Hsieh, and Luca Daniel · 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.
Sorting out Lipschitz function approximation
Cem Anil, James Lucas, and Roger Grosse · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Provable defenses against adversarial examples via the convex outer adversarial polytope
Eric Wong and J Zico Kolter · 2017
Cited alongside, same era.
A dual approach to scalable verification of deep networks
Krishnamurthy Dvijotham, Robert Stanforth, Sven Gowal, Timothy A Mann, and Pushmeet Kohli · 2018
Cited alongside, same era.
Limitations of the lipschitz constant as a defense against adversarial examples
Todd Huster, Cho-Yu Jason Chiang, and Ritu Chadha · 2018
Cited alongside, same era.
Provably correct automatic sub-differentiation for qualified programs
Sham M Kakade and Jason D Lee · 2018
Cited alongside, same era.
Spectral normalization for generative adversarial networks
Takeru Miyato, Toshiki Kataoka, Masanori Koyama, and Yuichi Yoshida · 2018
Cited alongside, same era.
Certified defenses against adversarial examples
Aditi Raghunathan, Jacob Steinhardt, and Percy Liang · 2018
Cited alongside, same era.
Jérôme Bolte and Edouard Pauwels · 2019
Later among the works it cites.
Cnn-cert: An efficient framework for certifying robustness of convolutional neural networks
Akhilan Boopathy, Tsui-Wei Weng, Pin-Yu Chen, Sijia Liu, and Luca Daniel · 2019
Later among the works it cites.
Lipschitz certificates for neural network structures driven by averaged activation operators
Patrick L Combettes and Jean-Christophe Pesquet · 2019
Later among the works it cites.
Mahyar Fazlyab, Manfred Morari, and George J Pappas · 2019
Later among the works it cites.
Efficient and accurate estimation of lipschitz constants for deep neural networks, 2019
Mahyar Fazlyab, Alexander Robey, Hamed Hassani, Manfred Morari, and George J. Pappas · 2019
Later among the works it cites.
The Moment-SOS Hierarchy
J. B. Lasserre · 2019
Later among the works it cites.
A survey of relaxations and approximations of the power flow equations
D. K. Molzahn and I. A. Hiskens · 2019
Later among the works it cites.
Lipschitz constant estimation of neural networks via sparse polynomial optimization
Fabian Latorre, Paul Rolland, and Volkan Cevher · 2020
Closest in time.