Sparse Mass-Constrained Nonlinear Dynamic Model Building from Noisy Data Using a Bayesian Approach

This work proposes two algorithms to guarantee the exact satisfaction of mass conservation laws by sparse data driven models. The initial model building is undertaken by employing the Bayesian Identification of Dynamic Sparse Algebraic Model (BIDSAM) algorithm. Algorithm I proposed in this work updates the model parameters through an optimization process that augments the original model with a data reconciliation step. Algorithm II derives a set of equality constraints for the original model parameters that ensure the exact satisfaction of the resulting closed form model. The proposed algorithms are tested on two case studies for which steady state and dynamic model building are undertaken, and the results show that both algorithms guarantee exact satisfaction of mass balance constraints while at the same time minimizing the deviations of model predictions from their true values even when model training is done with noisy data with bias. While Algorithm II generally resulted in relatively larger model size due to the basic model structure requirements, both algorithms preserve the sparsity and interpretability characteristics of the original BIDSAM model while achieving satisfaction of mass conservation laws.

Authors

Institutions

Publication Details

Journal
Industrial & Engineering Chemistry Research
Published
2025-01-10
DOI
https://doi.org/10.1021/acs.iecr.4c02481
Citations
4
Primary Topic
Model Reduction and Neural Networks
Type
article
Field-Weighted Citation Impact
5.29

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Sparse Mass-Constrained Nonlinear Dynamic Model Building from Noisy Data Using a Bayesian Approach

Debangsu Bhattacharyya, Samuel Adeyemo
4 citations
Industrial & Engineering Chemistry Research
Model Reduction and Neural Networks
5.29
article

Sparse Mass-Constrained Nonlinear Dynamic Model Building from Noisy Data Using a Bayesian Approach

Debangsu Bhattacharyya, Samuel Adeyemo
article en
4 citations

Abstract

This work proposes two algorithms to guarantee the exact satisfaction of mass conservation laws by sparse data driven models. The initial model building is undertaken by employing the Bayesian Identification of Dynamic Sparse Algebraic Model (BIDSAM) algorithm. Algorithm I proposed in this work updates the model parameters through an optimization process that augments the original model with a data reconciliation step. Algorithm II derives a set of equality constraints for the original model parameters that ensure the exact satisfaction of the resulting closed form model. The proposed algorithms are tested on two case studies for which steady state and dynamic model building are undertaken, and the results show that both algorithms guarantee exact satisfaction of mass balance constraints while at the same time minimizing the deviations of model predictions from their true values even when model training is done with noisy data with bias. While Algorithm II generally resulted in relatively larger model size due to the basic model structure requirements, both algorithms preserve the sparsity and interpretability characteristics of the original BIDSAM model while achieving satisfaction of mass conservation laws.

Industrial & Engineering Chemistry ResearchVol. 64(3)
West Virginia University (US), Université Bourgogne Franche-Comté (FR)
National Energy Technology Laboratory
Sustainable cities and communities
Openalex Percentile: Top 5%
Model Reduction and Neural Networks
5.29
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.