Dokument-ID Dokumenttyp Verfasser/Autoren Herausgeber Haupttitel Abstract Auflage Verlagsort Verlag Erscheinungsjahr Seitenzahl Schriftenreihe Titel Schriftenreihe Bandzahl ISBN Quelle der Hochschulschrift Konferenzname Quelle:Titel Quelle:Jahrgang Quelle:Heftnummer Quelle:Erste Seite Quelle:Letzte Seite URN DOI Abteilungen
OPUS4-34343 Buch (Monographie) Blanchard, Gilles Komplexitätsanalyse in Statistik und Lerntheorie : Antrittsvorlesung 2011-05-04 Gilles Blanchards Vortrag gewährt Einblicke in seine Arbeiten zur Entwicklung und Analyse statistischer Eigenschaften von Lernalgorithmen. In vielen modernen Anwendungen, beispielsweise bei der Schrifterkennung oder dem Spam- Filtering, kann ein Computerprogramm auf der Basis vorgegebener Beispiele automatisch lernen, relevante Vorhersagen für weitere Fälle zu treffen. Mit der mathematischen Analyse der Eigenschaften solcher Methoden beschäftigt sich die Lerntheorie, die mit der Statistik eng zusammenhängt. Dabei spielt der Begriff der Komplexität der erlernten Vorhersageregel eine wichtige Rolle. Ist die Regel zu einfach, wird sie wichtige Einzelheiten ignorieren. Ist sie zu komplex, wird sie die vorgegebenen Beispiele "auswendig" lernen und keine Verallgemeinerungskraft haben. Blanchard wird erläutern, wie Mathematische Werkzeuge dabei helfen, den richtigen Kompromiss zwischen diesen beiden Extremen zu finden. Potsdam Univ.-Bibl. 2011 Institut für Mathematik
OPUS4-38089 Wissenschaftlicher Artikel Blanchard, Gilles; Delattre, Sylvain; Roquain, Etienne Testing over a continuum of null hypotheses with False Discovery Rate control We consider statistical hypothesis testing simultaneously over a fairly general, possibly uncountably infinite, set of null hypotheses, under the assumption that a suitable single test (and corresponding p-value) is known for each individual hypothesis. We extend to this setting the notion of false discovery rate (FDR) as a measure of type I error. Our main result studies specific procedures based on the observation of the p-value process. Control of the FDR at a nominal level is ensured 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. Its interest 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. Voorburg International Statistical Institute 2014 30 Bernoulli : official journal of the Bernoulli Society for Mathematical Statistics and Probability 20 1 304 333 10.3150/12-BEJ488 Institut für Mathematik
OPUS4-5547 unpublished Blanchard, Gilles; Delattre, Sylvain; Roquain, Étienne Testing over a continuum of null hypotheses 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. 2012 urn:nbn:de:kobv:517-opus-56877 Institut für Mathematik
OPUS4-38177 Wissenschaftlicher Artikel Blanchard, Gilles; Dickhaus, Thorsten; Roquain, Etienne; Villers, Fanny On least favorable configurations for step-up-down tests Taipei Statistica Sinica, Institute of Statistical Science, Academia Sinica 2014 27 Statistica Sinica 24 1 1 U31 10.5705/ss.2011.205 Institut für Mathematik
OPUS4-11977 Wissenschaftlicher Artikel Blanchard, Gilles; Kawanabe, Motoaki; Sugiyama, Masashi; Spokoiny, Vladimir G.; Müller, Klaus-Robert In search of non-Gaussian components of a high-dimensional distribution Finding non-Gaussian components of high-dimensional data is an important preprocessing step for efficient information processing. This article proposes a new linear method to identify the '' non-Gaussian subspace '' within a very general semi-parametric framework. Our proposed method, called NGCA (non-Gaussian component analysis), is based on a linear operator which, to any arbitrary nonlinear (smooth) function, associates a vector belonging to the low dimensional non-Gaussian target subspace, up to an estimation error. By applying this operator to a family of different nonlinear functions, one obtains a family of different vectors lying in a vicinity of the target space. As a final step, the target space itself is estimated by applying PCA to this family of vectors. We show that this procedure is consistent in the sense that the estimaton error tends to zero at a parametric rate, uniformly over the family, Numerical examples demonstrate the usefulness of our method 2006 Institut für Mathematik
OPUS4-9419 unpublished Blanchard, Gilles; Krämer, Nicole Convergence rates of kernel conjugate gradient for random design regression 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. Potsdam Universitätsverlag Potsdam 2016 31 5 8 urn:nbn:de:kobv:517-opus4-94195 Institut für Mathematik
OPUS4-35553 Wissenschaftlicher Artikel Blanchard, Gilles; Mathe, Peter Discrepancy principle for statistical inverse problems with application to conjugate gradient iteration 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 corrects both of the above deficiencies. For a variety of linear regularization schemes as well as for conjugate gradient iteration it 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. Bristol IOP Publ. Ltd. 2012 23 Inverse problems : an international journal of inverse problems, inverse methods and computerised inversion of data 28 11 10.1088/0266-5611/28/11/115011 Institut für Mathematik
OPUS4-5553 unpublished Blanchard, Gilles; Mathé, Peter Discrepancy principle for statistical inverse problems with application to conjugate gradient iteration 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. 2012 urn:nbn:de:kobv:517-opus-57117 Institut für Mathematik
OPUS4-8978 unpublished Blanchard, Gilles; Mücke, Nicole Optimal rates for regularization of statistical inverse learning problems 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. Potsdam Universitätsverlag Potsdam 2016 36 5 5 urn:nbn:de:kobv:517-opus4-89782 Institut für Mathematik
OPUS4-12324 Wissenschaftlicher Artikel Kawanabe, Motoaki; Blanchard, Gilles; Sugiyama, Masashi; Spokoiny, Vladimir G.; Müller, Klaus-Robert A novel dimension reduction procedure for searching non-Gaussian subspaces In this article, we consider high-dimensional data which contains a low-dimensional non-Gaussian structure contaminated with Gaussian noise and propose a new linear method to identify the non-Gaussian subspace. Our method NGCA (Non-Gaussian Component Analysis) is based on a very general semi-parametric framework and has a theoretical guarantee that the estimation error of finding the non-Gaussian components tends to zero at a parametric rate. NGCA can be used not only as preprocessing for ICA, but also for extracting and visualizing more general structures like clusters. A numerical study demonstrates the usefulness of our method 2006 10.1007/11679363_19 Institut für Informatik und Computational Science