Kalman Filtering for Simplicial Processes

In this paper, we propose a topology-aware Kalman filter for hidden dynamics over simplicial complex. Specifically, we consider that the hidden dynamics of a system can be expressed as a simplicial process that respects the structure of the underlying network. And these dynamics are observed through an observation matrix, which can be represented using simplicial convolution filters. This combination allows us to model effectively a broader spectrum of network dynamics than graph-based alternatives, such as edge flow evolution. Additionally, we propose a parametric, structure-aware noise covariance model for the system dynamics. We alternate between estimating the process state using the Kalman filter and updating the parameters through maximum likelihood estimation. The efficacy of the proposed approach is demonstrated through experiments on both real-world and synthetic datasets.

Authors

Institutions

Publication Details

Published
2024-10-27
DOI
https://doi.org/10.1109/ieeeconf60004.2024.10942943
Citations
3
Primary Topic
Constraint Satisfaction and Optimization
Type
article
Field-Weighted Citation Impact
1.05
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Kalman Filtering for Simplicial Processes

Mohammad Sabbaqi, Joshin Krishnan, Baltasar Beferull‐Lozano, Rohan Money et al.
3 citations
Constraint Satisfaction and Optimization
1.05
article

Kalman Filtering for Simplicial Processes

Mohammad Sabbaqi, Joshin Krishnan, Baltasar Beferull‐Lozano, Rohan Money, Elvin Isufi
article en
3 citations

Abstract

In this paper, we propose a topology-aware Kalman filter for hidden dynamics over simplicial complex. Specifically, we consider that the hidden dynamics of a system can be expressed as a simplicial process that respects the structure of the underlying network. And these dynamics are observed through an observation matrix, which can be represented using simplicial convolution filters. This combination allows us to model effectively a broader spectrum of network dynamics than graph-based alternatives, such as edge flow evolution. Additionally, we propose a parametric, structure-aware noise covariance model for the system dynamics. We alternate between estimating the process state using the Kalman filter and updating the parameters through maximum likelihood estimation. The efficacy of the proposed approach is demonstrated through experiments on both real-world and synthetic datasets.

Simula Metropolitan Center for Digital Engineering (NO), Delft University of Technology (NL)
Openalex Percentile: Top 20%
Constraint Satisfaction and Optimization
1.05
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.