XXXiaoming Xue

Xiaoming Xue

*This is an algorithmically generated author record based on publicly available information.

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


Xiaoming Xue has a total of 84 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Variance-Preserving Ensemble Smoother with Multiple Data Assimilation for History Matching with Diagonal Observation Error Covariance

    by Jinding Zhang, Piyang Liu, Kai Zhang, Liming Zhang, Ziwei Bian, Xia Yan, Xiaoming Xue, Qinyang Dai, Hai Sun, Yongfei Yang, et al.

    Summary: The ensemble smoother with multiple data assimilation (ESMDA) is widely used for reservoir history matching because of its parallel computational efficiency and ease of implementation. Production data in high-dimensional reservoir applications are often correlated across time, wells, and response types. When a diagonal observation error covariance is used, these correlations are ignored, and redundant observations are treated as independent. Standard ESMDA can therefore overcondition the ensemble and underestimate posterior uncertainty. We address this problem with a variance-preserving ESMDA (VP-ESMDA) based on the effective dimension of production data. At each assimilation step, VP-ESMDA constructs a standardized observation-anomaly Gram matrix from the predicted-response ensemble, computes the effective observation dimension via a participation ratio, and converts this into a redundancy factor that inflates the observation error covariance. When the total number of observations greatly exceeds the diagnosed effective dimension, the update is automatically weakened, preserving ensemble variance. We validate the proposed approach on scalar nonlinear benchmarks, a synthetic 2D reservoir, and the Brugge field case. The results show that under correlated observations, VP-ESMDA recovers a posterior distribution closer to the reference solution, yields larger posterior variance than standard ESMDA, and mitigates the underestimation of posterior uncertainty.

  • Open Access

    Knowledge transfer across development stages for dynamic reservoir production optimization with infill wells

    by Jia-Lin Wang, Li-Ming Zhang, Kai Zhang, Mario Andrés Muñoz, Pi-Yang Liu, Xiao-Ming Xue, Xia Yan, Yong-Fei Yang, Jian Wang, Hai Sun, et al.

  • Rank-Based Learning and Local Model-Based Evolutionary Algorithm for High-Dimensional Expensive Multiobjective Problems

    by Guodong Chen, Jiu Jimmy Jiao, Xiaoming Xue, Zhongzheng Wang

    Surrogate-assisted evolutionary algorithms (SAEAs) have been widely developed to solve complex and computationally expensive multiobjective optimization problems (EMOPs) in recent years. However, when dealing with high-dimensional optimization problems in decision space, the performance of these surrogate-assisted multiobjective evolutionary algorithms (MOEAs) deteriorates drastically. In this work, a novel classifier-assisted rank-based learning and local model-based multiobjective evolutionary algorithm (CLMEA) is proposed for high-dimensional EMOPs. CLMEA makes full use of the uncertainty of solutions in the decision space and objective space to explore the uncertain but informative space toward high-dimensional problems. Specifically, the offspring in different ranks uses rank-based learning strategy to generate more promising and informative candidates for function evaluations (FEs). To reduce the search region of high-dimensional problems and maintain the diversity of solutions, the most uncertain sample point from the nondominated solutions measured by the crowding distance is selected as the center to conduct local search. The experimental results of benchmark problems and a real-world application on geothermal reservoir heat extraction optimization demonstrate superior performance of CLMEA compared with the state-of-the-art surrogate-assisted MOEAs. The source code for this work is available at https://github.com/JellyChen7/CLMEA


  • Enhancing X-ray Image Classification through Heterogeneous Federated Learning with Natural Image-Augmented Models

    by Yao Hu, Yu-An Huang, Rui Liu, Xiaoming Xue, Yajie Zhang, Jibin Wu, Zhi-An Huang, Kay Chen Tan

    Deep learning-based computer-aided diagnosis (DL-CAD) models have achieved remarkable success in X-ray image analysis. Yet their effectiveness is often constrained by the tight regulations of governing sensitive X-ray data. Federated Learning (FL) offers a promising paradigm by facilitating the collaborative training of DL-CAD models across healthcare institutions without compromising data privacy. Despite this advancement, the limited local X-ray archives and the issue of heterogeneous model architectures bring distinctive challenges. To address these challenges, this work pioneers the utilization of natural images to develop a natural image-augmented heterogeneous FL framework (NatIMG-FL) for X-ray classification. For augmenting local training, NatIMG-FL leverages natural images as auxiliary supervised data to facilitate the alignment of feature distributions between natural and X-ray images. To tackle the model heterogeneity issue, NatIMG-FL introduces a novel dual weights-based fine-grained knowledge transfer method, enabling adaptive knowledge exchange between local and central models. The NatIMG-FL framework provides insights into exploiting natural images as proxy datasets to enhance knowledge transfer in heterogeneous FL for X-ray classification.

  • Multi-Task Surrogate-Assisted Search With Bayesian Competitive Knowledge Transfer for Expensive Optimization

    by Yi Lu, Kai Zhang, Xiaoming Xue, Liming Zhang, Guodong Chen, Chenming Cao, Piyang Liu, Kay Chen Tan

    Expensive optimization problems (EOPs) present significant challenges for traditional evolutionary optimization due to their limited evaluation calls. Although surrogate-assisted search (SAS) has become a popular paradigm for addressing EOPs, it still suffers from the cold-start issue. In response to this challenge, knowledge transfer has been gaining popularity for its ability to leverage search experience from potentially related instances, ultimately facilitating head-start optimization for more efficient decision-making. However, the curse of negative transfer persists when applying knowledge transfer to EOPs, primarily due to the inherent limitations of existing methods in assessing knowledge transferability. On the one hand, a priori transferability assessment criteria are intrinsically inaccurate due to their imprecise understandings. On the other hand, a posteriori methods often necessitate sufficient observations to make correct inferences, rendering them inefficient when applied to EOPs. Considering the above, this paper introduces a Bayesian competitive knowledge transfer (BCKT) method developed to improve multi-task SAS (MSAS) when addressing multiple EOPs simultaneously. Specifically, the transferability of knowledge is estimated from a Bayesian perspective that accommodates both prior beliefs and empirical evidence, enabling accurate competition between inner-task and inter-task solutions, ultimately leading to the adaptive use of promising solutions while effectively suppressing inferior ones. The effectiveness of our method in boosting various SAS algorithms for both multi-task and many-task problems is empirically validated, complemented by comparative studies that demonstrate its superiority over peer algorithms and its applicability to real-world scenarios. The source code is available at https://github.com/XmingHsueh/MSAS-BCKT.


  • Top Cited Papers

    A Scalable Test Problem Generator for Sequential Transfer Optimization

    by Xiaoming Xue, Cuie Yang, Liang Feng, Kai Zhang, Linqi Song, Kay Chen Tan

    Despite the increasing interest in sequential transfer optimization (STO), a comprehensive benchmark suite for systematically comparing various STO algorithms remains underexplored. Existing test problems, which are often manually configured and lack scalability, can result in biased and nongeneralizable algorithm performance. In light of the above, we first introduce four concepts for characterizing STO problems (STOPs) in this study and present an important feature, namely similarity distribution, to quantitatively delineate the relationship between the optimal solutions of source and target tasks. Subsequently, we present general design guidelines for STOPs and introduce a problem generator that demonstrates strong scalability. Specifically, the similarity distribution of a problem can be easily customized through a novel inverse generation strategy, allowing for a continuous spectrum that captures the diverse similarity relationships present in real-world scenarios. Lastly, a benchmark suite comprising 12 STOPs, characterized by a range of customized similarity relationships, has been developed using the proposed generator and will serve as a platform for examining various STO algorithms. For instance, biased transferability representation, irregular mapping learning behaviors, and performance improvements unrelated to search experience are significant empirical findings that previous benchmarks failed to reveal, yet can be effectively identified through our test problems. The source code of the proposed problem generator is available at https://github.com/XmingHsueh/STOP-G.


  • Surrogate-Assisted Search With Competitive Knowledge Transfer for Expensive Optimization

    by Xiaoming Xue, Yao Hu, Liang Feng, Kai Zhang, Linqi Song, Kay Chen Tan

    Expensive optimization problems (EOPs) have attracted increasing research attention over the decades due to their ubiquity in a variety of practical applications. Despite many sophisticated surrogate-assisted evolutionary algorithms (SAEAs) that have been developed for solving such problems, most of them lack the ability to transfer knowledge from previously-solved tasks and always start their search from scratch, making them troubled by the notorious cold-start issue. A few preliminary studies that integrate transfer learning into SAEAs still face some issues, such as defective similarity quantification that is prone to underestimate promising knowledge, surrogate-dependency that makes the transfer methods not coherent with the state-of-the-art in SAEAs, etc. In light of the above, a plug and play competitive knowledge transfer method is proposed to boost various SAEAs in this paper. Specifically, both the optimized solutions from the source tasks and the promising solutions acquired by the target surrogate are treated as task-solving knowledge, enabling them to compete with each other to elect the winner for expensive evaluation, thus boosting the search speed on the target task. Moreover, the lower bound of the convergence gain brought by the knowledge competition is mathematically analyzed, which is expected to strengthen the theoretical foundation of sequential transfer optimization. Experimental studies conducted on a series of benchmark problems and a practical application from the petroleum industry verify the efficacy of the proposed method. The source code of the competitive knowledge transfer is available at https://github.com/XmingHsueh/SAS-CKT.


  • Global and Local Search Experience-Based Evolutionary Sequential Transfer Optimization

    by Chenming Cao, Kai Zhang, Xiaoming Xue, Kay Chen Tan, Jian Wang, Liming Zhang, Piyang Liu, Xia Yan

    Evolutionary sequential transfer optimization (ESTO), which aims to better optimize a target task using the knowledge extracted from a number of previously-solved source tasks, has been gaining continually increasing research attention over the years. Particularly, solution-based ESTO (S-ESTO) that transfers task solutions has been receiving much popularity due to its ease of implementation and optimizer independency. However, existing S-ESTO algorithms put much emphasis on utilizing source optimized solutions standing for global search experience without being aware of the potential of intermediate solutions that represent local optimization experience. Besides, most of them cannot take full advantage of the solution data from evolutionary search. In light of the above, this study aims to develop a global and local search experience-based solution transfer technique to maximally release the potential of optimization experience hidden in the source tasks. Firstly, a novel transferability metric named landscape encoding-based rank correlation (LERC) is developed. Then, we propose to divide the optimization experience into two classes: global and local search experience. Accordingly, by instantiating LERC into global and local versions, we develop two distinct transfer methods to exploit the global and local search experience, respectively. Finally, by combining the two transfer methods, we propose an S-ESTO algorithm that can transfer the global and local search experience simultaneously for maximum performance enhancement for the target task. Experiments conducted on a set of benchmark problems and a practical case study verify the efficacy of the proposed methods. The source code of our algorithm is available at https://github.com/ccm831143/GL-LERC.


  • Whole‐genome sequencing of a worldwide collection of sugarcane cultivars (Saccharum spp.) reveals the genetic basis of cultivar improvement

    by Xuhui Li, Xinglong Chen, Junteng Fang, Xiaomin Feng, Xiangbo Zhang, Huanzhang Lin, Weiwei Chen, Nannan Zhang, Huiyi He, Zhenghui Huang, et al.

    SUMMARY: Sugarcane is the main source of sugar worldwide, and 80% of the sucrose production comes from sugarcane. However, the genetic differentiation and basis of agronomic traits remain obscure. Here, we sequenced the whole‐genome of 219 elite worldwide sugarcane cultivar accessions. A total of approximately 6 million high‐quality genome‐wide single nucleotide polymorphisms (SNPs) were detected. A genome‐wide association study identified a total of 2198 SNPs that were significantly associated with sucrose content, stalk number, plant height, stalk diameter, cane yield, and sugar yield. We observed homozygous tendency of favor alleles of these loci, and over 80% of cultivar accessions carried the favor alleles of the SNPs or haplotypes associated with sucrose content. Gene introgression analysis showed that the number of chromosome segments from Saccharum spontaneum decreased with the breeding time of cultivars, while those from S. officinarum increased in recent cultivars. A series of selection signatures were identified in sugarcane improvement procession, of which 104 were simultaneously associated with agronomic traits and 45 of them were mainly associated with sucrose content. We further proposed that as per sugarcane transgenic experiments, ShN/AINV3.1 plays a positive role in increasing stalk number, plant height, and stalk diameter. These findings provide comprehensive resources for understanding the genetic basis of agronomic traits and will be beneficial to germplasm innovation, screening molecular markers, and future sugarcane cultivar improvement.