Lower Bounds on Learning Random Structures with Statistical Queries

Dana Angluin, David Eisenstat, Leonid Kontorovich, Lev Reyzin. Lower Bounds on Learning Random Structures with Statistical Queries. In Marcus Hutter, Frank Stephan, Vladimir Vovk, Thomas Zeugmann, editors, Algorithmic Learning Theory, 21st International Conference, ALT 2010, Canberra, Australia, October 6-8, 2010. Proceedings. Volume 6331 of Lecture Notes in Computer Science, pages 194-208, Springer, 2010. [doi]

@inproceedings{AngluinEKR10,
  title = {Lower Bounds on Learning Random Structures with Statistical Queries},
  author = {Dana Angluin and David Eisenstat and Leonid Kontorovich and Lev Reyzin},
  year = {2010},
  doi = {10.1007/978-3-642-16108-7_18},
  url = {http://dx.doi.org/10.1007/978-3-642-16108-7_18},
  researchr = {https://researchr.org/publication/AngluinEKR10},
  cites = {0},
  citedby = {0},
  pages = {194-208},
  booktitle = {Algorithmic Learning Theory, 21st International Conference, ALT 2010, Canberra, Australia, October 6-8, 2010. Proceedings},
  editor = {Marcus Hutter and Frank Stephan and Vladimir Vovk and Thomas Zeugmann},
  volume = {6331},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-16107-0},
}