Fetching the paper…
Reading the bibliography…
While deep neural networks achieve great performance on fitting the training distribution, the learned networks are prone to overfitting and are susceptible to adversarial attacks.
Algorithms for the assignment and transportation problems
Munkres, J · 1957
Earlier work this paper cites.
A shortest augmenting path algorithm for dense and sparse linear assignment
Jonker, R. and Volgenant, A · 1987
Earlier work this paper cites.
Training with noise is equivalent to tikhonov regularization
Bishop, C. M · 1995
Earlier work this paper cites.
Statistics of natural images and models
Huang, J. and Mumford, D · 1999
Earlier work this paper cites.
Fast approximate energy minimization via graph cuts
Boykov, Y., Veksler, O., and Zabih, R · 2001
Earlier work this paper cites.
Modes of discourse: The local structure of texts , volume 103
Smith, C. S · 2003
Earlier work this paper cites.
Lexrank: Graph-based lexical centrality as salience in text summarization
Erkan, G. and Radev, D. R · 2004
Earlier work this paper cites.
What energy functions can be minimizedvia graph cuts?
Kolmogorov, V. and Zabih, R · 2004
Earlier work this paper cites.
Pattern recognition and machine learning
Bishop, C. M · 2006
Earlier work this paper cites.
A saliency-based auditory attention model with applications to unsupervised prominent syllable detection in speech
Kalinli, O. and Narayanan, S. S · 2007
Earlier work this paper cites.
Optimal transport: old and new , volume 338
Villani, C · 2008
Earlier work this paper cites.
Imagenet: a large-scale hierarchical image database
Deng, J., Dong, W., Socher, R., Li, L.-J., Li, K., and Li, F. F · 2009
Earlier work this paper cites.
Learning multiple layers of features from tiny images
Krizhevsky, A. and Geoffrey, H · 2009
Earlier work this paper cites.
A theory of learning from different domains
Ben-David, S., Blitzer, J., Crammer, K., Kulesza, A., Pereira, F., and Vaughan, J. W · 2010
Earlier work this paper cites.
Generalized fast approximate energy minimization via graph cuts: Alpha-expansion beta-shrink moves
Schmidt, M. and Alahari, K · 2011
Cited alongside, same era.
Imagenet classification with deep convolutional neural networks
Krizhevsky, A., Sutskever, I., and Hinton, G. E · 2012
Cited alongside, same era.
Region-based saliency detection and its application in object recognition
Ren, Z., Gao, S., Chia, L.-T., and Tsang, I. W.-H · 2013
Cited alongside, same era.
Deep inside convolutional networks: Visualising image classification models and saliency maps
Simonyan, K., Vedaldi, A., and Zisserman, A · 2013
Cited alongside, same era.
Adaptive color transfer with relaxed optimal transport
Rabin, J., Ferradans, S., and Papadakis, N · 2014
Cited alongside, same era.
A downsampled variant of imagenet as an alternative to the cifar datasets
Chrabaszcz, P., Loshchilov, I., and Hutter, F · 2017
Later among the works it cites.
Improved regularization of convolutional neural networks with cutout
DeVries, T. and Taylor, G. W · 2017
Later among the works it cites.
Towards deep learning models resistant to adversarial attacks
Madry, A., Makelov, A., Schmidt, L., Tsipras, D., and Vladu, A · 2017
Later among the works it cites.
Automatic differentiation in pytorch
Paszke, A., Gross, S., Chintala, S., Chanan, G., Yang, E., DeVito, Z., Lin, Z., Desmaison, A., Antiga, L., and Lerer, A · 2017
Later among the works it cites.
Grad-cam: Visual explanations from deep networks via gradient-based localization
Selvaraju, R. R., Cogswell, M., Das, A., Vedantam, R., Parikh, D., and Batra, D · 2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Dropout: a simple way to prevent neural networks from overfitting
Srivastava, N., Hinton, G., Krizhevsky, A., Sutskever, I., and Salakhutdinov, R · 2014
Cited alongside, same era.
Deep residual learning for image recognition
He, K., Zhang, X., Ren, S., and Sun, J · 2015
Cited alongside, same era.
Deep networks for saliency detection via local estimation and global search
Wang, L., Lu, H., Ruan, X., and Yang, M.-H · 2015
Cited alongside, same era.
Saliency detection by multi-context deep learning
Zhao, R., Ouyang, W., Li, H., and Wang, X · 2015
Cited alongside, same era.
Optimal transport for domain adaptation
Courty, N., Flamary, R., Tuia, D., and Rakotomamonjy, A · 2016
Cited alongside, same era.
Identity mappings in deep residual networks
He, K., Zhang, X., Ren, S., and Sun, J · 2016
Cited alongside, same era.
Zagoruyko, S. and Komodakis, N · 2016
Cited alongside, same era.
Later among the works it cites.
Object region mining with adversarial erasing: A simple classification to semantic segmentation approach
Wei, Y., Feng, J., Liang, X., Cheng, M.-M., Zhao, Y., and Yan, S · 2017
Later among the works it cites.
Towards end-to-end speech recognition with deep convolutional neural networks
Zhang, Y., Pezeshki, M., Brakel, P., Zhang, S., Bengio, C. L. Y., and Courville, A · 2017
Later among the works it cites.
mixup: Beyond empirical risk minimization
Zhang, H., Cisse, M., Dauphin, Y. N., and Lopez-Paz, D · 2018
Later among the works it cites.
Mixup as locally linear out-of-manifold regularization
Guo, H., Mao, Y., and Zhang, R · 2019
Later among the works it cites.
Benchmarking neural network robustness to common corruptions and perturbations
Hendrycks, D. and Dietterich, T · 2019
Later among the works it cites.
Manifold mixup: Better representations by interpolating hidden states
Verma, V., Lamb, A., Beckham, C., Najafi, A., Mitliagkas, I., Courville, A., Lopez-Paz, D., and Bengio, Y · 2019
Later among the works it cites.
Cutmix: Regularization strategy to train strong classifiers with localizable features
Yun, S., Han, D., Oh, S. J., Chun, S., Choe, J., and Yoo, Y · 2019
Later among the works it cites.
AugMix: A simple data processing method to improve robustness and uncertainty
Hendrycks, D., Mu, N., Cubuk, E. D., Zoph, B., Gilmer, J., and Lakshminarayanan, B · 2020
Closest in time.
Fast is better than free: Revisiting adversarial training
Wong, E., Rice, L., and Kolter, J. Z · 2020
Closest in time.