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

Autoria(s): Agarwal, Alekh; Bartlett, Peter; Ravikumar, Pradeep; Wainwright, Martin
Data(s)

2012
Identificador

http://eprints.qut.edu.au/76938/
Publicador

Institute of Electrical and Electronics Engineers
Relação

DOI:10.1109/TIT.2011.2182178

Agarwal, Alekh, Bartlett, Peter, Ravikumar, Pradeep, & Wainwright, Martin (2012) Information-theoretic lower bounds on the oracle complexity of stochastic convex optimization. IEEE Transactions on Information Theory, 58(5), pp. 3235-3249.
Fonte

School of Mathematical Sciences; Science & Engineering Faculty
Tipo

Journal Article
Acesso ao item digital