Multiple Change Point Estimation in Stationary Ergodic Time Series
Given a heterogeneous time-series sample, the objective is to find points in time (called change points) where the probability distribution generating the data has changed. The data are assumed to have been generated by arbitrary unknown stationary ergodic distributions. No modelling, independence or mixing assumptions are made. A novel, computationally efficient, nonparametric method is proposed, and is shown to be asymptotically consistent in this general framework. The theoretical results are complemented with experimental evaluations.
Code (0)
등록된 구현이 없습니다.
Tasks
Time SeriesTime Series AnalysisSimilar Papers 제목 키워드 기반
Locating Changes in Highly Dependent Data with Unknown Number of Change Points
The problem of multiple change point estimation is considered for sequences with unknown number of change points. A consistency framework is suggested that is suitable for highly dependent time-series, and an asymptot…
Time SeriesTime Series AnalysisAsymptotic nonparametric statistical analysis of stationary time series
Stationarity is a very general, qualitative assumption, that can be assessed on the basis of application specifics. It is thus a rather attractive assumption to base statistical analysis on, especially for problems for w…
ClusteringTime SeriesTime Series AnalysisIncome inequality and mobility in geometric Brownian motion with stochastic resetting: theoretical results and empirical evidence of non-ergodicity
We explore the role of non-ergodicity in the relationship between income inequality, the extent of concentration in the income distribution, and mobility, the feasibility of an individual to change their position in the …
PyChEst: a Python package for the consistent retrospective estimation of distributional changes in piece-wise stationary time series
We introduce PyChEst, a Python package which provides tools for the simultaneous estimation of multiple changepoints in the distribution of piece-wise stationary time series. The nonparametric algorithms implemented are …
Time SeriesTime Series AnalysisOn Stationary-Point Hitting Time and Ergodicity of Stochastic Gradient Langevin Dynamics
Stochastic gradient Langevin dynamics (SGLD) is a fundamental algorithm in stochastic optimization. Recent work by Zhang et al. [2017] presents an analysis for the hitting time of SGLD for the first and second order stat…
Stochastic Optimization