Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Information-theoretic lower bounds on the oracle complexity of
  stochastic convex optimization   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.

14
The categories of this paper are: math-ph
24
The categories of this paper are: dg-ga
21
The categories of this paper are: adap-org
13
The categories of this paper are: quant-ph
6
The categories of this paper are: astro-ph
17
The categories of this paper are: q-fin
26
The categories of this paper are: bayes-an
22
The categories of this paper are: chao-dyn
19
The categories of this paper are: eess
7
The categories of this paper are: hep-th
11
The categories of this paper are: hep-lat
20
The categories of this paper are: acc-phys
34
The categories of this paper are: chem-ph
27
The categories of this paper are: comp-gas
10
The categories of this paper are: q-bio
15
The categories of this paper are: nucl-ex