Chenyang Zhu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Chenyang Zhu has a total of 109 co-authors. Here are the top co-authors by number of shared publications:
- Yunxin Xie
School of Computer Science and Artificial Intelligence, Changzhou University, Changzhou 213164, China
10 shared publications Zhengwei Zhu
School of Electrical and Electronic Engineering, Anhui Institute of Information Technology, Wuhu, China
9 shared publications- Yanping Zhu
School of Wang Zheng Microelectronics, Changzhou University, Changzhou 213159, China
8 shared publications Fang Wang
Brunel University London, London, United Kingdom
7 shared publicationsWeibin Luo
School of Computer Science and Artificial Intelligence, Changzhou University, Changzhou, China
6 shared publicationsYunxin Xie
Changzhou University, Changzhou, CHINA
6 shared publications
Latest Publications
- 28 October 2026
- Published by Springer Nature in Earth Science Informatics
- Vol. 19  (12) , 232
Multi-view extinction-guided thin-edge segmentation for petrographic thin sections
- 28 October 2026
- Published by Springer Nature in Earth Science Informatics
- Vol. 19  (12) , 232
Multi-view extinction-guided thin-edge segmentation for petrographic thin sections
- Open Access
- 18 October 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16  (20) , 10311
Multimodal Interaction and Residual Fusion for Cross-Well Acoustic-Impedance Reconstruction
Cross-well acoustic-impedance reconstruction combines seismic observations with retained auxiliary logs whose relationships change between wells. We introduce Multimodal Interaction and Residual Fusion (MIRF), which expresses multimodal fusion as an additive correction to a source-supervised seismic estimate. Three residual heads propose updates, a conditional router determines their composition, and an admission coefficient controls the applied magnitude. Separate anchor supervision retains a seismic reference for examining the effect of auxiliary-log correction. Using the original processed-log protocol on Penobscot L-30 to B-41 transfer, ten matched seeds reduce mean root mean squared error (RMSE) from 1905.5 to 1489.6 and mean absolute error from 1659.5 to 1178.4 relative to the standalone seismic CNN. MIRF also has the lowest mean RMSE among four matched neural fusion alternatives in this direction. Bidirectional comparisons, ablations, and depth-resolved profiles locate the benefits in reduced broad reconstruction bias and show how component effects change with transfer direction.- 18 October 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16  (20) , 10311
Open AccessMultimodal Interaction and Residual Fusion for Cross-Well Acoustic-Impedance Reconstruction
Cross-well acoustic-impedance reconstruction combines seismic observations with retained auxiliary logs whose relationships change between wells. We introduce Multimodal Interaction and Residual Fusion (MIRF), which expresses multimodal fusion as an additive correction to a source-supervised seismic estimate. Three residual heads propose updates, a conditional router determines their composition, and an admission coefficient controls the applied magnitude. Separate anchor supervision retains a seismic reference for examining the effect of auxiliary-log correction. Using the original processed-log protocol on Penobscot L-30 to B-41 transfer, ten matched seeds reduce mean root mean squared error (RMSE) from 1905.5 to 1489.6 and mean absolute error from 1659.5 to 1178.4 relative to the standalone seismic CNN. MIRF also has the lowest mean RMSE among four matched neural fusion alternatives in this direction. Bidirectional comparisons, ablations, and depth-resolved profiles locate the benefits in reduced broad reconstruction bias and show how component effects change with transfer direction. - Open Access
- 9 October 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16  (20) , 9977
Frozen Seismic Foundation Features and Well Log Fusion for Fluid Migration Favorability Ranking
Fluid migration screening requires the integration of seismic structure and well log response. This study develops a multimodal framework for ranking an attribute-derived fluid migration favorability proxy from paired local seismic patches and well log windows in the F3 survey. The framework couples frozen seismic foundation model (SFM) features with a trainable well log token encoder and evaluates pooled concatenation, cross attention, and learned query fusion for multimodal integration. Under sample-stratified evaluation across three random seeds, frozen SFM features with learned query fusion achieved the highest observed normalized discounted cumulative gain at rank 20 (nDCG@20) of 85.15%, exceeding the best single-modality baseline by 3.95 percentage points. The results support combining pretrained seismic representations with well log evidence to prioritize intervals in the F3 benchmark.
- 9 October 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16  (20) , 9977
Open AccessFrozen Seismic Foundation Features and Well Log Fusion for Fluid Migration Favorability Ranking
Fluid migration screening requires the integration of seismic structure and well log response. This study develops a multimodal framework for ranking an attribute-derived fluid migration favorability proxy from paired local seismic patches and well log windows in the F3 survey. The framework couples frozen seismic foundation model (SFM) features with a trainable well log token encoder and evaluates pooled concatenation, cross attention, and learned query fusion for multimodal integration. Under sample-stratified evaluation across three random seeds, frozen SFM features with learned query fusion achieved the highest observed normalized discounted cumulative gain at rank 20 (nDCG@20) of 85.15%, exceeding the best single-modality baseline by 3.95 percentage points. The results support combining pretrained seismic representations with well log evidence to prioritize intervals in the F3 benchmark.
- Open Access
- 3 September 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16  (17) , 8758
Controlled Performance Decomposition of Seismic–Log Representations for Reservoir Sweet Spot Screening
Reservoir sweet spot screening combines seismic and well-log observations, but an observed gain may depend on the input representation, validation protocol, and construction of the screening target. We implement a controlled performance-decomposition protocol for paired observations from the public F3 Block. The protocol formalizes matched nested comparisons among log-only, basic seismic–log, and directional-gradient seismic–log representations. Within each contrast, the outer test observations, metric, model family, and validation-only selection rule remain fixed. For the composite target, basic fusion increases mean area under the receiver operating characteristic curve (AUROC) by 6.5, 8.8, and 3.4 percentage points for logistic regression, random forest, and gradient boosting, respectively. Directional-gradient enrichment changes AUROC by −5.6, +1.5, and −2.8 percentage points in the same model order. Spatial-block AUROC ranges from 49.4% to 57.8%, while leave-one-well-out AUROC ranges from 42.9% to 53.9%. The corresponding basic-fusion contrasts are −8.5 and +2.2 percentage points. A target-overlap audit shows that the measured fusion gain depends on target construction and directly corresponding log channels. Together, these controlled comparisons quantify how representation design, target construction, and validation protocol shape reported reservoir-screening performance.
- 3 September 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16  (17) , 8758
Open AccessControlled Performance Decomposition of Seismic–Log Representations for Reservoir Sweet Spot Screening
Reservoir sweet spot screening combines seismic and well-log observations, but an observed gain may depend on the input representation, validation protocol, and construction of the screening target. We implement a controlled performance-decomposition protocol for paired observations from the public F3 Block. The protocol formalizes matched nested comparisons among log-only, basic seismic–log, and directional-gradient seismic–log representations. Within each contrast, the outer test observations, metric, model family, and validation-only selection rule remain fixed. For the composite target, basic fusion increases mean area under the receiver operating characteristic curve (AUROC) by 6.5, 8.8, and 3.4 percentage points for logistic regression, random forest, and gradient boosting, respectively. Directional-gradient enrichment changes AUROC by −5.6, +1.5, and −2.8 percentage points in the same model order. Spatial-block AUROC ranges from 49.4% to 57.8%, while leave-one-well-out AUROC ranges from 42.9% to 53.9%. The corresponding basic-fusion contrasts are −8.5 and +2.2 percentage points. A target-overlap audit shows that the measured fusion gain depends on target construction and directly corresponding log channels. Together, these controlled comparisons quantify how representation design, target construction, and validation protocol shape reported reservoir-screening performance.
- Open Access
Multi-Physics Monotone Score Transport for Unsupervised Domain Adaptation of Continuous Tool Wear Prediction
Cross-material continuous tool wear prediction is difficult because a model must preserve the physical wear scale, not only align high-dimensional sensor features. This limitation is critical in milling, where the target variable is the continuous flank wear width () and material shift can distort the mapping from sensor response to wear magnitude. We address this problem by recasting cross-domain tool wear prediction as monotone wear-scale adaptation. We propose Multi-Physics Monotone Score Transport (MPMST), a monotone score transport framework that constructs a tool-wear-oriented score from sensor-derived candidate cues, transports the target-domain score onto the source-domain wear scale, and then predicts wear through isotonic regression. We also evaluate One-Physics Monotone Score Transport (OPMST), a force-only variant that uses the same score-transport pipeline with a restricted cue family. On Mondragon Unibertsitatea–Tool Condition Monitoring (MU-TCM) with two cross-material transfer tasks, the validation-driven MPMST configuration reduces mean absolute error by approximately 63% relative to Correlation Alignment (CORAL) and by approximately 31% relative to a physics-informed Gaussian process baseline. The results support monotone score construction and score transport as practical mechanisms for continuous tool wear prediction under domain shift, while also showing that MU-TCM is strongly force dominated.Open AccessMulti-Physics Monotone Score Transport for Unsupervised Domain Adaptation of Continuous Tool Wear Prediction
Cross-material continuous tool wear prediction is difficult because a model must preserve the physical wear scale, not only align high-dimensional sensor features. This limitation is critical in milling, where the target variable is the continuous flank wear width () and material shift can distort the mapping from sensor response to wear magnitude. We address this problem by recasting cross-domain tool wear prediction as monotone wear-scale adaptation. We propose Multi-Physics Monotone Score Transport (MPMST), a monotone score transport framework that constructs a tool-wear-oriented score from sensor-derived candidate cues, transports the target-domain score onto the source-domain wear scale, and then predicts wear through isotonic regression. We also evaluate One-Physics Monotone Score Transport (OPMST), a force-only variant that uses the same score-transport pipeline with a restricted cue family. On Mondragon Unibertsitatea–Tool Condition Monitoring (MU-TCM) with two cross-material transfer tasks, the validation-driven MPMST configuration reduces mean absolute error by approximately 63% relative to Correlation Alignment (CORAL) and by approximately 31% relative to a physics-informed Gaussian process baseline. The results support monotone score construction and score transport as practical mechanisms for continuous tool wear prediction under domain shift, while also showing that MU-TCM is strongly force dominated. - Open Access
- 27 May 2026
- Published by Springer Nature in Scientific Reports
- Vol. 16  (1)
Noise-robust reward machine induction via probabilistic modeling and genetic local search
Reinforcement learning (RL) in partially observable and noisy environments remains a central challenge because of the difficulty in inferring latent structures, managing label uncertainty, and ensuring robust policy optimization. Reward Machines (RMs) offer a structured formalism for representing non-Markovian rewards through symbolic automata, but existing methods exhibit fragility under stochastic observations. To address this limitation, we introduce Probabilistic Induction with Genetic Local Search (PI-GLS), a unified framework that integrates probabilistic perception, inductive logic programming, and evolutionary optimization. PI-GLS achieves noise-robust RM induction by combining Bayesian inference for uncertain labels, sampling-based symbolic abstraction, and genetic local refinement of automaton structures. In addition, we propose a belief-aware reward shaping strategy that leverages distributions over RM states to guide policy learning under uncertainty. Extensive experiments on benchmark domains show that PI-GLS substantially improves convergence efficiency, robustness to sensor noise, and interpretability of learned reward models, achieving performance on par with manually engineered RMs even under severe noise. These results demonstrate the scalability and effectiveness of PI-GLS for autonomous decision-making in real-world scenarios where stochastic feedback and partial observability are unavoidable.
- 27 May 2026
- Published by Springer Nature in Scientific Reports
- Vol. 16  (1)
Open AccessNoise-robust reward machine induction via probabilistic modeling and genetic local search
Reinforcement learning (RL) in partially observable and noisy environments remains a central challenge because of the difficulty in inferring latent structures, managing label uncertainty, and ensuring robust policy optimization. Reward Machines (RMs) offer a structured formalism for representing non-Markovian rewards through symbolic automata, but existing methods exhibit fragility under stochastic observations. To address this limitation, we introduce Probabilistic Induction with Genetic Local Search (PI-GLS), a unified framework that integrates probabilistic perception, inductive logic programming, and evolutionary optimization. PI-GLS achieves noise-robust RM induction by combining Bayesian inference for uncertain labels, sampling-based symbolic abstraction, and genetic local refinement of automaton structures. In addition, we propose a belief-aware reward shaping strategy that leverages distributions over RM states to guide policy learning under uncertainty. Extensive experiments on benchmark domains show that PI-GLS substantially improves convergence efficiency, robustness to sensor noise, and interpretability of learned reward models, achieving performance on par with manually engineered RMs even under severe noise. These results demonstrate the scalability and effectiveness of PI-GLS for autonomous decision-making in real-world scenarios where stochastic feedback and partial observability are unavoidable.
- 2 April 2026
- Published by Springer Nature in Mathematical Geosciences
- Vol. 58  (7) , 2145-2170
HLF-SASR: A High–Low Frequency Guided Structure-Aware Super-Resolution Network for Digital Rock Images
- 2 April 2026
- Published by Springer Nature in Mathematical Geosciences
- Vol. 58  (7) , 2145-2170
HLF-SASR: A High–Low Frequency Guided Structure-Aware Super-Resolution Network for Digital Rock Images
- Open Access
- 11 March 2026
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 38  (1) , 1-31
Enhancing Context Awareness with Model Checking-based Uncertainty Representation in Decision Support Systems
Safety-critical decision-making often necessitates operating within complex and uncertain environments, typically characterized as partially-observable Multi-Agent Systems (MAS). Effective decision-making in these settings demands a profound understanding of the environment and accurate representation and quantification of epistemic uncertainty due to informational deficits. This uncertainty representation must reflect prior knowledge and dynamically integrate observational data. While Version Space Learning (VSL) offers a framework for set-based uncertainty representation, prior methods often depend on under-approximation of the actual version space, which falls short in safety-critical applications. We introduce a model checking-based VSL framework to enhance uncertainty representation and context-awareness in such applications. Our approach employs network of timed automata (NTA) to model the MAS environment, capturing its mechanisms and prior knowledge efficiently. The inherent non-determinism of timed automata facilitates an over-approximation of the actual version space, ensuring all plausible hypotheses are considered. We further refine the parameter ranges of the NTA using proof traces, optimizing the use of observational data. In a medical diagnosis case study, our framework identified a missing rule in a traditional rule-based system and provided interpretable and scalable results, demonstrating our method’s ability to improve decision-making accuracy and manage complex scenarios effectively.
- 11 March 2026
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 38  (1) , 1-31
Open AccessEnhancing Context Awareness with Model Checking-based Uncertainty Representation in Decision Support Systems
Safety-critical decision-making often necessitates operating within complex and uncertain environments, typically characterized as partially-observable Multi-Agent Systems (MAS). Effective decision-making in these settings demands a profound understanding of the environment and accurate representation and quantification of epistemic uncertainty due to informational deficits. This uncertainty representation must reflect prior knowledge and dynamically integrate observational data. While Version Space Learning (VSL) offers a framework for set-based uncertainty representation, prior methods often depend on under-approximation of the actual version space, which falls short in safety-critical applications. We introduce a model checking-based VSL framework to enhance uncertainty representation and context-awareness in such applications. Our approach employs network of timed automata (NTA) to model the MAS environment, capturing its mechanisms and prior knowledge efficiently. The inherent non-determinism of timed automata facilitates an over-approximation of the actual version space, ensuring all plausible hypotheses are considered. We further refine the parameter ranges of the NTA using proof traces, optimizing the use of observational data. In a medical diagnosis case study, our framework identified a missing rule in a traditional rule-based system and provided interpretable and scalable results, demonstrating our method’s ability to improve decision-making accuracy and manage complex scenarios effectively.
- 9 February 2026
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 169
Optimizing potential-based reward automata in partially observable reinforcement learning using genetic local search
- 9 February 2026
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 169
Optimizing potential-based reward automata in partially observable reinforcement learning using genetic local search