Information-theoretic lower bounds on the oracle complexity of convex optimization
Agarwal, Alekh, Bartlett, Peter, Ravikumar, Pradeep, & Wainwright, Martin (2009) Information-theoretic lower bounds on the oracle complexity of convex optimization. In Bengio, Y, Schuurmans, D, Lafferty, J, Williams, C, & Culotta, A (Eds.) Advances in Neural Information Processing Systems 22: Proceedings of the 2009 Conference, 7 - 10 December, 2009, Canada.
Impact and interest:
Citation counts are sourced monthly from and citation databases.
These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
|Item Type:||Conference Paper|
|Deposited On:||21 Jan 2015 22:49|
|Last Modified:||21 Jan 2015 22:51|
Repository Staff Only: item control page