Hardness of Learning Noisy Halfspaces using Polynomial Thresholds

Arnab Bhattacharyya, Suprovat Ghoshal, Rishi Saket. Hardness of Learning Noisy Halfspaces using Polynomial Thresholds. In Sébastien Bubeck, Vianney Perchet, Philippe Rigollet, editors, Conference On Learning Theory, COLT 2018, Stockholm, Sweden, 6-9 July 2018. Volume 75 of Proceedings of Machine Learning Research, pages 876-917, PMLR, 2018. [doi]

@inproceedings{BhattacharyyaGS18-1,
  title = {Hardness of Learning Noisy Halfspaces using Polynomial Thresholds},
  author = {Arnab Bhattacharyya and Suprovat Ghoshal and Rishi Saket},
  year = {2018},
  url = {http://proceedings.mlr.press/v75/bhattacharyya18a.html},
  researchr = {https://researchr.org/publication/BhattacharyyaGS18-1},
  cites = {0},
  citedby = {0},
  pages = {876-917},
  booktitle = {Conference On Learning Theory, COLT 2018, Stockholm, Sweden, 6-9 July 2018},
  editor = {Sébastien Bubeck and Vianney Perchet and Philippe Rigollet},
  volume = {75},
  series = {Proceedings of Machine Learning Research},
  publisher = {PMLR},
}