2 code implementations • 10 May 2022 • Malte Londschien, Peter Bühlmann, Solt Kovács
However, the method can be paired with any classifier that yields class probability predictions, which we illustrate by also using a k-nearest neighbor classifier.
no code implementations • 6 Jan 2021 • Solt Kovács, Tobias Ruckstuhl, Helena Obrist, Peter Bühlmann
We consider estimation of undirected Gaussian graphical models and inverse covariances in high-dimensional scenarios by penalizing the corresponding precision matrix.
Methodology Computation
no code implementations • 20 Oct 2020 • Solt Kovács, Housen Li, Lorenz Haubner, Axel Munk, Peter Bühlmann
Change point estimation is often formulated as a search for the maximum of a gain function describing improved fits when segmenting the data.
no code implementations • 23 Jun 2020 • Solt Kovács, Housen Li, Peter Bühlmann
In this discussion, we compare the choice of seeded intervals and that of random intervals for change point segmentation from practical, statistical and computational perspectives.
Methodology Computation
1 code implementation • 11 Jul 2019 • Malte Londschien, Solt Kovács, Peter Bühlmann
We propose estimation methods for change points in high-dimensional covariance structures with an emphasis on challenging scenarios with missing values.