Zhichao Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Zhichao Chen has a total of 80 co-authors. Here are the top co-authors by number of shared publications:
- Hao Wang
Shanghai University
16 shared publications - Zhihuan Song
Zhejiang University
8 shared publications - Licheng Pan
Huzhou Institute of Industrial Control Technology, College of Control Science and Engineering, Zhejiang University, Huzhou, China
7 shared publications - Xinggao Liu
Huzhou Institute of Industrial Control Technology, College of Control Science and Engineering, Zhejiang University, Huzhou, China
7 shared publications - Yiran Ma
Zhejiang University
6 shared publications - Zhaoran Liu
Zhejiang University
6 shared publications
Latest Publications
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/CAA Journal of Automatica Sinica
- Vol. 13 (10) , 2280-2299
FMT-I: Flexible Mass Transport for Noise-Resilient Missing Data Imputation
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/CAA Journal of Automatica Sinica
- Vol. 13 (10) , 2280-2299
FMT-I: Flexible Mass Transport for Noise-Resilient Missing Data Imputation
- 23 July 2026
- Published by American Chemical Society (ACS) in ACS Energy Letters
- Vol. 11 (8) , 5643-5651
Exploiting Electrolyzer Flexibility across Multiscale Energy Markets
Electricity cost and equipment degradation remain key barriers to competitive hydrogen production via water electrolysis. Current electrolyzers are typically optimized within a single electricity market, leaving unresolved how cross-market coordination affects their degradation behavior and techno-economic performance. Here, we show that flexible proton exchange membrane (PEM) electrolyzers can reduce hydrogen production costs by coordinating participation in day-ahead and real-time markets. We develop a multiscale model predictive control framework that jointly optimizes electricity procurement and electrolyzer operation while explicitly accounting for high-fidelity electrochemical behavior and membrane degradation. The controller aligns hourly day-ahead commitments with high-frequency real-time adjustments, enabling exploitation of intermarket price differentials under rigorous operational and durability constraints. Using year-long Texas grid data, we demonstrate electricity cost reductions up to fourfold. Moreover, degradation-aware operation shifts electrolyzer loading toward low-wear regimes, showing that dynamic market-responsive operation can simultaneously lower costs and extend component lifetime.
- 23 July 2026
- Published by American Chemical Society (ACS) in ACS Energy Letters
- Vol. 11 (8) , 5643-5651
Exploiting Electrolyzer Flexibility across Multiscale Energy Markets
Electricity cost and equipment degradation remain key barriers to competitive hydrogen production via water electrolysis. Current electrolyzers are typically optimized within a single electricity market, leaving unresolved how cross-market coordination affects their degradation behavior and techno-economic performance. Here, we show that flexible proton exchange membrane (PEM) electrolyzers can reduce hydrogen production costs by coordinating participation in day-ahead and real-time markets. We develop a multiscale model predictive control framework that jointly optimizes electricity procurement and electrolyzer operation while explicitly accounting for high-fidelity electrochemical behavior and membrane degradation. The controller aligns hourly day-ahead commitments with high-frequency real-time adjustments, enabling exploitation of intermarket price differentials under rigorous operational and durability constraints. Using year-long Texas grid data, we demonstrate electricity cost reductions up to fourfold. Moreover, degradation-aware operation shifts electrolyzer loading toward low-wear regimes, showing that dynamic market-responsive operation can simultaneously lower costs and extend component lifetime.
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 22 (7) , 6034-6045
Slack More, Predict Better: Proximal Relaxation for Probabilistic Latent Variable Model-Based Soft Sensors
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 22 (7) , 6034-6045
Slack More, Predict Better: Proximal Relaxation for Probabilistic Latent Variable Model-Based Soft Sensors
- 5 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Artificial Intelligence
- Vol. 7 (7) , 3979-3989
DeepFilter: A Transformer-Style Framework for Accurate and Efficient Process Monitoring
Effective process monitoring is increasingly vital in industrial automation for ensuring operational safety, necessitating both high accuracy and efficiency. Although Transformers have demonstrated success in various fields, their canonical form based on the self-attention mechanism is inadequate for process monitoring due to two primary limitations: ❶ the step-wise correlations captured by the self-attention mechanism struggle to capture discriminative patterns in monitoring logs due to the lack of semantics of each step, thus compromising accuracy; ❷ the quadratic computational complexity of self-attention hampers efficiency. To address these issues, we propose DeepFilter, which modifies the Transformer for process monitoring. The core modification is replacing the self-attention layer with an efficient filtering layer that excels at capturing long-term discriminative patterns with reduced complexity. Equipped with the efficient filtering layer, DeepFilter enhances both accuracy and efficiency, meeting the stringent demands of process monitoring. Experimental results on real-world process monitoring datasets validate DeepFilterȉs superiority in terms of accuracy and efficiency compared to existing state-of-the-art models.
- 5 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Artificial Intelligence
- Vol. 7 (7) , 3979-3989
DeepFilter: A Transformer-Style Framework for Accurate and Efficient Process Monitoring
Effective process monitoring is increasingly vital in industrial automation for ensuring operational safety, necessitating both high accuracy and efficiency. Although Transformers have demonstrated success in various fields, their canonical form based on the self-attention mechanism is inadequate for process monitoring due to two primary limitations: ❶ the step-wise correlations captured by the self-attention mechanism struggle to capture discriminative patterns in monitoring logs due to the lack of semantics of each step, thus compromising accuracy; ❷ the quadratic computational complexity of self-attention hampers efficiency. To address these issues, we propose DeepFilter, which modifies the Transformer for process monitoring. The core modification is replacing the self-attention layer with an efficient filtering layer that excels at capturing long-term discriminative patterns with reduced complexity. Equipped with the efficient filtering layer, DeepFilter enhances both accuracy and efficiency, meeting the stringent demands of process monitoring. Experimental results on real-world process monitoring datasets validate DeepFilterȉs superiority in terms of accuracy and efficiency compared to existing state-of-the-art models.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 23, 19219-19231
Degradation-Aware Model Predictive Control for Battery Swapping Stations Under Energy Arbitrage
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 23, 19219-19231
Degradation-Aware Model Predictive Control for Battery Swapping Stations Under Energy Arbitrage
- Top Cited Papers
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 37 (1) , 82-94
Robust Missing Value Imputation With Proximal Optimal Transport for Low-Quality IIoT Data
Accurate imputation of missing data is crucial in the Industrial Internet-of-Things (IIoT), where operations are often compromised by noisy samples from harsh environments. Traditional imputation methods struggle with such noise due to their black-box nature or lack of adaptability. To address this issue, we recast data imputation as a distribution alignment challenge, utilizing the flexibility of optimal transport (OT) to handle noisy samples. Specifically, we first introduce the Proximal Optimal Transport (POT) problem, where the transportation cost is obtained by the network simplex approach with a selective matching mechanism, which renders it capable of matching distributions with noisy samples. Subsequently, we propose the POT-I framework, where the objective is to minimize the transport cost of POT. The produced gradient is used to refine the imputation value, which achieves missing data imputation (MDI) while getting robustness to noisy samples. Experiments on real-world IIoT datasets demonstrate the superiority of POT-I over state-of-the-art imputation methods.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 37 (1) , 82-94
Top Cited PapersRobust Missing Value Imputation With Proximal Optimal Transport for Low-Quality IIoT Data
Accurate imputation of missing data is crucial in the Industrial Internet-of-Things (IIoT), where operations are often compromised by noisy samples from harsh environments. Traditional imputation methods struggle with such noise due to their black-box nature or lack of adaptability. To address this issue, we recast data imputation as a distribution alignment challenge, utilizing the flexibility of optimal transport (OT) to handle noisy samples. Specifically, we first introduce the Proximal Optimal Transport (POT) problem, where the transportation cost is obtained by the network simplex approach with a selective matching mechanism, which renders it capable of matching distributions with noisy samples. Subsequently, we propose the POT-I framework, where the objective is to minimize the transport cost of POT. The produced gradient is used to refine the imputation value, which achieves missing data imputation (MDI) while getting robustness to noisy samples. Experiments on real-world IIoT datasets demonstrate the superiority of POT-I over state-of-the-art imputation methods.
- 13 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (1) , 82-95
Blending Data and Knowledge for Process Industrial Modeling Under Riemannian Preconditioned Bayesian Framework
Integrating graph neural networks (GNNs) with variational inference (VI) provides a promising direction for blending structured prior knowledge with observational empirical data for data-driven industrial process modeling. However, this task requires inference of the normalized adjacency matrix (NAM), where each row is normalized to be non-negative and to sum to one, matching the support of Dirichlet distribution. This requirement presents two main technical challenges: 1) intractable Kullback-Leibler (KL) divergence optimization between Dirichlet distributions, and 2) constrained optimization for standard-gradient-descent-based neural network parameter optimization. To handle issue 1), we first formulate the inference of the NAM as a differential equation simulation problem and derive an easy-to-implement expression to iteratively improve the KL divergence without explicitly computing it. Based on this, to alleviate issue 2), we involve Riemannian optimization to precondition this simulation procedure, which ensures that the inferred NAM conforms to the row-normalization constraint. After that, we collectively designate these approaches for NAM inference as Preconditioned-Simulation-Induced Variational Inference ($\psi$ -VI), and provide theoretical guarantees of convergence. On this foundation, we propose a new graph neural network architecture, the Preconditioned-Simulation-Induced-based Variational Graph Neural Network ($\psi$ -VGNN) for industrial process modeling. Finally, we validate the efficacy of$\psi$ -VGNN through comprehensive experiments on industrial modeling tasks.- 13 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (1) , 82-95
Blending Data and Knowledge for Process Industrial Modeling Under Riemannian Preconditioned Bayesian Framework
Integrating graph neural networks (GNNs) with variational inference (VI) provides a promising direction for blending structured prior knowledge with observational empirical data for data-driven industrial process modeling. However, this task requires inference of the normalized adjacency matrix (NAM), where each row is normalized to be non-negative and to sum to one, matching the support of Dirichlet distribution. This requirement presents two main technical challenges: 1) intractable Kullback-Leibler (KL) divergence optimization between Dirichlet distributions, and 2) constrained optimization for standard-gradient-descent-based neural network parameter optimization. To handle issue 1), we first formulate the inference of the NAM as a differential equation simulation problem and derive an easy-to-implement expression to iteratively improve the KL divergence without explicitly computing it. Based on this, to alleviate issue 2), we involve Riemannian optimization to precondition this simulation procedure, which ensures that the inferred NAM conforms to the row-normalization constraint. After that, we collectively designate these approaches for NAM inference as Preconditioned-Simulation-Induced Variational Inference ($\psi$ -VI), and provide theoretical guarantees of convergence. On this foundation, we propose a new graph neural network architecture, the Preconditioned-Simulation-Induced-based Variational Graph Neural Network ($\psi$ -VGNN) for industrial process modeling. Finally, we validate the efficacy of$\psi$ -VGNN through comprehensive experiments on industrial modeling tasks.- Open Access
- 11 September 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 43 (6) , 1-24
Debiased Recommendation via Wasserstein Causal Balancing
Recommendation systems are pivotal in improving user experience on various digital platforms. However, observational training data in recommendation systems introduce selection bias, which leads to a distributional discrepancy between training data and real-world scenarios, resulting in suboptimal performance. Current causal debiasing methods such as inverse propensity score and doubly robust rely on accurately estimated propensity scores, typically optimized through negative log-likelihood (NLL) minimization. However, recent studies have highlighted the limitations of this approach, as perfect NLL minimization may not adequately correct for selection bias. To address this issue, we propose Wasserstein Balancing Metric (WBM), a novel metric that measures and enhances the balancing capacity of propensity scores in causal debiasing methods by minimizing the Wasserstein discrepancy between reweighted populations. On the basis, we introduce IPS-WBM and DR-WBM, incorporating WBM as a regularizer in standard inverse propensity score and doubly robust estimators, which enhances causal balancing capacity without introducing additional bias. Extensive experiments on three real-world recommendation datasets demonstrate that our methods improve the causal balancing capability of learned propensities and enhance debiasing performance.
- 11 September 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 43 (6) , 1-24
Open AccessDebiased Recommendation via Wasserstein Causal Balancing
Recommendation systems are pivotal in improving user experience on various digital platforms. However, observational training data in recommendation systems introduce selection bias, which leads to a distributional discrepancy between training data and real-world scenarios, resulting in suboptimal performance. Current causal debiasing methods such as inverse propensity score and doubly robust rely on accurately estimated propensity scores, typically optimized through negative log-likelihood (NLL) minimization. However, recent studies have highlighted the limitations of this approach, as perfect NLL minimization may not adequately correct for selection bias. To address this issue, we propose Wasserstein Balancing Metric (WBM), a novel metric that measures and enhances the balancing capacity of propensity scores in causal debiasing methods by minimizing the Wasserstein discrepancy between reweighted populations. On the basis, we introduce IPS-WBM and DR-WBM, incorporating WBM as a regularizer in standard inverse propensity score and doubly robust estimators, which enhances causal balancing capacity without introducing additional bias. Extensive experiments on three real-world recommendation datasets demonstrate that our methods improve the causal balancing capability of learned propensities and enhance debiasing performance.