@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}
}
@unpublished{BlanchardMathe2012,
  author    = {Blanchard, Gilles and Math{\´e}, Peter},
  title     = {Discrepancy principle for statistical inverse problems with application to conjugate gradient iteration},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-57117},
  year      = {2012},
  abstract  = {The authors discuss the use of the discrepancy principle for statistical inverse problems, when the underlying operator is of trace class. Under this assumption the discrepancy principle is well defined, however a plain use of it may occasionally fail and it will yield sub-optimal rates. Therefore, a modification of the discrepancy is introduced, which takes into account both of the above deficiencies. For a variety of linear regularization schemes as well as for conjugate gradient iteration this modification is shown to yield order optimal a priori error bounds under general smoothness assumptions. A posteriori error control is also possible, however at a sub-optimal rate, in general. This study uses and complements previous results for bounded deterministic noise.},
  language  = {en}
}
@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{BlanchardDelattreRoquain2012,
  author    = {Blanchard, Gilles and Delattre, Sylvain and Roquain, {\´E}tienne},
  title     = {Testing over a continuum of null hypotheses},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-56877},
  year      = {2012},
  abstract  = {We introduce a theoretical framework for performing statistical hypothesis testing simultaneously over a fairly general, possibly uncountably infinite, set of null hypotheses. This extends the standard statistical setting for multiple hypotheses testing, which is restricted to a finite set. This work is motivated by numerous modern applications where the observed signal is modeled by a stochastic process over a continuum. As a measure of type I error, we extend the concept of false discovery rate (FDR) to this setting. The FDR is defined as the average ratio of the measure of two random sets, so that its study presents some challenge and is of some intrinsic mathematical interest. Our main result shows how to use the p-value process to control the FDR at a nominal level, either under arbitrary dependence of p-values, or under the assumption that the finite dimensional distributions of the p-value process have positive correlations of a specific type (weak PRDS). Both cases generalize existing results established in the finite setting, the latter one leading to a less conservative procedure. The interest of this approach is demonstrated in several non-parametric examples: testing the mean/signal in a Gaussian white noise model, testing the intensity of a Poisson process and testing the c.d.f. of i.i.d. random variables. Conceptually, an interesting feature of the setting advocated here is that it focuses directly on the intrinsic hypothesis space associated with a testing model on a random process, without referring to an arbitrary discretization.},
  language  = {en}
}