The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
A Unified Gradient Regularization Family for Adversarial Examples
Open accessAbstract
Adversarial examples are augmented data points generated by imperceptible perturbation of input samples. They have recently drawn much attention with the machine learning and data mining community. Being difficult to distinguish from real examples, such adversarial examples could change the prediction of many of the best learning models including the state-of-the-art deep learning models. Recent attempts have been made to build robust models that take into account adversarial examples. However, these methods can either lead to performance drops or lack mathematical motivations. In this paper, we propose a unified framework to build robust machine learning models against adversarial examples. More specifically, using the unified framework, we develop a family of gradient regularization methods that effectively penalize the gradient of loss function w.r.t. inputs. Our proposed framework is appealing in that it offers a unified view to deal with adversarial examples. It incorporates another recently-proposed perturbation based approach as a special case. In addition, we present some visual effects that reveals semantic meaning in those perturbations, and thus support our regularization method and provide another explanation for generalizability of adversarial examples. By applying this technique to Maxout networks, we conduct a series of experiments and achieve encouraging results on two benchmark datasets. In particular, we attain the best accuracy on MNIST data (without data augmentation) and competitive performance on CIFAR-10 data.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Gradient-based learning applied to document recognition
Lecun, Y., Bottou, L., Bengio, Y., & Haffner, P. (1998) · Proceedings of the IEEE · doi:10.1109/5.726791 · Cited by 58,805
Explaining and Harnessing Adversarial Examples
Goodfellow, I. J., Shlens, J., & Szegedy, C. (2014) · arXiv · doi:10.48550/arxiv.1412.6572 · Cited by 10,381
Intriguing properties of neural networks
Szegedy, C., Zaremba, W., Sutskever, I., Bruna, J., Erhan, D., Goodfellow, I., & Fergus, R. (2013) · arXiv · doi:10.48550/arxiv.1312.6199 · Cited by 8,143
Improving neural networks by preventing co-adaptation of feature detectors
Hinton, G. E., Srivastava, N., Krizhevsky, A., Sutskever, I., & Salakhutdinov, R. R. (2012) · arXiv · doi:10.48550/arxiv.1207.0580 · Cited by 6,382
Training with Noise is Equivalent to Tikhonov Regularization
Bishop, C. M. (1995) · Neural Computation · doi:10.1162/neco.1995.7.1.108 · Cited by 1,325
Theano: new features and speed improvements
Bastien, F., Lamblin, P., Pascanu, R., Bergstra, J., Goodfellow, I., Bergeron, A., Bouchard, N., Warde-Farley, D., & Bengio, Y. (2012) · arXiv · doi:10.48550/arxiv.1211.5590 · Cited by 1,005
Research works printed but not linked: 15
- sermanet, 2012, Convolutional neural networks applied to house numbers digit classification, Pattern Recognition (ICPR) 2012 21st International Conference On IEEE, 3288
- bergstra, 2010, Theano: a CPU and GPU math expression compiler, Proceedings of the Python for Scientific Computing Conference (SciPy), 10.25080/Majora-92bf1922-003 · DOI · Paper page
- zeiler, 2014, Visualizing and understanding convolutional networks, Computer Vision-ECCV 2014 Springer, 818, 10.1007/978-3-319-10590-1_53 · DOI · Paper page
- dosovitskiy, 2015, Inverting convolutional networks with convolutional networks, CoRR, abs 1506 2753
- krizhevsky, 2009, Learning multiple layers of features from tiny images, Computer Science Department University of Toronto Tech Rep, 1, 7
- srivastava, 2014, Dropout: A simple way to prevent neural networks from overfitting, J Mach Learn Res, 15, 1929
- poole, 2014, Analyzing noise in autoencoders and deep networks, CoRR, abs 1406 1831
- mairal, 2014, Advances in Neural Information Processing Systems 27, 2627
- 10.1109/ICDM.2014.117 · DOI
- 10.1109/CVPR.2015.7298640 · DOI · Paper page
- fawzi, 2015, Analysis of classifiers' robustness to adversarial perturbations, CoRR, abs 1502 2590
- 10.1145/1081870.1081950 · DOI · Paper page
- gu, 0, Towards deep neural network architectures robust to adversarial examples, arXiv preprint arXiv 1412 5068 2014
- goodfellow, 2013, Pylearn 2: a machine learning research library, arXiv preprint arXiv 1308 4214
- 10.1162/08997660260028683 · DOI · Paper page
Cited by
Interpreting Black-Box Models: A Review on Explainable Artificial Intelligence
Hassija, V., Chamola, V., Mahapatra, A., Singal, A., Goel, D., Huang, K., Scardapane, S., Spinelli, I., Mahmud, M., & Hussain, A. (2024) · Cognitive Computation · doi:10.1007/s12559-023-10179-8 · Cited by 2,495
Self-citationThreat of Adversarial Attacks on Deep Learning in Computer Vision: A Survey
Akhtar, N., & Mian, A. (2018) · IEEE Access · doi:10.1109/access.2018.2807385 · Cited by 2,021
Wild patterns: Ten years after the rise of adversarial machine learning
Biggio, B., & Roli, F. (2018) · Pattern Recognition · doi:10.1016/j.patcog.2018.07.023 · Cited by 1,409
A survey on adversarial attacks and defences
Chakraborty, A., Alam, M., Dey, V., Chattopadhyay, A., & Mukhopadhyay, D. (2021) · CAAI Transactions on Intelligence Technology · doi:10.1049/cit2.12028 · Cited by 413
Review of Artificial Intelligence Adversarial Attack and Defense Technologies
Qiu, S., Liu, Q., Zhou, S., & Wu, C. (2019) · Applied Sciences · doi:10.3390/app9050909 · Cited by 411
Metadata
- Authors
- Lyu, C., Huang, K., & Liang, H.-N.
- Venue
- 2015 IEEE International Conference on Data Mining
- Publisher
- IEEE
- Published
- 2015-11
- Pages
- 301-309
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W2963341057
- Cited by
- 169
- References
- 6
- FWCI
- 2.27
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Unified Gradient Regularization Family for Adversarial Examples. https://app.cochat.ai/papers/10.1109/icdm.2015.84
- The paper
- Lyu, C., Huang, K., & Liang, H.-N. (2015). A Unified Gradient Regularization Family for Adversarial Examples. 2015 IEEE International Conference on Data Mining. https://doi.org/10.1109/icdm.2015.84
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.