@unpublished{BlanchardMuecke2016,
  author    = {Blanchard, Gilles and M{\"u}cke, Nicole},
  title     = {Optimal rates for regularization of statistical inverse learning problems},
  volume    = {5},
  number    = {5},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {2193-6943},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-89782},
  pages     = {36},
  year      = {2016},
  abstract  = {We consider a statistical inverse learning problem, where we observe the image of a function f through a linear operator A at i.i.d. random design points X_i, superposed with an additional noise. The distribution of the design points is unknown and can be very general. We analyze simultaneously the direct (estimation of Af) and the inverse (estimation of f) learning problems. In this general framework, we obtain strong and weak minimax optimal rates of convergence (as the number of observations n grows large) for a large class of spectral regularization methods over regularity classes defined through appropriate source conditions. This improves on or completes previous results obtained in related settings. The optimality of the obtained rates is shown not only in the exponent in n but also in the explicit dependence of the constant factor in the variance of the noise and the radius of the source condition set.},
  language  = {en}
}
@unpublished{BlanchardKraemer2016,
  author    = {Blanchard, Gilles and Kr{\"a}mer, Nicole},
  title     = {Convergence rates of kernel conjugate gradient for random design regression},
  volume    = {5},
  number    = {8},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {2193-6943},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-94195},
  pages     = {31},
  year      = {2016},
  abstract  = {We prove statistical rates of convergence for kernel-based least squares regression from i.i.d. data using a conjugate gradient algorithm, where regularization against overfitting is obtained by early stopping. This method is related to Kernel Partial Least Squares, a regression method that combines supervised dimensionality reduction with least squares projection. Following the setting introduced in earlier related literature, we study so-called "fast convergence rates" depending on the regularity of the target regression function (measured by a source condition in terms of the kernel integral operator) and on the effective dimensionality of the data mapped into the kernel space. We obtain upper bounds, essentially matching known minimax lower bounds, for the L^2 (prediction) norm as well as for the stronger Hilbert norm, if the true regression function belongs to the reproducing kernel Hilbert space. If the latter assumption is not fulfilled, we obtain similar convergence rates for appropriate norms, provided additional unlabeled data are available.},
  language  = {en}
}