Dimensionality Collapse: Optimal Measurement Selection for Low-Error Infinite-Horizon Forecasting

Helmuth Naumer, Farzad Kamalabadi
3/27/2023
cs.LGeess.SPeess.SY

No confident code implementation found for this paper.

Abstract

This work introduces a method to select linear functional measurements of a vector-valued time series optimized for forecasting distant time-horizons. By formulating and solving the problem of sequential linear measurement design as an infinite-horizon problem with the time-averaged trace of the Cramér-Rao lower bound (CRLB) for forecasting as the cost, the most informative data can be collected irrespective of the eventual forecasting algorithm. By introducing theoretical results regarding measurements under additive noise from natural exponential families, we construct an equivalent problem from which a local dimensionality reduction can be derived. This alternative formulation is based on the future collapse of dimensionality inherent in the limiting behavior of many differential equations and can be directly observed in the low-rank structure of the CRLB for forecasting. Implementations of both an approximate dynamic programming formulation and the proposed alternative are illustrated using an extended Kalman filter for state estimation, with results on simulated systems with limit cycles and chaotic behavior demonstrating a linear improvement in the CRLB as a function of the number of collapsing dimensions of the system.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{naumer2023dimensionality,
  title  = {Dimensionality Collapse: Optimal Measurement Selection for Low-Error Infinite-Horizon Forecasting},
  author = {Helmuth Naumer and Farzad Kamalabadi},
  year   = {2023},
  eprint = {2303.15407},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2303.15407v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2303.15407.svg)](https://codeofpaper.com/paper/2303.15407)

Discussion