Xudong Han
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Xudong Han has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Xiaoyi Qu
Lehigh University, USA
3 shared publications - Christopher Reginald Chatwin
School of Engineering and Informatics, University of Sussex, Brighton BN1 9RH, UK
2 shared publications - Elif Ucurum
School of Engineering and Informatics University of Sussex BN1 9RH Brighton UK
2 shared publications - Philip Birch
School of Engineering and Informatics, University of Sussex, Brighton, UK
2 shared publications - Rupert Young
School of Engineering and Informatics, University of Sussex, Brighton, United Kingdom
2 shared publications - Yueying Tian
School of Engineering and Informatics University of Sussex BN1 9RH Brighton UK
2 shared publications
Latest Publications
- Open Access
- 16 January 2026
- Published by MDPI AG in Preprints.org
Integrated Patent Prior Art Search with Claim-Aware Retrieval and Novelty Assessment
Existing patent examination approaches face fundamental limitations: they struggle with comprehensive prior art coverage due to maximum similarity scoring without considering all claim elements, provide limited ranked retrieval through binary classification without confidence scoring, and incur substantial computational overhead while generating generic outputs that miss claim-specific details. To address these challenges, we introduce \textbf{Integrated Patent Prior Art Search with Claim-Aware Retrieval and Novelty Assessment} (IPAS-CARNA), a novel three-stage pipeline combining enhanced claim-document matching, continuous novelty assessment, and claim-aware summarization. Our approach models element-wise claim coverage through adaptive chunking and weighted aggregation, integrates continuous novelty scoring with confidence assessment, and introduces claim-aware summarization with dynamic length control. Extensive experiments on CLEF-IP 2013, USPTO examination records, and HUPD validation sets demonstrate significant improvements: MAP@100 of 0.342 with 14.8\% improvement in retrieval recall, 18.2\% improvement in NDCG@10 for novelty ranking, technical accuracy above 0.85, and ROUGE-L scores of 0.456 for summarization. Our work establishes an effective integrated solution for automated patent prior art analysis.
- 16 January 2026
- Published by MDPI AG in Preprints.org
Open AccessIntegrated Patent Prior Art Search with Claim-Aware Retrieval and Novelty Assessment
Existing patent examination approaches face fundamental limitations: they struggle with comprehensive prior art coverage due to maximum similarity scoring without considering all claim elements, provide limited ranked retrieval through binary classification without confidence scoring, and incur substantial computational overhead while generating generic outputs that miss claim-specific details. To address these challenges, we introduce \textbf{Integrated Patent Prior Art Search with Claim-Aware Retrieval and Novelty Assessment} (IPAS-CARNA), a novel three-stage pipeline combining enhanced claim-document matching, continuous novelty assessment, and claim-aware summarization. Our approach models element-wise claim coverage through adaptive chunking and weighted aggregation, integrates continuous novelty scoring with confidence assessment, and introduces claim-aware summarization with dynamic length control. Extensive experiments on CLEF-IP 2013, USPTO examination records, and HUPD validation sets demonstrate significant improvements: MAP@100 of 0.342 with 14.8\% improvement in retrieval recall, 18.2\% improvement in NDCG@10 for novelty ranking, technical accuracy above 0.85, and ROUGE-L scores of 0.456 for summarization. Our work establishes an effective integrated solution for automated patent prior art analysis.
- Open Access
- 15 January 2026
- Published by MDPI AG in Preprints.org
Uncertainty-Guided Interpretable Neural Networks with Adaptive Weight Analysis for Medical Imaging
Neural network interpretability methods have produced powerful approaches for gradient-based feature attribution, energy landscape analysis, and uncertainty quantification. State-of-the-art methods rely on structural weight analysis, Monte Carlo dropout uncertainty estimation, and attention mechanisms for interpretable predictions with quantified confidence. However, existing methods face fundamental challenges: unreliable explanations with poor uncertainty quantification on complex medical imaging tasks, difficulty identifying important network weights due to fixed thresholds, and computational overhead from attention mechanisms operating without uncertainty guidance. We introduce Adaptive Uncertainty-Guided Interpretable Networks (AUGIN), a framework combining adaptive structural weight analysis, uncertainty-aware prediction intervals, and uncertainty-guided attention through three interconnected modules. Our approach models adaptive threshold computation evolving with layer depth and architecture, integrates feature-level uncertainty into prediction interval generation, and introduces uncertainty-guided attention focusing on uncertain regions. Experiments on ISLES stroke prediction, BraTS brain tumor segmentation, and CT-CTA thrombectomy outcome prediction demonstrate superior performance: 0.7891 AUC-ROC on ISLES (1.59 percentage point improvement), 0.8567 Dice score on BraTS, and 0.7456 attention IoU, while maintaining excellent uncertainty calibration (0.8123) and explanation fidelity (0.8234). Our work advances neural network interpretability by providing accurate predictions with reliable, uncertainty-quantified explanations for safety-critical medical imaging applications.
- 15 January 2026
- Published by MDPI AG in Preprints.org
Open AccessUncertainty-Guided Interpretable Neural Networks with Adaptive Weight Analysis for Medical Imaging
Neural network interpretability methods have produced powerful approaches for gradient-based feature attribution, energy landscape analysis, and uncertainty quantification. State-of-the-art methods rely on structural weight analysis, Monte Carlo dropout uncertainty estimation, and attention mechanisms for interpretable predictions with quantified confidence. However, existing methods face fundamental challenges: unreliable explanations with poor uncertainty quantification on complex medical imaging tasks, difficulty identifying important network weights due to fixed thresholds, and computational overhead from attention mechanisms operating without uncertainty guidance. We introduce Adaptive Uncertainty-Guided Interpretable Networks (AUGIN), a framework combining adaptive structural weight analysis, uncertainty-aware prediction intervals, and uncertainty-guided attention through three interconnected modules. Our approach models adaptive threshold computation evolving with layer depth and architecture, integrates feature-level uncertainty into prediction interval generation, and introduces uncertainty-guided attention focusing on uncertain regions. Experiments on ISLES stroke prediction, BraTS brain tumor segmentation, and CT-CTA thrombectomy outcome prediction demonstrate superior performance: 0.7891 AUC-ROC on ISLES (1.59 percentage point improvement), 0.8567 Dice score on BraTS, and 0.7456 attention IoU, while maintaining excellent uncertainty calibration (0.8123) and explanation fidelity (0.8234). Our work advances neural network interpretability by providing accurate predictions with reliable, uncertainty-quantified explanations for safety-critical medical imaging applications.
- Open Access
- 9 January 2026
- Published by MDPI AG in Preprints.org
Progressive Multi-Turn Reinforcement Learning for Dynamic User-Interactive Tool Agents
Recent advances in reinforcement learning for large language models have produced powerful agent frameworks that achieve strong performance on multi-turn tool use, interactive search, and complex reasoning. However, existing reinforcement learning frameworks for large language model agents face three critical limitations: difficulty in handling dynamic user interactions owing to reliance on pre-scripted queries, limited scalability across varying interaction horizons with fixed scaling schedules, and substantial reward engineering overhead requiring domain-specific manual tuning. We introduce Progressive Multi-Turn Reinforcement Learning for Dynamic User-Interactive Tool Agents, a novel framework that integrates progressive user-interactive training to overcome sparse reward signals, adaptive horizon management that monitors performance metrics and adjusts training complexity accordingly, and domain-adaptive tool orchestration that learns optimal tool selection patterns across domains. Extensive experiments on WebArena, TAU-Bench, Berkeley Function-Calling Leaderboard Version 3, BabyAI, and SciWorld demonstrate that our method achieves 28.4% success rate on WebArena and 76.3\% on TAU-Bench, substantially outperforming the baselines, such as ReAct (16.2%) and MUA-RL (24.6%), while maintaining 94.7% performance on embodied reasoning tasks and 78.9\% cross-domain performance retention. Our work establishes a unified framework for realistic user interaction training, performance-adaptive complexity scaling, and domain-flexible tool orchestration.
- 9 January 2026
- Published by MDPI AG in Preprints.org
Open AccessProgressive Multi-Turn Reinforcement Learning for Dynamic User-Interactive Tool Agents
Recent advances in reinforcement learning for large language models have produced powerful agent frameworks that achieve strong performance on multi-turn tool use, interactive search, and complex reasoning. However, existing reinforcement learning frameworks for large language model agents face three critical limitations: difficulty in handling dynamic user interactions owing to reliance on pre-scripted queries, limited scalability across varying interaction horizons with fixed scaling schedules, and substantial reward engineering overhead requiring domain-specific manual tuning. We introduce Progressive Multi-Turn Reinforcement Learning for Dynamic User-Interactive Tool Agents, a novel framework that integrates progressive user-interactive training to overcome sparse reward signals, adaptive horizon management that monitors performance metrics and adjusts training complexity accordingly, and domain-adaptive tool orchestration that learns optimal tool selection patterns across domains. Extensive experiments on WebArena, TAU-Bench, Berkeley Function-Calling Leaderboard Version 3, BabyAI, and SciWorld demonstrate that our method achieves 28.4% success rate on WebArena and 76.3\% on TAU-Bench, substantially outperforming the baselines, such as ReAct (16.2%) and MUA-RL (24.6%), while maintaining 94.7% performance on embodied reasoning tasks and 78.9\% cross-domain performance retention. Our work establishes a unified framework for realistic user interaction training, performance-adaptive complexity scaling, and domain-flexible tool orchestration.
- Open Access
Multi-Agent Medical Decision Consensus Matrix System: An Intelligent Collaborative Framework for Oncology MDT Consultations
Multidisciplinary team (MDT) consultations are the gold standard for cancer care decision-making, yet current practice lacks structured mechanisms for quantifying consensus and ensuring decision traceability. We introduce a Multi-Agent Medical Decision Consensus Matrix System that deploys seven specialized large language model agents, including an oncologist, a radiologist, a nurse, a psychologist, a patient advocate, a nutritionist and a rehabilitation therapist, to simulate realistic MDT workflows. The framework incorporates a mathematically grounded consensus matrix that uses Kendall's coefficient of concordance to objectively assess agreement. To further enhance treatment recommendation quality and consensus efficiency, the system integrates reinforcement learning methods, including Q-Learning, PPO and DQN. Evaluation across five medical benchmarks (MedQA, PubMedQA, DDXPlus, MedBullets and SymCat) shows substantial gains over existing approaches, achieving an average accuracy of 87.5% compared with 83.8% for the strongest baseline, a consensus achievement rate of 89.3% and a mean Kendall's W of 0.823. Expert reviewers rated the clinical appropriateness of system outputs at 8.9/10. The system guarantees full evidence traceability through mandatory citations of clinical guidelines and peer-reviewed literature, following GRADE principles. This work advances medical AI by providing structured consensus measurement, role-specialized multi-agent collaboration and evidence-based explainability to improve the quality and efficiency of clinical decision-making.
Open AccessMulti-Agent Medical Decision Consensus Matrix System: An Intelligent Collaborative Framework for Oncology MDT Consultations
Multidisciplinary team (MDT) consultations are the gold standard for cancer care decision-making, yet current practice lacks structured mechanisms for quantifying consensus and ensuring decision traceability. We introduce a Multi-Agent Medical Decision Consensus Matrix System that deploys seven specialized large language model agents, including an oncologist, a radiologist, a nurse, a psychologist, a patient advocate, a nutritionist and a rehabilitation therapist, to simulate realistic MDT workflows. The framework incorporates a mathematically grounded consensus matrix that uses Kendall's coefficient of concordance to objectively assess agreement. To further enhance treatment recommendation quality and consensus efficiency, the system integrates reinforcement learning methods, including Q-Learning, PPO and DQN. Evaluation across five medical benchmarks (MedQA, PubMedQA, DDXPlus, MedBullets and SymCat) shows substantial gains over existing approaches, achieving an average accuracy of 87.5% compared with 83.8% for the strongest baseline, a consensus achievement rate of 89.3% and a mean Kendall's W of 0.823. Expert reviewers rated the clinical appropriateness of system outputs at 8.9/10. The system guarantees full evidence traceability through mandatory citations of clinical guidelines and peer-reviewed literature, following GRADE principles. This work advances medical AI by providing structured consensus measurement, role-specialized multi-agent collaboration and evidence-based explainability to improve the quality and efficiency of clinical decision-making.
- Open Access
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 13872-13873
The ACM Multimedia 2025 Grand Challenge of Truthful and Responsible Multimodal Learning
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 13872-13873
Open AccessThe ACM Multimedia 2025 Grand Challenge of Truthful and Responsible Multimodal Learning
- Open Access
Feature Alignment and Representation Transfer in Knowledge Distillation for Large Language Models
Knowledge distillation (KD) is a technique for transferring knowledge from complex teacher models to simpler student models, significantly enhancing model efficiency and accuracy. It has demonstrated substantial advancements in various applications including image classification, object detection, language modeling, text classification, and sentiment analysis. Recent innovations in KD methods, such as attention-based approaches, block-wise logit distillation, and decoupling distillation, have notably improved student model performance. These techniques focus on stimulus complexity, attention mechanisms, and global information capture to optimize knowledge transfer. In addition, KD has proven effective in compressing large language models while preserving accuracy, reducing computational overhead, and improving inference speed. This survey synthesizes the latest literature, highlighting key findings, contributions, and future directions in knowledge distillation to provide insights for researchers and practitioners on its evolving role in artificial intelligence and machine learning.
Open AccessFeature Alignment and Representation Transfer in Knowledge Distillation for Large Language Models
Knowledge distillation (KD) is a technique for transferring knowledge from complex teacher models to simpler student models, significantly enhancing model efficiency and accuracy. It has demonstrated substantial advancements in various applications including image classification, object detection, language modeling, text classification, and sentiment analysis. Recent innovations in KD methods, such as attention-based approaches, block-wise logit distillation, and decoupling distillation, have notably improved student model performance. These techniques focus on stimulus complexity, attention mechanisms, and global information capture to optimize knowledge transfer. In addition, KD has proven effective in compressing large language models while preserving accuracy, reducing computational overhead, and improving inference speed. This survey synthesizes the latest literature, highlighting key findings, contributions, and future directions in knowledge distillation to provide insights for researchers and practitioners on its evolving role in artificial intelligence and machine learning.
- Open Access
- 1 January 2025
- Published by SCIE Publishing Limited in Drones and Autonomous Vehicles
- Vol. 2 (2) , 10007
Evaluating a Motion-Based Region Proposal Approach with Background Subtraction Methods for Small Drone Detection
SCIEPublish is an international open-access journal publishing service provider run by SCIE Publishing Limited, dedicated to supporting and inspiring scientists or institutions/societies who aspire to publish high-quality journals.
- 1 January 2025
- Published by SCIE Publishing Limited in Drones and Autonomous Vehicles
- Vol. 2 (2) , 10007
Open AccessEvaluating a Motion-Based Region Proposal Approach with Background Subtraction Methods for Small Drone Detection
SCIEPublish is an international open-access journal publishing service provider run by SCIE Publishing Limited, dedicated to supporting and inspiring scientists or institutions/societies who aspire to publish high-quality journals.
- Open Access
- 27 November 2024
- Published by Springer Nature in Applied Intelligence
- Vol. 55 (1) , 1-17
ETTrack: enhanced temporal motion predictor for multi-object tracking
Many Multi-Object Tracking (MOT) approaches exploit motion information to associate all the detected objects across frames. However, traditional tracking-by-detection (TBD) methods, relying on the Kalman Filter, often work well in linear motion scenarios but struggle to accurately predict the locations of objects undergoing complex and non-linear movements. To overcome these limitations, we propose ETTrack, a novel motion prediction method with an enhanced temporal motion predictor. Specifically, the motion predictor integrates a transformer model and a Temporal Convolutional Network (TCN) to capture both long-term and short-term motion patterns, and it predicts the future motion of individual objects based on the historical motion information. Additionally, we propose a novel Momentum Correction Loss function that provides additional information regarding the motion direction of objects during training. This allows the motion predictor to rapidly adapt to sudden motion variations and more accurately predict future motion. Our experimental results demonstrate that ETTrack achieves a competitive performance compared with state-of-the-art trackers on DanceTrack and SportsMOT, scoring 56.4 $$\%$$ and 74.4 $$\%$$ in HOTA metrics, respectively. Our work provides a robust solution for MOT in complex dynamic environments, which enhances the non-linear motion prediction capabilities of tracking algorithms.- 27 November 2024
- Published by Springer Nature in Applied Intelligence
- Vol. 55 (1) , 1-17
Open AccessETTrack: enhanced temporal motion predictor for multi-object tracking
Many Multi-Object Tracking (MOT) approaches exploit motion information to associate all the detected objects across frames. However, traditional tracking-by-detection (TBD) methods, relying on the Kalman Filter, often work well in linear motion scenarios but struggle to accurately predict the locations of objects undergoing complex and non-linear movements. To overcome these limitations, we propose ETTrack, a novel motion prediction method with an enhanced temporal motion predictor. Specifically, the motion predictor integrates a transformer model and a Temporal Convolutional Network (TCN) to capture both long-term and short-term motion patterns, and it predicts the future motion of individual objects based on the historical motion information. Additionally, we propose a novel Momentum Correction Loss function that provides additional information regarding the motion direction of objects during training. This allows the motion predictor to rapidly adapt to sudden motion variations and more accurately predict future motion. Our experimental results demonstrate that ETTrack achieves a competitive performance compared with state-of-the-art trackers on DanceTrack and SportsMOT, scoring 56.4 $$\%$$ and 74.4 $$\%$$ in HOTA metrics, respectively. Our work provides a robust solution for MOT in complex dynamic environments, which enhances the non-linear motion prediction capabilities of tracking algorithms.