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

MLA

Agarwal, Alekh, et al. Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization. 2010. EBSCOhost, widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsarx&AN=edsarx.1009.0571&authtype=sso&custid=ns315887.

APA

Agarwal, A., Bartlett, P. L., Ravikumar, P., & Wainwright, M. J. (2010). Information-theoretic lower bounds on the oracle complexity of stochastic convex optimization.

Chicago

Agarwal, Alekh, Peter L. Bartlett, Pradeep Ravikumar, and Martin J. Wainwright. 2010. “Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization.” http://widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsarx&AN=edsarx.1009.0571&authtype=sso&custid=ns315887.