Yutang Xiao
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
Research Subjects
Yutang Xiao has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Boyu Wang
Department of Computer Science, Western University, London, ON, Canada
6 shared publications Chaofan Shen
4 shared publications- Jian Zhu
School of Computer Science and Technology, Guangdong University of Technology (GDUT), Guangzhou, China
4 shared publications Xiaoyong Zhu
4 shared publications- Bing Song
Key Laboratory of Advanced Control and Optimization for Chemical Processes, East China University of Science and Technology, Shanghai 200237, China
3 shared publications - Hongbo Shi
Key Laboratory of Smart Manufacturing in Energy Chemical Process of the Ministry of Education East China University of Science and Technology Shanghai China
3 shared publications
Latest Publications
- 25 August 2026
- Published by Elsevier in Journal of Energy Storage
- Vol. 180
Uncertainty dual-model adaptation for state of health estimation of retired lithium-ion batteries
- 25 August 2026
- Published by Elsevier in Journal of Energy Storage
- Vol. 180
Uncertainty dual-model adaptation for state of health estimation of retired lithium-ion batteries
- Open Access
- 5 May 2026
- Published by Elsevier in SSRN Electronic Journal
Physics-Guided Semantic Source Free Adaptation for Fast-Charging Batteries Degradation Prognosis
As market demand for fast-charging grows to alleviate range anxiety, prognosing battery degradation under high-rate charging protocols becomes crucial for reliable operation. However, diverse fast-charging protocols induce varying internal polarization, causing data distribution shifts that fail standard prognosis models. While domain adaptation (DA) mitigates this issue, transmitting massive standard datasets incurs high communication and storage costs. To overcome these limitations, this work formulates degradation prognosis as a source-free DA problem and propose a physics-guided semantic source-free adaptation (PS2FA) algorithm. PS2FA adapts the network using only a pretrained source model (i.e, the standard prognosis model) and unlabeled target data (i.e., fast-charging data), thus eliminating the need for the transmission of source data. Specifically, a rate-conditioned autoencoder projects target features into the source latent space to bridge distribution gaps. Furthermore, a physical and statistical alignment mechanism further confines predictions within valid physical boundaries. Validated on MIT-Stanford and 15-minute fast charging datasets, PS2FA reduces training data number by 80% and decreases prediction RMSE% by up to 52% under complex protocols, demonstrating highly efficient and reliable battery health management.
- 5 May 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessPhysics-Guided Semantic Source Free Adaptation for Fast-Charging Batteries Degradation Prognosis
As market demand for fast-charging grows to alleviate range anxiety, prognosing battery degradation under high-rate charging protocols becomes crucial for reliable operation. However, diverse fast-charging protocols induce varying internal polarization, causing data distribution shifts that fail standard prognosis models. While domain adaptation (DA) mitigates this issue, transmitting massive standard datasets incurs high communication and storage costs. To overcome these limitations, this work formulates degradation prognosis as a source-free DA problem and propose a physics-guided semantic source-free adaptation (PS2FA) algorithm. PS2FA adapts the network using only a pretrained source model (i.e, the standard prognosis model) and unlabeled target data (i.e., fast-charging data), thus eliminating the need for the transmission of source data. Specifically, a rate-conditioned autoencoder projects target features into the source latent space to bridge distribution gaps. Furthermore, a physical and statistical alignment mechanism further confines predictions within valid physical boundaries. Validated on MIT-Stanford and 15-minute fast charging datasets, PS2FA reduces training data number by 80% and decreases prediction RMSE% by up to 52% under complex protocols, demonstrating highly efficient and reliable battery health management.
- 28 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 23 (15455955) , 8762-8775
Test-Time Domain Adaptation With Time-Frequency Consistency and Instance-Aware Batch Renormalization for Online Machinery Fault Diagnosis
In recent years, Source-Free Domain Adaptation (SFDA) has gained significant attention in the field of cross-domain fault diagnosis, as it effectively addresses domain discrepancies while preserving the privacy of sensitive industrial data. However, existing SFDA methods typically rely on offline adaptation using unlabeled target domain mechanical data and struggle to fully leverage domain-invariant information in time-series data, posing challenges for real-time cross-domain fault diagnosis. To address these issues, we propose a Time-Frequency Consistency-guided Test-time Domain Adaptation (TFCTA) method. Specifically, we propose a novel Time-Frequency Consistency (TFC) strategy that leverages the frequency domain to extract cross-domain invariant features, thereby more effectively guide the adaptation process in the temporal domain. For test-time adaptation, we design a set of Instance-aware Batch Renormalization (IBR) layers to replace conventional batch normalization layers. First, we employ Batch Renormalization (BR) to normalize features using cross-batch statistics from the target domain, effectively mitigating data distribution shifts during testing. Second, we propose a Distance-based Instance Weighting (DIW) strategy to emphasize representative instances through by assigning higher weights, thus improving the reliability of the statistical computation process. Extensive experiments on multiple public datasets demonstrate that TFCTA significantly improves online cross-domain diagnostic accuracy and outperforms existing test-time adaptation methods, highlighting its potential for practical fault diagnosis applications. Note to Practitioners—In real-world industrial processes, data distribution shifts caused by varying operating conditions (academically referred to as domain shifts or discrepancies) can degrade the performance of fault diagnostic models. Furthermore, the need to protect sensitive industrial data and provide real-time diagnostic results poses significant challenges for cross-domain fault diagnosis. This paper proposes a Time-Frequency Consistency-guided Test-time Domain Adaptation (TFCTA) method to address these issues. The proposed TFC strategy in TFCTA fully leverages domain-invariant information from the frequency domain to better guide the adaptation process in the temporal domain, allowing TFCTA to maintain high robustness even under varying operating conditions. TFCTA only utilizes source data during the source model training phase, and in the adaptation phase, it only requires the pre-trained source model, which helps protect sensitive industrial data. Through the proposed IBR layers, TFCTA can fine-tune the model in real-time based on the input data, providing accurate and reliable fault diagnosis results. As a result, TFCTA is well-suited for cross-domain fault diagnosis in advanced manufacturing, where both data privacy and online diagnostic capabilities are critical.
- 28 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 23 (15455955) , 8762-8775
Test-Time Domain Adaptation With Time-Frequency Consistency and Instance-Aware Batch Renormalization for Online Machinery Fault Diagnosis
In recent years, Source-Free Domain Adaptation (SFDA) has gained significant attention in the field of cross-domain fault diagnosis, as it effectively addresses domain discrepancies while preserving the privacy of sensitive industrial data. However, existing SFDA methods typically rely on offline adaptation using unlabeled target domain mechanical data and struggle to fully leverage domain-invariant information in time-series data, posing challenges for real-time cross-domain fault diagnosis. To address these issues, we propose a Time-Frequency Consistency-guided Test-time Domain Adaptation (TFCTA) method. Specifically, we propose a novel Time-Frequency Consistency (TFC) strategy that leverages the frequency domain to extract cross-domain invariant features, thereby more effectively guide the adaptation process in the temporal domain. For test-time adaptation, we design a set of Instance-aware Batch Renormalization (IBR) layers to replace conventional batch normalization layers. First, we employ Batch Renormalization (BR) to normalize features using cross-batch statistics from the target domain, effectively mitigating data distribution shifts during testing. Second, we propose a Distance-based Instance Weighting (DIW) strategy to emphasize representative instances through by assigning higher weights, thus improving the reliability of the statistical computation process. Extensive experiments on multiple public datasets demonstrate that TFCTA significantly improves online cross-domain diagnostic accuracy and outperforms existing test-time adaptation methods, highlighting its potential for practical fault diagnosis applications. Note to Practitioners—In real-world industrial processes, data distribution shifts caused by varying operating conditions (academically referred to as domain shifts or discrepancies) can degrade the performance of fault diagnostic models. Furthermore, the need to protect sensitive industrial data and provide real-time diagnostic results poses significant challenges for cross-domain fault diagnosis. This paper proposes a Time-Frequency Consistency-guided Test-time Domain Adaptation (TFCTA) method to address these issues. The proposed TFC strategy in TFCTA fully leverages domain-invariant information from the frequency domain to better guide the adaptation process in the temporal domain, allowing TFCTA to maintain high robustness even under varying operating conditions. TFCTA only utilizes source data during the source model training phase, and in the adaptation phase, it only requires the pre-trained source model, which helps protect sensitive industrial data. Through the proposed IBR layers, TFCTA can fine-tune the model in real-time based on the input data, providing accurate and reliable fault diagnosis results. As a result, TFCTA is well-suited for cross-domain fault diagnosis in advanced manufacturing, where both data privacy and online diagnostic capabilities are critical.
- Open Access
- 24 April 2026
- Published by Elsevier in SSRN Electronic Journal
Physics-Guided Semantic Source Free Adaptation for Fast-Charging Batteries Degradation Prognosis
As market demand for fast-charging grows to alleviate range anxiety, prognosing battery degradation under high-rate charging protocols becomes crucial for reliable operation. However, diverse fast-charging protocols induce varying internal polarization, causing data distribution shifts that fail standard prognosis models. While domain adaptation (DA) mitigates this issue, transmitting massive standard datasets incurs high communication and storage costs. To overcome these limitations, this work formulates degradation prognosis as a source-free DA problem and propose a physics-guided semantic source-free adaptation (PS2FA) algorithm. PS2FA adapts the network using only a pretrained source model (i.e, the standard prognosis model) and unlabeled target data (i.e., fast-charging data), thus eliminating the need for the transmission of source data. Specifically, a rate-conditioned autoencoder projects target features into the source latent space to bridge distribution gaps. Furthermore, a physical and statistical alignment mechanism further confines predictions within valid physical boundaries. Validated on MIT-Stanford and 15-minute fast charging datasets, PS2FA reduces training data number by 80% and decreases prediction RMSE% by up to 52% under complex protocols, demonstrating highly efficient and reliable battery health management.
- 24 April 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessPhysics-Guided Semantic Source Free Adaptation for Fast-Charging Batteries Degradation Prognosis
As market demand for fast-charging grows to alleviate range anxiety, prognosing battery degradation under high-rate charging protocols becomes crucial for reliable operation. However, diverse fast-charging protocols induce varying internal polarization, causing data distribution shifts that fail standard prognosis models. While domain adaptation (DA) mitigates this issue, transmitting massive standard datasets incurs high communication and storage costs. To overcome these limitations, this work formulates degradation prognosis as a source-free DA problem and propose a physics-guided semantic source-free adaptation (PS2FA) algorithm. PS2FA adapts the network using only a pretrained source model (i.e, the standard prognosis model) and unlabeled target data (i.e., fast-charging data), thus eliminating the need for the transmission of source data. Specifically, a rate-conditioned autoencoder projects target features into the source latent space to bridge distribution gaps. Furthermore, a physical and statistical alignment mechanism further confines predictions within valid physical boundaries. Validated on MIT-Stanford and 15-minute fast charging datasets, PS2FA reduces training data number by 80% and decreases prediction RMSE% by up to 52% under complex protocols, demonstrating highly efficient and reliable battery health management.
- Open Access
- 22 April 2026
- Published by Elsevier in SSRN Electronic Journal
Uncertainty Dual-Model Adaptation for State of Health Estimation of Retired Lithium-Ion Batteries
As the second-life reuse of retired batteries grows, accurate state of health (SOH) estimation becomes crucial for reliable stationary storage operation. However, diverse first-life conditions induce varying aging trajectories that cause conventional models to fail, while acquiring true SOH labels to retrain them incurs prohibitive time and economic costs. Although domain adaptation (DA) alleviates this issue, this technique often suppresses the degradation characteristic of the target retired battery and leads to dangerous SOH overestimation. To overcome these limitations, this work proposes a novel uncertainty dual-model adaptation (UDMA) framework for robust, label-free SOH estimation. Specifically, a dual-model collaborative network is designed to reserve the specific degradation feature of the target retired battery. Furthermore, UDMA develops a transferability-guided strategy to selectively give priority to those samples that contain more battery degradation information, based on the estimated uncertainty. Validated on diverse retired battery datasets, UDMA significantly reduces estimation bias. The proposed framework outperforms state-of-the-art methods, demonstrating highly efficient and safe second-life battery health management.
- 22 April 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessUncertainty Dual-Model Adaptation for State of Health Estimation of Retired Lithium-Ion Batteries
As the second-life reuse of retired batteries grows, accurate state of health (SOH) estimation becomes crucial for reliable stationary storage operation. However, diverse first-life conditions induce varying aging trajectories that cause conventional models to fail, while acquiring true SOH labels to retrain them incurs prohibitive time and economic costs. Although domain adaptation (DA) alleviates this issue, this technique often suppresses the degradation characteristic of the target retired battery and leads to dangerous SOH overestimation. To overcome these limitations, this work proposes a novel uncertainty dual-model adaptation (UDMA) framework for robust, label-free SOH estimation. Specifically, a dual-model collaborative network is designed to reserve the specific degradation feature of the target retired battery. Furthermore, UDMA develops a transferability-guided strategy to selectively give priority to those samples that contain more battery degradation information, based on the estimated uncertainty. Validated on diverse retired battery datasets, UDMA significantly reduces estimation bias. The proposed framework outperforms state-of-the-art methods, demonstrating highly efficient and safe second-life battery health management.
- 18 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Instrumentation and Measurement
- Vol. 74 (00189456) , 1-14
Dual-Contrastive Multiview Graph Attention Network for Industrial Fault Diagnosis Under Domain and Label Shift
Recently, domain generalization (DG) methods have been actively researched for complex industrial fault diagnosis, which aims to learn generalized representations from historical working conditions to build a diagnosis model that can perform well on unseen working conditions. However, these methods ignore the interactions between monitoring variables, which may fail to learn feature representation with topological structure in non-Eudidean space. In addition, these methods assume the same label distribution across historical and unseen working conditions, which is generally challenging in practice, as the probability of faults varies across different working conditions. This label shift problem can negatively impact the generalization performance. To address these issues, a novel dual-contrastive multi-view graph attention network (DMGAT) is proposed in this article. Specifically, a multi-view graph attention network is designed to explore the intrinsic topological structure of the data, which learns an optimal graph structure that best serves DG by integrating both graph learning and graph convolution in a unified network architecture. In addition, a novel dual-weighted contrastive learning strategy is developed. Intra-domain contrastive learning facilitates the extraction of expressive node features, while inter-domain contrastive learning simultaneously considers the alignment and separation of semantic probability distributions to extract shared feature representations for multiple source domains under both domain and label shift. Furthermore, a label sampling probability is used to weight the inter-domain contrastive loss and the source domain classification loss, to encourage the model to learn from minor classes in fault diagnosis. Experiments on two cases demonstrate the superiority of the proposed method.
- 18 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Instrumentation and Measurement
- Vol. 74 (00189456) , 1-14
Dual-Contrastive Multiview Graph Attention Network for Industrial Fault Diagnosis Under Domain and Label Shift
Recently, domain generalization (DG) methods have been actively researched for complex industrial fault diagnosis, which aims to learn generalized representations from historical working conditions to build a diagnosis model that can perform well on unseen working conditions. However, these methods ignore the interactions between monitoring variables, which may fail to learn feature representation with topological structure in non-Eudidean space. In addition, these methods assume the same label distribution across historical and unseen working conditions, which is generally challenging in practice, as the probability of faults varies across different working conditions. This label shift problem can negatively impact the generalization performance. To address these issues, a novel dual-contrastive multi-view graph attention network (DMGAT) is proposed in this article. Specifically, a multi-view graph attention network is designed to explore the intrinsic topological structure of the data, which learns an optimal graph structure that best serves DG by integrating both graph learning and graph convolution in a unified network architecture. In addition, a novel dual-weighted contrastive learning strategy is developed. Intra-domain contrastive learning facilitates the extraction of expressive node features, while inter-domain contrastive learning simultaneously considers the alignment and separation of semantic probability distributions to extract shared feature representations for multiple source domains under both domain and label shift. Furthermore, a label sampling probability is used to weight the inter-domain contrastive loss and the source domain classification loss, to encourage the model to learn from minor classes in fault diagnosis. Experiments on two cases demonstrate the superiority of the proposed method.
- 12 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 36 (12) , 9235-9248
Securing Multi-Source Domain Adaptation With Global and Domain-Wise Privacy Demands
Making available a large size of training data for deep learning models and preserving data privacy are two ever-growing concerns in the machine learning community. Multi-source domain adaptation (MDA) leverages the data information from different domains and aggregates them to improve the performance in the target task, while the privacy leakage risk of publishing models under malicious attacker for membership or attribute inference is even more complicated than the one faced by single-source domain adaptation. In this paper, we tackle the problem of effectively protecting data privacy while training and aggregating multi-source information, where each source domain enjoys an independent privacy budget. Specifically, we develop a differentially private MDA (DPMDA) algorithm to provide domain-wise privacy protection with adaptive weighting scheme based on task similarity and task-specific privacy budget. We evaluate our algorithm on three benchmark tasks and show that DPMDA can effectively leverage different private budgets from source domains and consistently outperforms the existing private baselines with a reasonable gap with non-private state-of-the-art.
- 12 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 36 (12) , 9235-9248
Securing Multi-Source Domain Adaptation With Global and Domain-Wise Privacy Demands
Making available a large size of training data for deep learning models and preserving data privacy are two ever-growing concerns in the machine learning community. Multi-source domain adaptation (MDA) leverages the data information from different domains and aggregates them to improve the performance in the target task, while the privacy leakage risk of publishing models under malicious attacker for membership or attribute inference is even more complicated than the one faced by single-source domain adaptation. In this paper, we tackle the problem of effectively protecting data privacy while training and aggregating multi-source information, where each source domain enjoys an independent privacy budget. Specifically, we develop a differentially private MDA (DPMDA) algorithm to provide domain-wise privacy protection with adaptive weighting scheme based on task similarity and task-specific privacy budget. We evaluate our algorithm on three benchmark tasks and show that DPMDA can effectively leverage different private budgets from source domains and consistently outperforms the existing private baselines with a reasonable gap with non-private state-of-the-art.
- 26 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 54 (6) , 3891-3904
Clustering Environment Aware Learning for Active Domain Adaptation
Despite the significant progress in unsupervised domain adaptation (UDA), the performance of UDA methods is still far inferior to that of the fully supervised ones. In practical scenarios, it is usually feasible to acquire labels on a small portion of the target data through active learning (AL), which aims to train an effective model with as few queried instances as possible. However, due to the domain shift, the instances selected by existing AL algorithms can be uninformative, redundant, or outlying. To address this issue, we propose a novel approach, namely, clustering environment-aware learning (CEAL), for active domain adaptation (ADA). CEAL selects potentially the most valuable instances under domain shift by exploring the informativeness and representativeness of target samples in a clustering environment-aware manner. Specifically, for the informativeness, we not only leverage the knowledge of individual points but also their nearby neighbors, by measuring the proposed clustering environment aware informativeness score (CEAIS), thus ensuring that the selected samples are highly informative. For the representativeness, we design two schemes called point distance release (PDR) and informativeness score difference exclusion (ISDE) to guarantee the diversity and validity of the selected samples. Furthermore, we fully utilize the large amount of unlabeled data from target domain via pseudo labeling and adopt information maximization to improve the reliability of the target pseudo labels, thereby further improving the performance of the model. The effectiveness of our method is empirically verified on various benchmark datasets against recent state-of-the-art algorithms.
- 26 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 54 (6) , 3891-3904
Clustering Environment Aware Learning for Active Domain Adaptation
Despite the significant progress in unsupervised domain adaptation (UDA), the performance of UDA methods is still far inferior to that of the fully supervised ones. In practical scenarios, it is usually feasible to acquire labels on a small portion of the target data through active learning (AL), which aims to train an effective model with as few queried instances as possible. However, due to the domain shift, the instances selected by existing AL algorithms can be uninformative, redundant, or outlying. To address this issue, we propose a novel approach, namely, clustering environment-aware learning (CEAL), for active domain adaptation (ADA). CEAL selects potentially the most valuable instances under domain shift by exploring the informativeness and representativeness of target samples in a clustering environment-aware manner. Specifically, for the informativeness, we not only leverage the knowledge of individual points but also their nearby neighbors, by measuring the proposed clustering environment aware informativeness score (CEAIS), thus ensuring that the selected samples are highly informative. For the representativeness, we design two schemes called point distance release (PDR) and informativeness score difference exclusion (ISDE) to guarantee the diversity and validity of the selected samples. Furthermore, we fully utilize the large amount of unlabeled data from target domain via pseudo labeling and adopt information maximization to improve the reliability of the target pseudo labels, thereby further improving the performance of the model. The effectiveness of our method is empirically verified on various benchmark datasets against recent state-of-the-art algorithms.
- 13 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 20 (3) , 4773-4783
Temporal Attention Source-Free Adaptation for Chemical Processes Fault Diagnosis
Recently, domain adaptation (DA)-based fault diagnosis approaches have been actively studied in chemical processes to build a reliable fault diagnosis model for a new operating mode (i.e., target domain) by making use of labeled data from a historical mode (i.e., source domain). However, this raises privacy concerns, such as data leakage, since industrial data contains sensitive production information. Moreover, preprocessed source and target data used to train an effective target model will result in additional computational costs. Therefore, it is crucial to develop a novel privacy preserving DA-based fault diagnosis approach that can improve the diagnosis performance for a new mode and protect the privacy of a historical mode simultaneously. To this end, fault diagnosis is formulated as the source-free DA problem and proposes a temporal attention source-free adaptation (TASFA) algorithm, which only utilizes the pretrained source model and unlabeled target data to learn a diagnosis model. Specifically, for the time-series process, an attention mechanism is designed to capture and leverage the temporal correlations between source and target domains by extracting the most transferable information from the target time series. Empirical results on both the Tennessee Eastman process and the continuous stirred tank reactor demonstrate the effectiveness and efficiency of TASFA.
- 13 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 20 (3) , 4773-4783
Temporal Attention Source-Free Adaptation for Chemical Processes Fault Diagnosis
Recently, domain adaptation (DA)-based fault diagnosis approaches have been actively studied in chemical processes to build a reliable fault diagnosis model for a new operating mode (i.e., target domain) by making use of labeled data from a historical mode (i.e., source domain). However, this raises privacy concerns, such as data leakage, since industrial data contains sensitive production information. Moreover, preprocessed source and target data used to train an effective target model will result in additional computational costs. Therefore, it is crucial to develop a novel privacy preserving DA-based fault diagnosis approach that can improve the diagnosis performance for a new mode and protect the privacy of a historical mode simultaneously. To this end, fault diagnosis is formulated as the source-free DA problem and proposes a temporal attention source-free adaptation (TASFA) algorithm, which only utilizes the pretrained source model and unlabeled target data to learn a diagnosis model. Specifically, for the time-series process, an attention mechanism is designed to capture and leverage the temporal correlations between source and target domains by extracting the most transferable information from the target time series. Empirical results on both the Tennessee Eastman process and the continuous stirred tank reactor demonstrate the effectiveness and efficiency of TASFA.
- Open Access
- 29 August 2023
- Published by Qeios Ltd
Review of: "Causality in Machine Learning: Innovating Model Generalization through Inference of Causal Relationships from Observational Data"
This paper adopted the causality refers, which extracts causal mechanisms from observational data, to enhance model generalization and accuracy. However, some parts of the manuscript are still vague. Please consider the following comments: * The au...
- 29 August 2023
- Published by Qeios Ltd
Open AccessReview of: "Causality in Machine Learning: Innovating Model Generalization through Inference of Causal Relationships from Observational Data"
This paper adopted the causality refers, which extracts causal mechanisms from observational data, to enhance model generalization and accuracy. However, some parts of the manuscript are still vague. Please consider the following comments: * The au...