Fast approximation algorithms for fractional packing and covering problems
S. A. Plotkin, D. B. Shmoys, and E. Tardos · 1991
Earlier work this paper cites.
Interior point methods in semidefinite programming with applications to combinatorial optimization
Farid Alizadeh · 1995
Earlier work this paper cites.
Efficient approximation algorithms for semidefinite programs arising from max cut and coloring
Philip Klein and Hsueh-I Lu · 1996
Earlier work this paper cites.
Semidefinite relaxation and nonconvex quadratic optimization
Yu Nesterov · 1998
Earlier work this paper cites.
Approximating the cut-norm via grothendieck’s inequality
Noga Alon and Assaf Naor · 2004
Earlier work this paper cites.
Maximizing quadratic programs: Extending grothendieck’s inequality
Moses Charikar and Anthony Wirth · 2004
Earlier work this paper cites.
Fast algorithms for approximate semidefinite programming using the multiplicative weights update method
Sanjeev Arora, Elad Hazan, and Satyen Kale · 2005
Earlier work this paper cites.
Quadratic forms on graphs
Noga Alon, Konstantin Makarychev, Yury Makarychev, and Assaf Naor · 2006
Earlier work this paper cites.
A combinatorial, primal-dual approach to semidefinite programs
Sanjeev Arora and Satyen Kale · 2007
Earlier work this paper cites.
Efficient algorithms using the multiplicative weights update method
Satyen Kale · 2007
Earlier work this paper cites.
Learning multiple layers of features from tiny images
Alex Krizhevsky, Geoffrey Hinton, et al · 2009
Earlier work this paper cites.
Online dictionary learning for sparse coding
Julien Mairal, Francis Bach, Jean Ponce, and Guillermo Sapiro · 2009
Earlier work this paper cites.
Approximating semidefinite packing programs
G. Iyengar, D. J. Phillips, and C. Stein · 2011
Earlier work this paper cites.
A parallel approximation algorithm for positive semidefinite programming
Rahul Jain and Penghui Yao · 2011
Earlier work this paper cites.
Scikit-learn: Machine learning in Python
F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B. Thirion, O. Grisel, M. Blondel, P. Prettenhofer, R. Weiss, V. Dubourg, J. Vanderplas, A. Passos, D. Cournapeau, M. Brucher, M. Perrot, and E. Duchesnay · 2011
Earlier work this paper cites.
Evasion attacks against machine learning at test time
Battista Biggio, Igino Corona, Davide Maiorca, Blaine Nelson, Nedim Šrndić, Pavel Laskov, Giorgio Giacinto, and Fabio Roli · 2013
Earlier work this paper cites.
Intriguing properties of neural networks
Original
Christian Szegedy, Wojciech Zaremba, Ilya Sutskever, Joan Bruna, Dumitru Erhan, Ian Goodfellow, and Rob Fergus · 2013
Earlier work this paper cites.
Explaining and harnessing adversarial examples
Original
Ian J Goodfellow, Jonathon Shlens, and Christian Szegedy · 2014
Earlier work this paper cites.
A faster cutting plane method and its implications for combinatorial and convex optimization
Y. T. Lee, A. Sidford, and S. C. Wong · 2015
Earlier work this paper cites.
Using optimization to obtain a width-independent, parallel, simpler, and faster positive sdp solver
Zeyuan Allen-Zhu, Yin Tat Lee, and Lorenzo Orecchia · 2016
Earlier work this paper cites.