Fetching the paper…
Reading the bibliography…
Adversarial examples are carefully constructed modifications to an input that completely change the output of a classifier but are imperceptible to humans.
M. Frank and P. Wolfe, “An algorithm for quadratic programming,” Naval Research Logistics (NRL) , vol. 3, no. 1-2, pp. 95–110, 1956
1956
Earlier work this paper cites.
G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher, “An analysis of approximations for maximizing submodular set functions—i,” Mathematical Programming , vol. 14, no. 1, pp. 265–294, 1978
1978
Earlier work this paper cites.
H. Narayanan, Submodular functions and electrical networks . Elsevier, 1997, vol. 54
1997
Earlier work this paper cites.
S. Hochreiter and J. Schmidhuber, “Long short-term memory,” Neural computation , vol. 9, no. 8, pp. 1735–1780, 1997
1997
Earlier work this paper cites.
A. Schrijver, Combinatorial optimization: polyhedra and efficiency . Springer Science & Business Media, 2003, vol. 24
2003
Earlier work this paper cites.
N. Dalvi, P. Domingos, S. Sanghai, D. Verma et al. , “Adversarial classification,” in Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining . ACM, 2004, pp. 99–108
2004
Earlier work this paper cites.
D. Lowd and C. Meek, “Adversarial learning,” in Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining . ACM, 2005, pp. 641–647
2005
Earlier work this paper cites.
S. Fujishige, Submodular functions and optimization . Elsevier, 2005, vol. 58
2005
Earlier work this paper cites.
2013
Earlier work this paper cites.
2013
Earlier work this paper cites.
2014
Earlier work this paper cites.
2014
Earlier work this paper cites.
J. Nutini, M. Schmidt, I. Laradji, M. Friedlander, and H. Koepke, “Coordinate descent converges faster with the Gauss-Southwell rule than random selection,” in International Conference on Machine Learning , 2015, pp. 1632–1641
2015
Earlier work this paper cites.
2015
Earlier work this paper cites.
M. Kusner, Y. Sun, N. Kolkin, and K. Weinberger, “From word embeddings to document distances,” in International Conference on Machine Learning , 2015, pp. 957–966
2015
Earlier work this paper cites.
2015
Earlier work this paper cites.
S. M. Moosavi Dezfooli, A. Fawzi, and P. Frossard, “Deepfool: a simple and accurate method to fool deep neural networks,” in Proceedings of 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , no. EPFL-CONF-218057, 2016
2016
Earlier work this paper cites.
N. Papernot, P. McDaniel, X. Wu, S. Jha, and A. Swami, “Distillation as a defense to adversarial perturbations against deep neural networks,” in Security and Privacy (SP), 2016 IEEE Symposium on . IEEE, 2016, pp. 582–597
2016
Cited alongside, same era.
N. Papernot, P. McDaniel, A. Swami, and R. Harang, “Crafting adversarial input sequences for recurrent neural networks,” in Military Communications Conference, MILCOM 2016-2016 IEEE . IEEE, 2016, pp. 49–54
2016
Cited alongside, same era.
2016
Cited alongside, same era.
2016
Cited alongside, same era.
2017
Later among the works it cites.
J. Bilmes and W. Bai, “Deep submodular functions,” arXiv preprint arXiv:1701.08939 , 2017
2017
Later among the works it cites.
2017
Later among the works it cites.
G. McIntire, “Fake news dataset,” https://github.com/GeorgeMcIntire/fake_real_news_dataset , 2017
2017
Later among the works it cites.
P.-Y. Chen, Y. Sharma, H. Zhang, J. Yi, and C.-J. Hsieh, “EAD: elastic-net attacks to deep neural networks via adversarial examples,” AAAI , 2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2016
Cited alongside, same era.
Y. Gal and Z. Ghahramani, “Dropout as a bayesian approximation: Representing model uncertainty in deep learning,” in international conference on machine learning , 2016, pp. 1050–1059
2016
Cited alongside, same era.
2017
Cited alongside, same era.
N. Carlini and D. Wagner, “Towards evaluating the robustness of neural networks,” in IEEE Symposium on Security and Privacy , 2017, pp. 39–57
2017
Cited alongside, same era.
2017
Cited alongside, same era.
P.-Y. Chen, H. Zhang, Y. Sharma, J. Yi, and C.-J. Hsieh, “ZOO: Zeroth order optimization based black-box attacks to deep neural networks without training substitute models,” in ACM Workshop on Artificial Intelligence and Security , 2017, pp. 15–26
2017
Cited alongside, same era.
2017
Cited alongside, same era.
2017
Cited alongside, same era.
2018
Closest in time.
D. Su, H. Zhang, H. Chen, J. Yi, P.-Y. Chen, and Y. Gao, “Is robustness the cost of accuracy?–a comprehensive study on the robustness of 18 deep image classification models,” ECCV , 2018
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
V. Kuleshov, S. Thakoor, T. Lau, and S. Ermon, “Adversarial examples for natural language classification problems,” 2018. [Online]. Available: https://openreview.net/forum?id=r1QZ3zbAZ
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
M. T. Ribeiro, S. Singh, and C. Guestrin, “Semantically equivalent adversarial rules for debugging NLP models,” in Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) , vol. 1, 2018, pp. 856–865
2018
Closest in time.
Q. Lei, I. E. Yen, C.-y. Wu, I. S. Dhillon, and P. Ravikumar, “Doubly greedy primal-dual coordinate descent for sparse empirical risk minimization,” in Proceedings of the 34th International Conference on Machine Learning-Volume 70 . JMLR. org, 2017, pp. 2034–2042
2042
Closest in time.
Q. Lei, K. Zhong, and I. S. Dhillon, “Coordinate-wise power method,” in Advances in Neural Information Processing Systems , 2016, pp. 2064–2072
2072
Closest in time.