Open Problem: Do Good Algorithms Necessarily Query Bad Points?

Rong Ge 0001, Prateek Jain 0002, Sham M. Kakade, Rahul Kidambi, Dheeraj M. Nagaraj, Praneeth Netrapalli. Open Problem: Do Good Algorithms Necessarily Query Bad Points?. In Alina Beygelzimer, Daniel Hsu 0001, editors, Conference on Learning Theory, COLT 2019, 25-28 June 2019, Phoenix, AZ, USA. Volume 99 of Proceedings of Machine Learning Research, pages 3190-3193, PMLR, 2019. [doi]

@inproceedings{00010KKNN19,
  title = {Open Problem: Do Good Algorithms Necessarily Query Bad Points?},
  author = {Rong Ge 0001 and Prateek Jain 0002 and Sham M. Kakade and Rahul Kidambi and Dheeraj M. Nagaraj and Praneeth Netrapalli},
  year = {2019},
  url = {http://proceedings.mlr.press/v99/ge19b.html},
  researchr = {https://researchr.org/publication/00010KKNN19},
  cites = {0},
  citedby = {0},
  pages = {3190-3193},
  booktitle = {Conference on Learning Theory, COLT 2019, 25-28 June 2019, Phoenix, AZ, USA},
  editor = {Alina Beygelzimer and Daniel Hsu 0001},
  volume = {99},
  series = {Proceedings of Machine Learning Research},
  publisher = {PMLR},
}