Average-Case Information Complexity of Learning

Ido Nachum, Amir Yehudayoff. Average-Case Information Complexity of Learning. 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 633-646, PMLR, 2019. [doi]

@inproceedings{NachumY19,
  title = {Average-Case Information Complexity of Learning},
  author = {Ido Nachum and Amir Yehudayoff},
  year = {2019},
  url = {http://proceedings.mlr.press/v98/nachum19a.html},
  researchr = {https://researchr.org/publication/NachumY19},
  cites = {0},
  citedby = {0},
  pages = {633-646},
  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},
}