Пожалуйста, войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)
Цитировать эту публикацию
%0 Conference Paper
%1 conf/nips/AgarwalBRW09
%A Agarwal, Alekh
%A Bartlett, Peter L.
%A Ravikumar, Pradeep
%A Wainwright, Martin J.
%B NIPS
%D 2009
%E Bengio, Yoshua
%E Schuurmans, Dale
%E Lafferty, John D.
%E Williams, Christopher K. I.
%E Culotta, Aron
%I Curran Associates, Inc.
%K
%P 1-9
%T Information-theoretic lower bounds on the oracle complexity of convex optimization.
%U http://dblp.uni-trier.de/db/conf/nips/nips2009.html#AgarwalBRW09
%@ 9781615679119
@inproceedings{conf/nips/AgarwalBRW09,
added-at = {2023-12-14T15:18:51.000+0100},
author = {Agarwal, Alekh and Bartlett, Peter L. and Ravikumar, Pradeep and Wainwright, Martin J.},
biburl = {https://www.bibsonomy.org/bibtex/20cf9e066224b56a3d2f7a300fa60494a/admin},
booktitle = {NIPS},
crossref = {conf/nips/2009},
editor = {Bengio, Yoshua and Schuurmans, Dale and Lafferty, John D. and Williams, Christopher K. I. and Culotta, Aron},
ee = {http://papers.nips.cc/paper/3689-information-theoretic-lower-bounds-on-the-oracle-complexity-of-convex-optimization},
interhash = {e99fd3c77a91fa912c317793cf41bee1},
intrahash = {0cf9e066224b56a3d2f7a300fa60494a},
isbn = {9781615679119},
keywords = {},
pages = {1-9},
publisher = {Curran Associates, Inc.},
timestamp = {2023-12-14T15:18:51.000+0100},
title = {Information-theoretic lower bounds on the oracle complexity of convex optimization.},
url = {http://dblp.uni-trier.de/db/conf/nips/nips2009.html#AgarwalBRW09},
year = 2009
}