Information-theoretic lower bounds on the oracle complexity of convex optimization

Alekh Agarwal, Peter L. Bartlett, Pradeep D. Ravikumar, Martin J. Wainwright. Information-theoretic lower bounds on the oracle complexity of convex optimization. In Yoshua Bengio, Dale Schuurmans, John D. Lafferty, Christopher K. I. Williams, Aron Culotta, editors, Advances in Neural Information Processing Systems 22: 23rd Annual Conference on Neural Information Processing Systems 2009. Proceedings of a meeting held 7-10 December 2009, Vancouver, British Columbia, Canada. pages 1-9, Curran Associates, Inc., 2009. [doi]

@inproceedings{AgarwalBRW09,
  title = {Information-theoretic lower bounds on the oracle complexity of convex optimization},
  author = {Alekh Agarwal and Peter L. Bartlett and Pradeep D. Ravikumar and Martin J. Wainwright},
  year = {2009},
  url = {http://books.nips.cc/papers/files/nips22/NIPS2009_1005.pdf},
  researchr = {https://researchr.org/publication/AgarwalBRW09},
  cites = {0},
  citedby = {0},
  pages = {1-9},
  booktitle = {Advances in Neural Information Processing Systems 22: 23rd Annual Conference on Neural Information Processing Systems 2009. Proceedings of a meeting held 7-10 December 2009, Vancouver, British Columbia, Canada},
  editor = {Yoshua Bengio and Dale Schuurmans and John D. Lafferty and Christopher K. I. Williams and Aron Culotta},
  publisher = {Curran Associates, Inc.},
  isbn = {9781615679119},
}