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

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

2010-09-03

arxiv.org/abs/1009.0571v3

Statistics

Machine Learning

Scientific paper

Relative to the large literature on upper bounds on complexity of convex optimization, lesser attention has been paid to the fundamental hardness of these problems. Given the extensive use of convex optimization in machine learning and statistics, gaining an understanding of these complexity-theoretic issues is important. In this paper, we study the complexity of stochastic convex optimization in an oracle model of computation. We improve upon known results and obtain tight minimax complexity estimates for various function classes.

Affiliated with

Also associated with

No associations

Rating

Information-theoretic lower bounds on the oracle complexity of stochastic convex optimization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Information-theoretic lower bounds on the oracle complexity of stochastic convex optimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Information-theoretic lower bounds on the oracle complexity of stochastic convex optimization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-684061