Prof. Dr. Markus Reiß forscht auf dem Gebiet der mathematischen Statistik mit Schwerpunkt auf Inferenz für stochastische Prozesse und inverse Probleme. Seine Arbeit umfasst die Entwicklung statistischer Methoden für stochastische partielle Differentialgleichungen (SPDEs) und die Analyse hochdimensionaler Zeitreihen. Ein zentrales Thema ist die Datenassimilation, also die Integration von Daten in komplexe Computermodelle, sowie die Optimierung numerischer Algorithmen durch Early-Stopping-Verfahren. Er verbindet theoretische Statistik mit Anwendungen in Physik, Neurowissenschaften und Quantitativer Ökonomie.
🔒 Das System hat 1.200 mögliche Industrie-Partner gefunden — Firmen, Scores und Begründungen sind nur für eingeloggte Nutzer:innen sichtbar. Anmelden
Prof. Dr. Markus Reiß
HU-FIS-Profil ↗FOR 5381/2: Optimale Aktionen und Stoppen im sequentiellen Lernen (TP 02)
university
EXC 2046/2: Berlin Mathematics Research Center (MATH+)
university
SFB 1294/1: Datenassimilation – Die nahtlose Verschmelzung von Daten und Modellen
other
Förderer: DFG sonstige Programme Zeitraum: 05/2009 - 10/2009 Projektleitung: Prof. Dr. Markus Reiß
Förderer: DFG Sonderforschungsbereich Zeitraum: 10/2010 - 12/2016 Projektleitung: Prof. Dr. Markus Reiß
Förderer: DFG Forschungsgruppe Zeitraum: 04/2012 - 08/2015 Projektleitung: Prof. Dr. Markus Reiß
Bernoulli · DOI
We suppose that a Lévy process is observed at discrete time points. A rather general construction of minimum-distance estimators is shown to give consistent estimators of the Lévy–Khinchine characteristics as the number of observations tends to infinity, keeping the observation distance fixed. For a specific $C^2$-criterion this estimator is rate-optimal. The connection with deconvolution and inverse problems is explained. A key step in the proof is a uniform control on the deviations of the empirical characteristic function on the whole real line.
SIAM Journal on Numerical Analysis · DOI
We introduce and analyze numerical methods for the treatment of inverse problems, based on an adaptive wavelet Galerkin discretization. These methods combine the theoretical advantages of the wavelet-vaguelette decomposition (WVD) in terms of optimally adapting to the unknown smoothness of the solution, together with the numerical simplicity of Galerkin methods. In a first step, we simply combine a thresholding algorithm on the data with a Galerkin inversion on a fixed linear space. In a second step, a more elaborate method performs the inversion by an adaptive procedure in which a smaller space adapted to the solution is iteratively constructed; this leads to a significant reduction of the computational cost.
Open MIND
We study two nonlinear methods for statistical linear inverse problems when the operator is not known. The two constructions combine Galerkin regularization and wavelet thresholding. Their performances depend on the underlying structure of the operator, quantified by an index of sparsity. We prove their rate-optimality and adaptivity properties over Besov classes. 1. Introduction. Linear inverse problems with error in the operator. We want to recover f ∈ L 2 (D), where D is a domain in R d, from data (1.1) gε = Kf + ε ˙ W,