Conference paper

Active Learning of Self-concordant like Multi-index Functions

We study the problem of actively learning a multi-index function of the form f (x) = g_0 (A_0 x) from its point evaluations, where A_0 ∈ R_{k×d} with k ≪ d. We build on the assumptions and techniques of an existing approach based on low-rank matrix recovery (Tyagi and Cevher, 2012). Specifically, by introducing an additional self- concordant like assumption on g_0 and adapting the sampling scheme and its analysis accordingly, we provide a bound on the sampling complexity with a weaker dependence on d in the presence of additive Gaussian sampling noise. For example, under natural assumptions on certain other parameters, the dependence decreases from O(d^3/2) to O(d^3/4).

Related material