Peter Bühlmann

Peter Bühlmann

Auto-generated profile, based on publicly available information

Peter Bühlmann

Seminar for Statistics, ETH Zurich

Research Focus & Metrics

Academic Career Length

33Years (1994-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 October 2011 in Bioinformatics
Verified
Journal Article
Open access
PDF file
DSDaniel J. Stekhoven
Daniel J. Stekhoven
PBPeter Bühlmann
Peter Bühlmann
Motivation: Modern data acquisition based on high-throughput technology is often facing the problem of missing data. Algorithms commonly used in the analysis of such large-scale data often depend on a complete set. Missing value imputation offers a solution to this problem. However, the majority of available imputation methods are restricted to one type of variable only: continuous or categorical. For mixed-type data, the different types are usually handled separately. Therefore, these methods ignore possible relations between variable types. We propose a non-parametric method which can cope with different types of variables simultaneously. Results: We compare several state of the art methods for the imputation of missing values. We propose and evaluate an iterative imputation method (missForest) based on a random forest. By averaging over many unpruned classification or regression trees, random forest intrinsically constitutes a multiple imputation scheme. Using the built-in out-of-bag error estimates of random forest, we are able to estimate the imputation error without the need of a test set. Evaluation is performed on multiple datasets coming from a diverse selection of biological fields with artificially introduced missing values ranging from 10% to 30%. We show that missForest can successfully handle missing values, particularly in datasets including different types of variables. In our comparative study, missForest outperforms other methods of imputation especially in data settings where complex interactions and non-linear relations are suspected. The out-of-bag imputation error estimates of missForest prove to be adequate in all settings. Additionally, missForest exhibits attractive computational efficiency and can cope with high-dimensional data. Availability: The ℝ package missForest is freely available from http://stat.ethz.ch/CRAN/. Contact:stekhoven@stat.math.ethz.ch; buhlmann@stat.math.ethz.ch

1 June 2006 in The Annals of Statistics
Verified
Journal Article
Open access
PDF file
NMNicolai Meinshausen
Nicolai Meinshausen
PBPeter Bühlmann
Peter Bühlmann
The pattern of zero entries in the inverse covariance matrix of a multivariate normal distribution corresponds to conditional independence restrictions between variables. Covariance selection aims at estimating those structural zeros from data. We show that neighborhood selection with the Lasso is a computationally attractive alternative to standard covariance selection for sparse high-dimensional graphs. Neighborhood selection estimates the conditional independence restrictions separately for each node in the graph and is hence equivalent to variable selection for Gaussian linear models. We show that the proposed neighborhood selection scheme is consistent for sparse high-dimensional graphs. Consistency hinges on the choice of the penalty parameter. The oracle value for optimal prediction does not lead to a consistent neighborhood estimate. Controlling instead the probability of falsely joining some distinct connectivity components of the graph, consistent estimation for sparse graphs is achieved (with exponential rates), even when the number of variables grows as the number of observations raised to an arbitrary power.

5 August 2010 in Journal of the Royal Statistical Society Series B: Statistical Methodology
Verified
Journal Article
Open access
PDF file
NMNicolai Meinshausen
Nicolai Meinshausen
PBPeter Bühlmann
Peter Bühlmann
Summary: Estimation of structure, such as in variable selection, graphical modelling or cluster analysis, is notoriously difficult, especially for high dimensional data. We introduce stability selection. It is based on subsampling in combination with (high dimensional) selection algorithms. As such, the method is extremely general and has a very wide range of applicability. Stability selection provides finite sample control for some error rates of false discoveries and hence a transparent principle to choose a proper amount of regularization for structure estimation. Variable selection and structure estimation improve markedly for a range of selection methods if stability selection is applied. We prove for the randomized lasso that stability selection will be variable selection consistent even if the necessary conditions for consistency of the original lasso method are violated. We demonstrate stability selection for variable selection and Gaussian graphical modelling, using real and simulated data.

1 June 2014 in The Annals of Statistics
Verified
Journal Article
Open access
PDF file
SGSara van de Geer
Sara van de Geer
PBPeter Bühlmann
Peter Bühlmann
YRYa’acov Ritov
Ya’acov Ritov
RDRuben Dezeure
Ruben Dezeure
We propose a general method for constructing confidence intervals and statistical tests for single or low-dimensional components of a large parameter vector in a high-dimensional model. It can be easily adjusted for multiplicity taking dependence among tests into account. For linear models, our method is essentially the same as in Zhang and Zhang [J. R. Stat. Soc. Ser. B Stat. Methodol. 76 (2014) 217–242]: we analyze its asymptotic properties and establish its asymptotic optimality in terms of semiparametric efficiency. Our method naturally extends to generalized linear models with convex loss functions. We develop the corresponding theory which includes a careful analysis for Gaussian, sub-Gaussian and bounded correlated designs.

1 January 2011
Verified
Book
Closed access
PBPeter Bühlmann
Peter Bühlmann
SGSara van de Geer
Sara van de Geer

4 January 2008 in Journal of the Royal Statistical Society Series B: Statistical Methodology
Verified
Journal Article
Closed access
PDF file
LMLukas Meier
Lukas Meier
SGSara Van De Geer
Sara Van De Geer
PBPeter Bühlmann
Peter Bühlmann