Fetching the paper…
Reading the bibliography…
What is the role of unlabeled data in an inference problem, when the presumed underlying distribution is adversarially perturbed? To provide a concrete answer to this question, this paper unifies two major learning frameworks: Semi-Supervised Learning (SSL) and Distributionally Robust Learning (DRL).
M. Dresher, “Games of strategy: theory and applications,” RAND CORP SANTA MONICA CA, Tech. Rep., 1961
1961
Earlier work this paper cites.
K. S. Miller and B. Ross, An introduction to the fractional calculus and fractional differential equations . Wiley-Interscience, 1993
1993
Earlier work this paper cites.
Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner, “Gradient-based learning applied to document recognition,” Proceedings of the IEEE , vol. 86, no. 11, pp. 2278–2324, 1998
1998
Earlier work this paper cites.
M.-R. Amini and P. Gallinari, “Semi-supervised logistic regression,” in European Conference on Artificial Intelligence , 2002, pp. 390–394
2002
Earlier work this paper cites.
S. Basu, A. Banerjee, and R. Mooney, “Semi-supervised clustering by seeding,” in International Conference on Machine Learning , 2002, pp. 27–34
2002
Earlier work this paper cites.
Y. Grandvalet and Y. Bengio, “Semi-supervised learning by entropy minimization,” in Advances in Neural Information Processing Systems , 2005, pp. 529–536
2005
Earlier work this paper cites.
X. Zhu, “Semi-supervised learning literature survey,” Computer Science, University of Wisconsin-Madison , vol. 2, no. 3, p. 4, 2006
2006
Earlier work this paper cites.
P. Rigollet, “Generalization error bounds in semi-supervised classification under the cluster assumption,” Journal of Machine Learning Research , vol. 8, no. Jul, pp. 1369–1392, 2007
2007
Earlier work this paper cites.
O. Chapelle, B. Scholkopf, and A. Zien, “Semi-supervised learning (chapelle, o. et al., eds.; 2006)[book reviews],” IEEE Transactions on Neural Networks , vol. 20, no. 3, pp. 542–542, 2009
2009
Earlier work this paper cites.
A. Krizhevsky and G. Hinton, “Learning multiple layers of features from tiny images,” Citeseer, Tech. Rep., 2009
2009
Earlier work this paper cites.
A. Singh, R. Nowak, and X. Zhu, “Unlabeled data: Now it helps, now it doesn’t,” in Advances in Neural Information Processing Systems , 2009, pp. 1513–1520
2009
Earlier work this paper cites.
Y. Netzer, T. Wang, A. Coates, A. Bissacco, B. Wu, and A. Y. Ng, “Reading digits in natural images with unsupervised feature learning,” in NIPS Workshop on Deep Learning and Unsupervised Feature Learning , vol. 2011, 2011, p. 5
2011
Earlier work this paper cites.
M. Mohri, A. Rostamizadeh, and A. Talwalkar, Foundations of machine learning . MIT press, 2012
2012
Earlier work this paper cites.
S. Ghadimi and G. Lan, “Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization i: A generic algorithmic framework,” SIAM Journal on Optimization , vol. 22, no. 4, pp. 1469–1492, 2012
2012
Earlier work this paper cites.
A. Ben-Tal, D. Den Hertog, A. De Waegenaere, B. Melenberg, and G. Rennen, “Robust solutions of optimization problems affected by uncertain probabilities,” Management Science , vol. 59, no. 2, pp. 341–357, 2013
2013
Cited alongside, same era.
D.-H. Lee, “Pseudo-label: The simple and efficient semi-supervised learning method for deep neural networks,” in ICML Workshop on Challenges in Representation Learning , vol. 2, 2013
2013
Cited alongside, same era.
J. F. Bonnans and A. Shapiro, Perturbation analysis of optimization problems . Springer Science & Business Media, 2013
2013
Cited alongside, same era.
A. L. Maas, A. Y. Hannun, and A. Y. Ng, “Rectifier nonlinearities improve neural network acoustic models,” in ICML Workshop on Deep Learning for Audio, Speech and Language Processing , 2013
2013
Cited alongside, same era.
D.-A. Clevert, T. Unterthiner, and S. Hochreiter, “Fast and accurate deep network learning by exponential linear units (elus),” in International Conference on Learning Representations , 2016
2016
Later among the works it cites.
2016
Later among the works it cites.
M. Staib and S. Jegelka, “Distributionally robust deep learning as a generalization of adversarial training,” in NIPS workshop on Machine Learning and Computer Security , 2017
2017
Later among the works it cites.
P. M. Esfahani and D. Kuhn, “Data-driven distributionally robust optimization using the wasserstein metric: Performance guarantees and tractable reformulations,” Mathematical Programming , pp. 1–52, 2017
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
C. Szegedy, W. Zaremba, I. Sutskever, J. Bruna, D. Erhan, I. Goodfellow, and R. Fergus, “Intriguing properties of neural networks,” in International Conference on Learning Representations , 2014
2014
Cited alongside, same era.
A. Nguyen, J. Yosinski, and J. Clune, “Deep neural networks are easily fooled: High confidence predictions for unrecognizable images,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , 2015, pp. 427–436
2015
Cited alongside, same era.
I. Goodfellow, J. Shlens, and C. Szegedy, “Explaining and harnessing adversarial examples,” in International Conference on Learning Representations , 2015
2015
Cited alongside, same era.
S. Shafieezadeh-Abadeh, P. M. Esfahani, and D. Kuhn, “Distributionally robust logistic regression,” in Advances in Neural Information Processing Systems , 2015, pp. 1576–1584
2015
Cited alongside, same era.
A. Balsubramani and Y. Freund, “Scalable semi-supervised aggregation of classifiers,” in Advances in Neural Information Processing Systems , 2015, pp. 1351–1359
2015
Cited alongside, same era.
S. Ioffe and C. Szegedy, “Batch normalization: Accelerating deep network training by reducing internal covariate shift,” in ICML , 2015, pp. 448–456
2015
Cited alongside, same era.
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.
2016
Cited alongside, same era.
2017
Later among the works it cites.
Z. Dai, Z. Yang, F. Yang, W. W. Cohen, and R. R. Salakhutdinov, “Good semi-supervised learning that requires a bad gan,” in Advances in Neural Information Processing Systems , 2017, pp. 6510–6520
2017
Later among the works it cites.
T. Miyato, S. Maeda, S. Ishii, and M. Koyama, “Virtual adversarial training: a regularization method for supervised and semi-supervised learning,” IEEE transactions on pattern analysis and machine intelligence , 2018
2018
Later among the works it cites.
A. Sinha, H. Namkoong, and J. Duchi, “Certifiable distributional robustness with principled adversarial training,” in International Conference on Learning Representations , 2018
2018
Later among the works it cites.
2018
Later among the works it cites.
L. Schmidt, S. Santurkar, D. Tsipras, K. Talwar, and A. Madry, “Adversarially robust generalization requires more data,” in Advances in Neural Information Processing Systems , 2018, pp. 5014–5026
2018
Later among the works it cites.
2018
Later among the works it cites.
A. Madry, A. Makelov, L. Schmidt, D. Tsipras, and A. Vladu, “Towards deep learning models resistant to adversarial attacks,” in International Conference on Learning Representations , 2018
2018
Later among the works it cites.
J. Blanchet and K. Murthy, “Quantifying distributional model risk via optimal transport,” Mathematics of Operations Research , 2019
2019
Closest in time.
W. Hu, G. Niu, I. Sato, and M. Sugiyama, “Does distributionally robust supervised learning give robust classifiers?” in International Conference on Machine Learning , 2018, pp. 2034–2042
2042
Closest in time.