• Deutsch
    • English
  • English 
    • Deutsch
    • English
  • Login
Item View 
  •   Home
  • Naturwissenschaften, Mathematik und Informatik
  • Fakultät für Mathematik und Informatik (inkl. GAUSS)
  • Item View
  •   Home
  • Naturwissenschaften, Mathematik und Informatik
  • Fakultät für Mathematik und Informatik (inkl. GAUSS)
  • Item View
JavaScript is disabled for your browser. Some features of this site may not work without it.

Multiscale Change-point Segmentation: Beyond Step Functions

by Qinghai Guo
Doctoral thesis
Date of Examination:2017-02-03
Date of issue:2017-03-08
Advisor:Prof. Dr. Axel Munk
Referee:Prof. Dr. Axel Munk
Referee:Prof. Dr. Andrea Krajina
Referee:Prof. Dr. Stephan Huckemann
Referee:Prof. Dr. Russell Luke
Referee:Prof. Dr. Chenchang Zhu
Referee:Dr. Michael Habeck
crossref-logoPersistent Address: http://dx.doi.org/10.53846/goediss-6178

 

 

Files in this item

Name:thesis_QinghaiGuo.pdf
Size:890.Kb
Format:PDF
ViewOpen

The following license files are associated with this item:


Abstract

English

Many multiscale segmentation methods have been proven to work successfully for detecting multiple change-points, mainly because they provide faithful statistical statements, while at the same time allowing for efficient computation. Underpinning theory has been studied exclusively for models which assume that the signal is an unknown step function. However, when the signal is only approximately piecewise constant, which often occurs in practical applications, the behavior of multiscale segmentation methods is still not well studied. To narrow this gap, we investigate the asymptotic properties of a certain class of \emph{multiscale change-point segmentation} methods in a general nonparametric regression setting. The main contribution of this work is the adaptation property of these methods over a wide range of function classes, although they are designed for step functions. On the one hand, this includes the optimal convergence rates (up to log-factor) for step functions with bounded or even increasing to infinite number of jumps.  On the other hand, for models beyond step functions, which are characterized by certain approximation spaces,  we show the optimal rates (up to log-factor) as well. This includes bounded variation functions and (piecewise) H\"{o}lder functions of smoothness order $ 0 < \alpha \leq 1$.  All results are formulated in terms of $L^p$-loss, $0 <  p < \infty$, both almost surely and in expectation. In addition, we show that the convergence rates readily imply accuracy of feature detection, such as change-points, modes, troughs, etc. The practical performance is examined by various numerical simulations. 
Keywords: Adaptive estimation; approximation spaces; jump detection; model misspecification; multiscale inference; nonparametric regression; robustness
 

Statistik

Publish here

Browse

All of eDissFaculties & ProgramsIssue DateAuthorAdvisor & RefereeAdvisorRefereeTitlesTypeThis FacultyIssue DateAuthorAdvisor & RefereeAdvisorRefereeTitlesType

Help & Info

Publishing on eDissPDF GuideTerms of ContractFAQ

Contact Us | Impressum | Cookie Consents | Data Protection Information
eDiss Office - SUB Göttingen (Central Library)
Platz der Göttinger Sieben 1
Mo - Fr 10:00 – 12:00 h


Tel.: +49 (0)551 39-27809 (general inquiries)
Tel.: +49 (0)551 39-28655 (open access/parallel publications)
ediss_AT_sub.uni-goettingen.de
[Please replace "_AT_" with the "@" sign when using our email adresses.]
Göttingen State and University Library | Göttingen University
Medicine Library (Doctoral candidates of medicine only)
Robert-Koch-Str. 40
Mon – Fri 8:00 – 24:00 h
Sat - Sun 8:00 – 22:00 h
Holidays 10:00 – 20:00 h
Tel.: +49 551 39-8395 (general inquiries)
Tel.: +49 (0)551 39-28655 (open access/parallel publications)
bbmed_AT_sub.uni-goettingen.de
[Please replace "_AT_" with the "@" sign when using our email adresses.]