Xin Liu
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
Xin Liu has a total of 154 co-authors. Here are the top co-authors by number of shared publications:
- Shahbaz Rezaei
University of California Davis CA USA
13 shared publications - Yongshuai Liu
University of California Davis
7 shared publications - Albara Ah Ramli
Department of Physical Medicine and Rehabilitation, School of Medicine, University of California, Davis, 1 Shields Ave., Davis, CA 95616, USA
6 shared publications - Huanle Zhang
School of Computer Science and Technology, Shandong University, Qingdao, China
6 shared publications - Chao Huang
Department of Computer Science, The University of California at Davis, Davis, CA, USA
5 shared publications - Erik K. Henricson
Department of Physical Medicine and Rehabilitation, School of Medicine, University of California, Davis, 1 Shields Ave., Davis, CA 95616, USA
5 shared publications
Latest Publications
- Open Access
- 11 August 2025
- Published by Elsevier in Blood Red Cells & Iron
- Vol. 1 (3)
Microfluidic assessment of PO2-regulated RBC capillary velocity in ME/CFS
- 11 August 2025
- Published by Elsevier in Blood Red Cells & Iron
- Vol. 1 (3)
Open AccessMicrofluidic assessment of PO2-regulated RBC capillary velocity in ME/CFS
- Open Access
- 29 July 2025
- Published by MDPI AG in Bioengineering
- Vol. 12 (8) , 814
Unveiling Early Signs of Preclinical Alzheimer’s Disease Through ERP Analysis with Weighted Visibility Graphs and Ensemble Learning
The early detection of Alzheimer’s disease (AD) is important for effective therapeutic interventions and optimized enrollment for clinical trials. Recent studies have shown high accuracy in identifying mild AD by applying visibility graph and machine learning methods to electroencephalographic (EEG) data. We present a novel analytical framework combining Weighted Visibility Graphs (WVG) and ensemble learning to detect individuals in the “preclinical” stage of AD (preAD) using a word repetition EEG paradigm, where WVG is an advanced variant of natural Visibility Graph (VG), incorporating weighted edges based on the visibility degree between corresponding data points. The EEG signals were recorded from 40 cognitively unimpaired elderly participants (20 preclinical AD and 20 normal old) during a word repetition task. Event-related potential (ERP) and oscillatory signals were extracted from each EEG channel and transformed into a WVG network, from which relevant topological features were extracted. The features were selected using t-tests to reduce noise. Subsequent statistical analysis reveals significant disparities in the structure of WVG networks between preAD and normal subjects. Furthermore, Principal Component Analysis (PCA) was applied to condense the input data into its principal features. Leveraging these PCA components as input features, several machine learning algorithms are used to classify preAD vs. normal subjects. To enhance classification accuracy and robustness, an ensemble method is employed alongside the classifiers. Our framework achieved an accuracy of up to 92% discriminating preAD from normal old using both linear and non-linear classifiers, signifying the efficacy of combining WVG and ensemble learning in identifying very early AD from EEG signals. The framework can also improve clinical efficiency by reducing the amount of data required for effective classification and thus saving valuable clinical time.
- 29 July 2025
- Published by MDPI AG in Bioengineering
- Vol. 12 (8) , 814
Open AccessUnveiling Early Signs of Preclinical Alzheimer’s Disease Through ERP Analysis with Weighted Visibility Graphs and Ensemble Learning
The early detection of Alzheimer’s disease (AD) is important for effective therapeutic interventions and optimized enrollment for clinical trials. Recent studies have shown high accuracy in identifying mild AD by applying visibility graph and machine learning methods to electroencephalographic (EEG) data. We present a novel analytical framework combining Weighted Visibility Graphs (WVG) and ensemble learning to detect individuals in the “preclinical” stage of AD (preAD) using a word repetition EEG paradigm, where WVG is an advanced variant of natural Visibility Graph (VG), incorporating weighted edges based on the visibility degree between corresponding data points. The EEG signals were recorded from 40 cognitively unimpaired elderly participants (20 preclinical AD and 20 normal old) during a word repetition task. Event-related potential (ERP) and oscillatory signals were extracted from each EEG channel and transformed into a WVG network, from which relevant topological features were extracted. The features were selected using t-tests to reduce noise. Subsequent statistical analysis reveals significant disparities in the structure of WVG networks between preAD and normal subjects. Furthermore, Principal Component Analysis (PCA) was applied to condense the input data into its principal features. Leveraging these PCA components as input features, several machine learning algorithms are used to classify preAD vs. normal subjects. To enhance classification accuracy and robustness, an ensemble method is employed alongside the classifiers. Our framework achieved an accuracy of up to 92% discriminating preAD from normal old using both linear and non-linear classifiers, signifying the efficacy of combining WVG and ensemble learning in identifying very early AD from EEG signals. The framework can also improve clinical efficiency by reducing the amount of data required for effective classification and thus saving valuable clinical time.
- Open Access
On the Necessity of Multi-Domain Explanation: An Uncertainty Principle Approach for Deep Time Series Models
A prevailing approach to explain time series models is to generate attribution in time domain. A recent development in time series XAI is the concept of explanation spaces, where any model trained in the time domain can be interpreted with any existing XAI method in alternative domains, such as frequency. The prevailing approach is to present XAI attributions either in the time domain or in the domain where the attribution is most sparse. In this paper, we demonstrate that in certain cases, XAI methods can generate attributions that highlight fundamentally different features in the time and frequency domains that are not direct counterparts of one another. This suggests that both domains' attributions should be presented to achieve a more comprehensive interpretation. Thus it shows the necessity of multi-domain explanation. To quantify when such cases arise, we introduce the uncertainty principle (UP), originally developed in quantum mechanics and later studied in harmonic analysis and signal processing, to the XAI literature. This principle establishes a lower bound on how much a signal can be simultaneously localized in both the time and frequency domains. By leveraging this concept, we assess whether attributions in the time and frequency domains violate this bound, indicating that they emphasize distinct features. In other words, UP provides a sufficient condition that the time and frequency domain explanations do not match and, hence, should be both presented to the end user. We validate the effectiveness of this approach across various deep learning models, XAI methods, and a wide range of classification and forecasting datasets. The frequent occurrence of UP violations across various datasets and XAI methods highlights the limitations of existing approaches that focus solely on time-domain explanations. This underscores the need for multi-domain explanations as a new paradigm.
Open AccessOn the Necessity of Multi-Domain Explanation: An Uncertainty Principle Approach for Deep Time Series Models
A prevailing approach to explain time series models is to generate attribution in time domain. A recent development in time series XAI is the concept of explanation spaces, where any model trained in the time domain can be interpreted with any existing XAI method in alternative domains, such as frequency. The prevailing approach is to present XAI attributions either in the time domain or in the domain where the attribution is most sparse. In this paper, we demonstrate that in certain cases, XAI methods can generate attributions that highlight fundamentally different features in the time and frequency domains that are not direct counterparts of one another. This suggests that both domains' attributions should be presented to achieve a more comprehensive interpretation. Thus it shows the necessity of multi-domain explanation. To quantify when such cases arise, we introduce the uncertainty principle (UP), originally developed in quantum mechanics and later studied in harmonic analysis and signal processing, to the XAI literature. This principle establishes a lower bound on how much a signal can be simultaneously localized in both the time and frequency domains. By leveraging this concept, we assess whether attributions in the time and frequency domains violate this bound, indicating that they emphasize distinct features. In other words, UP provides a sufficient condition that the time and frequency domain explanations do not match and, hence, should be both presented to the end user. We validate the effectiveness of this approach across various deep learning models, XAI methods, and a wide range of classification and forecasting datasets. The frequent occurrence of UP violations across various datasets and XAI methods highlights the limitations of existing approaches that focus solely on time-domain explanations. This underscores the need for multi-domain explanations as a new paradigm.
- Open Access
Implet: A Post-hoc Subsequence Explainer for Time Series Models
Explainability in time series models is crucial for fostering trust, facilitating debugging, and ensuring interpretability in real-world applications. In this work, we introduce Implet, a novel post-hoc explainer that generates accurate and concise subsequence-level explanations for time series models. Our approach identifies critical temporal segments that significantly contribute to the model's predictions, providing enhanced interpretability beyond traditional feature-attribution methods. Based on it, we propose a cohort-based (group-level) explanation framework designed to further improve the conciseness and interpretability of our explanations. We evaluate Implet on several standard time-series classification benchmarks, demonstrating its effectiveness in improving interpretability. The code is available at https://github.com/LbzSteven/implet
Open AccessImplet: A Post-hoc Subsequence Explainer for Time Series Models
Explainability in time series models is crucial for fostering trust, facilitating debugging, and ensuring interpretability in real-world applications. In this work, we introduce Implet, a novel post-hoc explainer that generates accurate and concise subsequence-level explanations for time series models. Our approach identifies critical temporal segments that significantly contribute to the model's predictions, providing enhanced interpretability beyond traditional feature-attribution methods. Based on it, we propose a cohort-based (group-level) explanation framework designed to further improve the conciseness and interpretability of our explanations. We evaluate Implet on several standard time-series classification benchmarks, demonstrating its effectiveness in improving interpretability. The code is available at https://github.com/LbzSteven/implet
- Open Access
- 7 May 2025
- Published by Springer Nature in Applied Intelligence
- Vol. 55 (10) , 1-13
Adventurer: exploration with BiGAN for deep reinforcement learning
Recent developments in deep reinforcement learning have been very successful in learning complex, previously intractable problems. Sample efficiency and local optimality, however, remain significant challenges. To address these challenges, novelty-driven exploration strategies have emerged and shown promising potential. Unfortunately, no single algorithm outperforms all others in all tasks and most of them struggle with tasks with high-dimensional and complex observations. In this work, we propose Adventurer, a novelty-driven exploration algorithm that is based on Bidirectional Generative Adversarial Networks (BiGAN), where BiGAN is trained to estimate state novelty. Intuitively, a generator that has been trained on the distribution of visited states should only be able to generate a state coming from the distribution of visited states. As a result, novel states using the generator to reconstruct input states from certain latent representations would lead to larger reconstruction errors. We show that BiGAN performs well in estimating state novelty for complex observations. This novelty estimation method can be combined with intrinsic-reward-based exploration. Our empirical results show that Adventurer produces competitive results on a range of popular benchmark tasks, including continuous robotic manipulation tasks (e.g. Mujoco robotics) and high-dimensional image-based tasks (e.g. Atari games).
- 7 May 2025
- Published by Springer Nature in Applied Intelligence
- Vol. 55 (10) , 1-13
Open AccessAdventurer: exploration with BiGAN for deep reinforcement learning
Recent developments in deep reinforcement learning have been very successful in learning complex, previously intractable problems. Sample efficiency and local optimality, however, remain significant challenges. To address these challenges, novelty-driven exploration strategies have emerged and shown promising potential. Unfortunately, no single algorithm outperforms all others in all tasks and most of them struggle with tasks with high-dimensional and complex observations. In this work, we propose Adventurer, a novelty-driven exploration algorithm that is based on Bidirectional Generative Adversarial Networks (BiGAN), where BiGAN is trained to estimate state novelty. Intuitively, a generator that has been trained on the distribution of visited states should only be able to generate a state coming from the distribution of visited states. As a result, novel states using the generator to reconstruct input states from certain latent representations would lead to larger reconstruction errors. We show that BiGAN performs well in estimating state novelty for complex observations. This novelty estimation method can be combined with intrinsic-reward-based exploration. Our empirical results show that Adventurer produces competitive results on a range of popular benchmark tasks, including continuous robotic manipulation tasks (e.g. Mujoco robotics) and high-dimensional image-based tasks (e.g. Atari games).
- Open Access
Towards Fully Automated Decision-Making Systems for Greenhouse Control: Challenges and Opportunities
Machine learning has been successful in building control policies to drive a complex system to desired states in various applications (e.g. games, robotics, etc.). To be specific, a number of parameters of policy can be automatically optimized from the observations of environment to be able to generate a sequence of decisions leading to the best performance. In this survey paper, we particularly explore such policy-learning techniques for another unique, practical use-case scenario--farming, in which critical decisions (e.g., water supply, heating, etc.) must be made in a timely manner to minimize risks (e.g., damage to plants) while maximizing the revenue (e.g., healthy crops) in the end. We first provide a broad overview of latest studies on it to identify not only domain-specific challenges but opportunities with potential solutions, some of which are suggested as promising directions for future research. Also, we then introduce our successful approach to being ranked second among 46 teams at the ''3rd Autonomous Greenhouse Challenge'' to use this specific example to discuss the lessons learned about important considerations for design to create autonomous farm-management systems.
Open AccessTowards Fully Automated Decision-Making Systems for Greenhouse Control: Challenges and Opportunities
Machine learning has been successful in building control policies to drive a complex system to desired states in various applications (e.g. games, robotics, etc.). To be specific, a number of parameters of policy can be automatically optimized from the observations of environment to be able to generate a sequence of decisions leading to the best performance. In this survey paper, we particularly explore such policy-learning techniques for another unique, practical use-case scenario--farming, in which critical decisions (e.g., water supply, heating, etc.) must be made in a timely manner to minimize risks (e.g., damage to plants) while maximizing the revenue (e.g., healthy crops) in the end. We first provide a broad overview of latest studies on it to identify not only domain-specific challenges but opportunities with potential solutions, some of which are suggested as promising directions for future research. Also, we then introduce our successful approach to being ranked second among 46 teams at the ''3rd Autonomous Greenhouse Challenge'' to use this specific example to discuss the lessons learned about important considerations for design to create autonomous farm-management systems.
- Open Access
Look Before Leap: Look-Ahead Planning with Uncertainty in Reinforcement Learning
Model-based reinforcement learning (MBRL) has demonstrated superior sample efficiency compared to model-free reinforcement learning (MFRL). However, the presence of inaccurate models can introduce biases during policy learning, resulting in misleading trajectories. The challenge lies in obtaining accurate models due to limited diverse training data, particularly in regions with limited visits (uncertain regions). Existing approaches passively quantify uncertainty after sample generation, failing to actively collect uncertain samples that could enhance state coverage and improve model accuracy. Moreover, MBRL often faces difficulties in making accurate multi-step predictions, thereby impacting overall performance. To address these limitations, we propose a novel framework for uncertainty-aware policy optimization with model-based exploratory planning. In the model-based planning phase, we introduce an uncertainty-aware k-step lookahead planning approach to guide action selection at each step. This process involves a trade-off analysis between model uncertainty and value function approximation error, effectively enhancing policy performance. In the policy optimization phase, we leverage an uncertainty-driven exploratory policy to actively collect diverse training samples, resulting in improved model accuracy and overall performance of the RL agent. Our approach offers flexibility and applicability to tasks with varying state/action spaces and reward structures. We validate its effectiveness through experiments on challenging robotic manipulation tasks and Atari games, surpassing state-of-the-art methods with fewer interactions, thereby leading to significant performance improvements.
Open AccessLook Before Leap: Look-Ahead Planning with Uncertainty in Reinforcement Learning
Model-based reinforcement learning (MBRL) has demonstrated superior sample efficiency compared to model-free reinforcement learning (MFRL). However, the presence of inaccurate models can introduce biases during policy learning, resulting in misleading trajectories. The challenge lies in obtaining accurate models due to limited diverse training data, particularly in regions with limited visits (uncertain regions). Existing approaches passively quantify uncertainty after sample generation, failing to actively collect uncertain samples that could enhance state coverage and improve model accuracy. Moreover, MBRL often faces difficulties in making accurate multi-step predictions, thereby impacting overall performance. To address these limitations, we propose a novel framework for uncertainty-aware policy optimization with model-based exploratory planning. In the model-based planning phase, we introduce an uncertainty-aware k-step lookahead planning approach to guide action selection at each step. This process involves a trade-off analysis between model uncertainty and value function approximation error, effectively enhancing policy performance. In the policy optimization phase, we leverage an uncertainty-driven exploratory policy to actively collect diverse training samples, resulting in improved model accuracy and overall performance of the RL agent. Our approach offers flexibility and applicability to tasks with varying state/action spaces and reward structures. We validate its effectiveness through experiments on challenging robotic manipulation tasks and Atari games, surpassing state-of-the-art methods with fewer interactions, thereby leading to significant performance improvements.
- Open Access
Adventurer: Exploration with BiGAN for Deep Reinforcement Learning
Recent developments in deep reinforcement learning have been very successful in learning complex, previously intractable problems. Sample efficiency and local optimality, however, remain significant challenges. To address these challenges, novelty-driven exploration strategies have emerged and shown promising potential. Unfortunately, no single algorithm outperforms all others in all tasks and most of them struggle with tasks with high-dimensional and complex observations. In this work, we propose Adventurer, a novelty-driven exploration algorithm that is based on Bidirectional Generative Adversarial Networks (BiGAN), where BiGAN is trained to estimate state novelty. Intuitively, a generator that has been trained on the distribution of visited states should only be able to generate a state coming from the distribution of visited states. As a result, novel states using the generator to reconstruct input states from certain latent representations would lead to larger reconstruction errors. We show that BiGAN performs well in estimating state novelty for complex observations. This novelty estimation method can be combined with intrinsic-reward-based exploration. Our empirical results show that Adventurer produces competitive results on a range of popular benchmark tasks, including continuous robotic manipulation tasks (e.g. Mujoco robotics) and high-dimensional image-based tasks (e.g. Atari games).
Open AccessAdventurer: Exploration with BiGAN for Deep Reinforcement Learning
Recent developments in deep reinforcement learning have been very successful in learning complex, previously intractable problems. Sample efficiency and local optimality, however, remain significant challenges. To address these challenges, novelty-driven exploration strategies have emerged and shown promising potential. Unfortunately, no single algorithm outperforms all others in all tasks and most of them struggle with tasks with high-dimensional and complex observations. In this work, we propose Adventurer, a novelty-driven exploration algorithm that is based on Bidirectional Generative Adversarial Networks (BiGAN), where BiGAN is trained to estimate state novelty. Intuitively, a generator that has been trained on the distribution of visited states should only be able to generate a state coming from the distribution of visited states. As a result, novel states using the generator to reconstruct input states from certain latent representations would lead to larger reconstruction errors. We show that BiGAN performs well in estimating state novelty for complex observations. This novelty estimation method can be combined with intrinsic-reward-based exploration. Our empirical results show that Adventurer produces competitive results on a range of popular benchmark tasks, including continuous robotic manipulation tasks (e.g. Mujoco robotics) and high-dimensional image-based tasks (e.g. Atari games).
- Open Access
- 19 February 2025
- Published by Springer Nature in Machine Learning
- Vol. 114 (4) , 1-17
An empirical study on impact of label noise on synthetic tabular data generation
Synthetic data has been actively used for various machine learning-based tasks due to its benefits such as massive reproducibility and privacy enhancement compared to using the original data. The quality of the generated synthetic dataset crucially depends on the quality of the original data, and the latter is often corrupted by label noise. While there have been studies on feature noise, how label noise affects synthetic data generation is under-explored. In this paper, we evaluate the impact of the noisy label on synthetic data generation with a focus on tabular data. One challenge is how to evaluate the quality of synthetic data under label noise. To this end, we design comprehensive experiments to measure the impact of label noise on synthetic data generation in different aspects: synthetic data quality, data utility, and convergence for training synthesizers and machine learning models for downstream tasks. The empirical results cover wide aspects of synthetic data generation under label noise and they show quality and utility degrades with higher noise levels while there is no significant effect on the synthesizer convergence observed.
- 19 February 2025
- Published by Springer Nature in Machine Learning
- Vol. 114 (4) , 1-17
Open AccessAn empirical study on impact of label noise on synthetic tabular data generation
Synthetic data has been actively used for various machine learning-based tasks due to its benefits such as massive reproducibility and privacy enhancement compared to using the original data. The quality of the generated synthetic dataset crucially depends on the quality of the original data, and the latter is often corrupted by label noise. While there have been studies on feature noise, how label noise affects synthetic data generation is under-explored. In this paper, we evaluate the impact of the noisy label on synthetic data generation with a focus on tabular data. One challenge is how to evaluate the quality of synthetic data under label noise. To this end, we design comprehensive experiments to measure the impact of label noise on synthetic data generation in different aspects: synthetic data quality, data utility, and convergence for training synthesizers and machine learning models for downstream tasks. The empirical results cover wide aspects of synthetic data generation under label noise and they show quality and utility degrades with higher noise levels while there is no significant effect on the synthesizer convergence observed.
- Open Access
- 1 January 2025
- Published by Association for Computational Linguistics (ACL)
- p. 59-74
MLAN: Language-Based Instruction Tuning Preserves and Transfers Knowledge in Multimodal Language Models
Jianhong Tu, Zhuohao Ni, Nicholas Crispino, Zihao Yu, Michael Bendersky, Beliz Gunel, Ruoxi Jia, Xin Liu, Lingjuan Lyu, Dawn Song, Chenguang Wang. Proceedings of the 3rd Workshop on Towards Knowledgeable Foundation Models (KnowFM). 2025.
- 1 January 2025
- Published by Association for Computational Linguistics (ACL)
- p. 59-74
Open AccessMLAN: Language-Based Instruction Tuning Preserves and Transfers Knowledge in Multimodal Language Models
Jianhong Tu, Zhuohao Ni, Nicholas Crispino, Zihao Yu, Michael Bendersky, Beliz Gunel, Ruoxi Jia, Xin Liu, Lingjuan Lyu, Dawn Song, Chenguang Wang. Proceedings of the 3rd Workshop on Towards Knowledgeable Foundation Models (KnowFM). 2025.