Fetching the paper…
Reading the bibliography…
The robustness of a neural network to adversarial examples can be provably certified by solving a convex relaxation.
Quadratic optimization problems
N.Z. Shor · 1987
Earlier work this paper cites.
Cones of matrices and set-functions and 0–1 optimization
László Lovász and Alexander Schrijver · 1991
Earlier work this paper cites.
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
Michel X Goemans and David P Williamson · 1995
Earlier work this paper cites.
Improved approximation algorithms for maxk-cut and max bisection
Alan Frieze and Mark Jerrum · 1997
Earlier work this paper cites.
Quality of semidefinite relaxation for nonconvex quadratic optimization
Yurii Nesterov · 1997
Earlier work this paper cites.
Exploiting sparsity in semidefinite programming via matrix completion I: General framework
Mituhiro Fukuda, Masakazu Kojima, Kazuo Murota, and Kazuhide Nakata · 2001
Earlier work this paper cites.
Rank-two relaxation heuristics for max-cut and other binary quadratic programs
Samuel Burer, Renato DC Monteiro, and Yin Zhang · 2002
Earlier work this paper cites.
Semidefinite programming relaxations for semialgebraic problems
Pablo A Parrilo · 2003
Earlier work this paper cites.
Convex optimization
Stephen Boyd, Stephen P Boyd, and Lieven Vandenberghe · 2004
Earlier work this paper cites.
Local minima and convergence in low-rank semidefinite programming
Samuel Burer and Renato DC Monteiro · 2005
Earlier work this paper cites.
Numerical optimization
Jorge Nocedal and Stephen Wright · 2006
Earlier work this paper cites.
On approximating complex quadratic optimization problems via semidefinite programming relaxations
Anthony Man-Cho So, Jiawei Zhang, and Yinyu Ye · 2007
Earlier work this paper cites.
A survey of the s-lemma
Imre Pólik and Tamás Terlaky · 2007
Earlier work this paper cites.
Exact matrix completion via convex optimization
Emmanuel J Candès and Benjamin Recht · 2009
Earlier work this paper cites.
The power of convex relaxation: Near-optimal matrix completion
Emmanuel J Candès and Terence Tao · 2010
Earlier work this paper cites.
Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
Benjamin Recht, Maryam Fazel, and Pablo A Parrilo · 2010
Earlier work this paper cites.
Matrix completion with noise
Emmanuel J Candes and Yaniv Plan · 2010
Earlier work this paper cites.
A singular value thresholding algorithm for matrix completion
Jian-Feng Cai, Emmanuel J Candès, and Zuowei Shen · 2010
Earlier work this paper cites.
Low-rank optimization on the cone of positive semidefinite matrices
Michel Journée, Francis Bach, P-A Absil, and Rodolphe Sepulchre · 2010
Earlier work this paper cites.
A simpler approach to matrix completion
Benjamin Recht · 2011
Cited alongside, same era.
Evasion attacks against machine learning at test time
Battista Biggio, Igino Corona, Davide Maiorca, Blaine Nelson, Nedim Srndic, Pavel Laskov, Giorgio Giacinto, and Fabio Roli · 2013
Cited alongside, same era.
Phase retrieval using alternating minimization
Praneeth Netrapalli, Prateek Jain, and Sujay Sanghavi · 2013
Cited alongside, same era.
Intriguing properties of neural networks
Christian Szegedy, Wojciech Zaremba, Ilya Sutskever, Joan Bruna, Dumitru Erhan, Ian Goodfellow, and Rob Fergus · 2014
Cited alongside, same era.
Explaining and harnessing adversarial examples
Ian Goodfellow, Jonathon Shlens, and Christian Szegedy · 2015
Cited alongside, same era.
Scaling provable adversarial defenses
Eric Wong, Frank Schmidt, Jan Hendrik Metzen, and J Zico Kolter · 2018
Later among the works it cites.
Differentiable abstract interpretation for provably robust neural networks
Matthew Mirman, Timon Gehr, and Martin Vechev · 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.
On the effectiveness of interval bound propagation for training verifiably robust models
Sven Gowal, Krishnamurthy Dvijotham, Robert Stanforth, Rudy Bunel, Chongli Qin, Jonathan Uesato, Relja Arandjelovic, Timothy Mann, and Pushmeet Kohli · 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.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Solving random quadratic systems of equations is nearly as easy as solving linear systems
Yuxin Chen and Emmanuel Candes · 2015
Cited alongside, same era.
Chordal graphs and semidefinite optimization
Lieven Vandenberghe, Martin S Andersen, et al · 2015
Cited alongside, same era.
Adversarial machine learning at scale
Alexey Kurakin, Ian Goodfellow, and Samy Bengio · 2016
Cited alongside, same era.
Global optimality of local search for low rank matrix recovery
Srinadh Bhojanapalli, Behnam Neyshabur, and Nati Srebro · 2016
Cited alongside, same era.
Guaranteed matrix completion via non-convex factorization
Ruoyu Sun and Zhi-Quan Luo · 2016
Cited alongside, same era.
Matrix completion has no spurious local minimum
Rong Ge, Jason D Lee, and Tengyu Ma · 2016
Cited alongside, same era.
Low-rank semidefinite programming: Theory and applications
Alex Lemon, Anthony Man-Cho So, Yinyu Ye, et al · 2016
Cited alongside, same era.
Towards fast computation of certified robustness for ReLU networks
Lily Weng, Huan Zhang, Hongge Chen, Zhao Song, Cho-Jui Hsieh, Luca Daniel, Duane Boning, and Inderjit Dhillon · 2018
Later among the works it cites.
Certifiable distributional robustness with principled adversarial training
Aman Sinha, Hongseok Namkoong, and John Duchi · 2018
Later among the works it cites.
Phasemax: Convex phase retrieval via basis pursuit
Tom Goldstein and Christoph Studer · 2018
Later among the works it cites.
Evaluating robustness of neural networks with mixed integer programming
Vincent Tjeng, Kai Xiao, and Russ Tedrake · 2019
Later among the works it cites.
Certified robustness to adversarial examples with differential privacy
Mathias Lecuyer, Vaggelis Atlidakis, Roxana Geambasu, Daniel Hsu, and Suman Jana · 2019
Later among the works it cites.
Certified adversarial robustness via randomized smoothing
Jeremy Cohen, Elan Rosenfeld, and Zico Kolter · 2019
Later among the works it cites.
Provably robust deep learning via adversarially trained smoothed classifiers
Hadi Salman, Jerry Li, Ilya Razenshteyn, Pengchuan Zhang, Huan Zhang, Sebastien Bubeck, and Greg Yang · 2019
Later among the works it cites.
Mahyar Fazlyab, Manfred Morari, and George J Pappas · 2019
Later among the works it cites.
The MOSEK optimization toolbox for MATLAB manual, 2019
ApS MOSEK · 2019
Later among the works it cites.
Burer-monteiro guarantees for general semidefinite programs
Diego Cifuentes · 2019
Later among the works it cites.
Efficient neural network verification with exactness characterization
Krishnamurthy Dj Dvijotham, Robert Stanforth, Sven Gowal, Chongli Qin, Soham De, and Pushmeet Kohli · 2020
Closest in time.
Deterministic guarantees for Burer-Monteiro factorizations of smooth semidefinite programs
Nicolas Boumal, Vladislav Voroninski, and Afonso S Bandeira · 2020
Closest in time.
Matrix completion from noisy entries
Raghunandan H Keshavan, Andrea Montanari, and Sewoong Oh · 2078
Closest in time.