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

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Alekh Agarwal' in GoogleThis author has not been identified. Look up 'Peter L. Bartlett' in GoogleThis author has not been identified. Look up 'Pradeep D. Ravikumar' in GoogleThis author has not been identified. Look up 'Martin J. Wainwright' in Google

runs on WebDSL