2
Here's one possible solution:
$$\nabla f(x) = \left[ \frac{\partial f(x)}{\partial x_1} \cdots \frac{\partial f(x)}{\partial x_n}\right]^T$$
The coordinate descent algorithm is exploring all the coordinate axes, so you have an estimate of $\hat{\nabla} f_i(x_k)=\frac{\partial f(x^k)}{\partial x_i}$. In particular, when $\Big| \hat{\nabla} f_i(x_k) \Big| < ...
1
VC-dimension has multiple multiclass extensions:
pseudo dimension, Natarajan dimension, graph dimension.
See here for example:
http://math.huji.ac.il/~amitd/multiclass.pdf
http://jmlr.org/papers/volume8/guermeur07a/guermeur07a.pdf
There are also extensions to continuous-valued functions (fat-shattering dimension):
http://users.cecs.anu.edu.au/~williams/...
Only top voted, non community-wiki answers of a minimum length are eligible
Related Tags
svm × 8machine-learning × 5
optimization × 3
convex-optimization × 3
cc.complexity-theory × 1
reference-request × 1
cr.crypto-security × 1
linear-programming × 1
lg.learning × 1
st.statistics × 1
clustering × 1
vc-dimension × 1
primal-dual × 1
privacy × 1