Can Adversarially Robust Learning LeverageComputational Hardness?

Saeed Mahloujifar, Mohammad Mahmoody. Can Adversarially Robust Learning LeverageComputational Hardness?. In Aurélien Garivier, Satyen Kale, editors, Algorithmic Learning Theory, ALT 2019, 22-24 March 2019, Chicago, Illinois, USA. Volume 98 of Proceedings of Machine Learning Research, pages 581-609, PMLR, 2019. [doi]

@inproceedings{MahloujifarM19,
  title = {Can Adversarially Robust Learning LeverageComputational Hardness?},
  author = {Saeed Mahloujifar and Mohammad Mahmoody},
  year = {2019},
  url = {http://proceedings.mlr.press/v98/mahloujifar19a.html},
  researchr = {https://researchr.org/publication/MahloujifarM19},
  cites = {0},
  citedby = {0},
  pages = {581-609},
  booktitle = {Algorithmic Learning Theory, ALT 2019, 22-24 March 2019, Chicago, Illinois, USA},
  editor = {Aurélien Garivier and Satyen Kale},
  volume = {98},
  series = {Proceedings of Machine Learning Research},
  publisher = {PMLR},
}