Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Martin Slawski is active.

Publication


Featured researches published by Martin Slawski.


Electronic Journal of Statistics | 2013

Non-negative least squares for high-dimensional linear models: Consistency and sparse recovery without regularization

Martin Slawski; Matthias Hein

Least squares fitting is in general not useful for high-dimensional linear models, in which the number of predictors is of the same or even larger order of magnitude than the number of samples. Theory developed in recent years has coined a paradigm according to which sparsity-promoting regularization is regarded as a necessity in such setting. Deviating from this paradigm, we show that non-negativity constraints on the regression coefficients may be similarly effective as explicit regularization if the design matrix has additional properties, which are met in several applications of non-negative least squares (NNLS). We show that for these designs, the performance of NNLS with regard to prediction and estimation is comparable to that of the lasso. We argue further that in specific cases, NNLS may have a better


Genome Biology | 2017

MeDeCom: discovery and quantification of latent components of heterogeneous methylomes

Pavlo Lutsik; Martin Slawski; Gilles Gasparoni; Nikita Vedeneev; Matthias Hein; Jörn Walter

\ell_{\infty}


BMC Bioinformatics | 2012

Isotope pattern deconvolution for peptide mass spectrometry by non-negative least squares/least absolute deviation template matching

Martin Slawski; Rene Hussong; Andreas Tholey; Thomas Jakoby; Barbara Gregorius; Andreas Hildebrandt; Matthias Hein

-rate in estimation and hence also advantages with respect to support recovery when combined with thresholding. From a practical point of view, NNLS does not depend on a regularization parameter and is hence easier to use.


neural information processing systems | 2011

Sparse recovery by thresholded non-negative least squares

Martin Slawski; Matthias Hein

It is important for large-scale epigenomic studies to determine and explore the nature of hidden confounding variation, most importantly cell composition. We developed MeDeCom as a novel reference-free computational framework that allows the decomposition of complex DNA methylomes into latent methylation components and their proportions in each sample. MeDeCom is based on constrained non-negative matrix factorization with a new biologically motivated regularization function. It accurately recovers cell-type-specific latent methylation components and their proportions. MeDeCom is a new unsupervised tool for the exploratory study of the major sources of methylation variation, which should lead to a deeper understanding and better biological interpretation.


Linear Algebra and its Applications | 2015

Estimation of positive definite M-matrices and structure learning for attractive Gaussian Markov random fields

Martin Slawski; Matthias Hein

BackgroundThe robust identification of isotope patterns originating from peptides being analyzed through mass spectrometry (MS) is often significantly hampered by noise artifacts and the interference of overlapping patterns arising e.g. from post-translational modifications. As the classification of the recorded data points into either ‘noise’ or ‘signal’ lies at the very root of essentially every proteomic application, the quality of the automated processing of mass spectra can significantly influence the way the data might be interpreted within a given biological context.ResultsWe propose non-negative least squares/non-negative least absolute deviation regression to fit a raw spectrum by templates imitating isotope patterns. In a carefully designed validation scheme, we show that the method exhibits excellent performance in pattern picking. It is demonstrated that the method is able to disentangle complicated overlaps of patterns.ConclusionsWe find that regularization is not necessary to prevent overfitting and that thresholding is an effective and user-friendly way to perform feature selection. The proposed method avoids problems inherent in regularization-based approaches, comes with a set of well-interpretable parameters whose default configuration is shown to generalize well without the need for fine-tuning, and is applicable to spectra of different platforms. The R package IPPD implements the method and is available from the Bioconductor platform (http://bioconductor.fhcrc.org/help/bioc-views/devel/bioc/html/IPPD.html).


neural information processing systems | 2013

Matrix factorization with binary components

Martin Slawski; Matthias Hein; Pavlo Lutsik


Statistics and Computing | 2012

The structured elastic net for quantile regression and support vector classification

Martin Slawski


neural information processing systems | 2015

b-bit Marginal Regression

Martin Slawski; Ping Li


neural information processing systems | 2016

Quantized Random Projections and Non-Linear Estimation of Cosine Similarity

Ping Li; Michael Mitzenmacher; Martin Slawski


neural information processing systems | 2015

Regularization-free estimation in trace regression with symmetric positive semidefinite matrices

Martin Slawski; Ping Li; Matthias Hein

Collaboration


Dive into the Martin Slawski's collaboration.

Top Co-Authors

Avatar

Matthias Hein

Technische Universität Ilmenau

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge