Timezone: »
Poster
Locating Changes in Highly Dependent Data with Unknown Number of Change Points
Azadeh Khaleghi · Daniil Ryabko
Wed Dec 05 07:00 PM -- 12:00 AM (PST) @ Harrah’s Special Events Center 2nd Floor #None
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 asymptotically consistent algorithm is proposed. In order for the consistency to be established the only assumption required is that the data is generated by stationary ergodic time-series distributions. No modeling, independence or parametric assumptions are made; the data are allowed to be dependent and the dependence can be of arbitrary form. The theoretical results are complemented with experimental evaluations.
Author Information
Azadeh Khaleghi (INRIA Lille - Nord Europe)
Daniil Ryabko (INRIA)
More from the Same Authors
-
2017 Poster: Independence clustering (without a matrix) »
Daniil Ryabko -
2012 Poster: Online Regret Bounds for Undiscounted Continuous Reinforcement Learning »
Ronald Ortner · Daniil Ryabko -
2012 Poster: Reducing statistical time-series problems to binary classification »
Daniil Ryabko · Jeremie Mary -
2012 Spotlight: Locating Changes in Highly Dependent Data with Unknown Number of Change Points »
Azadeh Khaleghi · Daniil Ryabko -
2011 Poster: Selecting the State-Representation in Reinforcement Learning »
Odalric-Ambrym Maillard · Remi Munos · Daniil Ryabko
