Arrow Research search

Author name cluster

Lin Xu

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

18 papers
2 author rows

Possible papers

18

AAAI Conference 2026 Conference Paper

GenePheno: Interpretable Gene Knockout-Induced Phenotype Abnormality Prediction from Gene Sequences

  • Jingquan Yan
  • Yuwei Miao
  • Lei Yu
  • Yuzhi Guo
  • Xue Xiao
  • Lin Xu
  • Junzhou Huang

Exploring how genetic sequences shape phenotypes is a fundamental challenge in biology and a key step toward scalable, hypothesis-driven experimentation. The task is complicated by the large modality gap between sequences and phenotypes, as well as the pleiotropic nature of gene–phenotype relationships. Existing sequence-based efforts focus on the degree to which variants of specific genes alter a limited set of phenotypes, while general gene knockout-induced phenotype abnormality prediction methods heavily rely on curated genetic information as inputs, which limits scalability and generalizability. As a result, the task of broadly predicting the presence of multiple phenotype abnormalities under gene knockout directly from gene sequences remains underexplored. We introduce GenePheno, the first interpretable multi-label prediction framework that predicts knockout-induced phenotypic abnormalities from gene sequences. GenePheno employs a contrastive multi-label learning objective that captures inter-phenotype correlations, complemented by an exclusive regularization that enforces biological consistency. It further incorporates a gene function bottleneck layer, offering human-interpretable concepts that reflect functional mechanisms behind phenotype formation. To support progress in this area, we curate four datasets with canonical gene sequences as input and multi-label phenotypic abnormalities induced by gene knockouts as targets. Across these datasets, GenePheno achieves state-of-the-art gene-centric Fmax and phenotype-centric AUC, and case studies demonstrate its ability to reveal gene functional mechanisms.

YNIMG Journal 2026 Journal Article

Sleep deprivation disrupts postural balance and sensorimotor integration: A combined psychophysiological–behavioral analysis

  • Lin Xu
  • Lei Peng
  • Xin An
  • Xiao Zhong
  • Yongcong Shao
  • Yuefang Dong
  • Weiwei Fu

BACKGROUND: Sleep is crucial for optimal sensorimotor integration, a fundamental process enabling coordinated motor responses to sensory inputs. However, the neurophysiological mechanisms through which acute sleep deprivation impairs this integration remain incompletely understood. This study investigates the impact of acute sleep deprivation on postural balance and elucidates the underlying multilayered mechanisms using a combination of behavioral, psychophysiological, and neuroimaging indicators. METHODS: Twenty-five healthy young participants underwent 36 h of total sleep deprivation. Before and after the deprivation period, data were collected on postural stability metrics, psychomotor vigilance (PVT), critical flicker fusion frequency (CFF), resting-state electroencephalography (EEG), and resting-state functional magnetic resonance imaging (fMRI). Correlation analyses were performed to examine the associations between changes in behavioral performance (postural balance, PVT, and CFF) and alterations in psychophysiological measures (EEG spectral power and fMRI resting-state activity). RESULTS: Sleep deprivation significantly impaired balance, particularly with eyes closed, and was associated with reduced alertness and increased visual fatigue. EEG revealed elevated low-frequency power in occipital and frontal regions. fMRI showed altered activity in sensorimotor-related areas, especially the caudate nucleus, cerebellum, and thalamus. CONCLUSION: Acute sleep deprivation impairs postural stability by disrupting key nodes and networks involved in sensorimotor integration. This disruption manifests as reduced visual cortical excitability (affecting sensory input), weakened cognitive regulation within the frontoparietal network (impairing sensory processing and motor planning), and altered functional status of subcortical sensorimotor hubs (compromising motor coordination and feedback). These findings demonstrate that sleep deprivation compromises the neural circuitry governing the transformation of sensory information into appropriate motor outputs for balance control. This study provides comprehensive multimodal neuroimaging evidence for the neurobiological mechanisms linking insufficient sleep to impaired sensorimotor function.

NeurIPS Conference 2025 Conference Paper

Aeolus: A Multi-structural Flight Delay Dataset

  • Lin Xu
  • Xinyun Yuan
  • Yuxuan Liang
  • Suwan Yin
  • Yuankai Wu

We introduce Aeolus, a large-scale Multi-modal Flight Delay Dataset designed to advance research on flight delay prediction and support the development of foundation models for tabular data. Existing datasets in this domain are typically limited to flat tabular structures and fail to capture the spatiotemporal dynamics inherent in delay propagation. Aeolus addresses this limitation by providing three aligned modalities: (i) a tabular dataset with rich operational, meteorological, and airportlevel features for over 50 million flights; (ii) a flight chain module that models delay propagation along sequential flight legs, capturing upstream and downstream dependencies; and (iii) a flight network graph that encodes shared aircraft, crew, and airport resource connections, enabling cross-flight relational reasoning. The dataset is carefully constructed with temporal splits, comprehensive features, and strict leakage prevention to support realistic and reproducible machine learning evaluation. Aeolus supports a broad range of tasks, including regression, classification, temporal structure modeling, and graph learning, serving as a unified benchmark across tabular, sequential, and graph modalities. We release baseline experiments and preprocessing tools to facilitate adoption. Aeolus fills a key gap for both domain-specific modeling and general-purpose structured data research. Our source code and data can be accessed at https: //github. com/Flnny/Delay-data

YNIMG Journal 2025 Journal Article

Brain development during the lifespan of cynomolgus monkeys

  • Zhiqiang Tan
  • Binbin Nie
  • Huanhua Wu
  • Bang Li
  • Jingjie Shang
  • Tianhao Zhang
  • Zeyu Xiao
  • Chenchen Dong

F]FDG PET-MRI data from 228 healthy cynomolgus monkeys spanning the age range of 0.5-29.5 years to construct an age-specific multimodal image brain template toolset tailored to cynomolgus monkeys. Their brain volume and glucose metabolism were quantitatively analyzed by utilizing an individualized spatial segmentation algorithm. Our findings encapsulated the growth and development trends, sex differences, and asymmetrical variations in brain volume and glucose metabolism in cynomolgus monkeys, and analyzed the correlation between the brain volume and glucose metabolism. This endeavor enhances our capacity to leverage the cynomolgus monkey model in neuroscience research by providing a valuable resource for researchers. The age-specific brain template toolset and associated data offer a robust foundation for future investigations, facilitating a nuanced understanding of brain development in this primate species and, consequently, informing and advancing neuroscience research employing cynomolgus monkeys.

YNICL Journal 2024 Journal Article

The brain topological alterations in the structural connectome and correlations with clinical characteristics in type 1 narcolepsy

  • Huiqin Zhang
  • Lin Xu
  • Zhu Ai
  • Linlin Wang
  • Lu Wang
  • Lili Li
  • Ruilin Zhang
  • Rong Xue

OBJECTIVE: To explore topological alterations of white matter (WM) structural connectome, and their associations with clinical characteristics in type 1 narcolepsy (NT1). METHODS: 46 NT1 patients and 34 age- and sex-matched healthy controls were recruited for clinical data and diffusion tensor imaging collection. Using graph theory analysis, the topology metrics of structural connectome, rich club organization, and connectivity properties were compared between two groups. Furthermore, partial correlation analysis was performed between the network characteristics of 90 nodes or weakened edges and clinical data using Pearson or Spearman correlation, controlling by age and sex. RESULTS: Between-group comparison reflected that NT1 patients exhibited sleep disorders with comorbidities of impaired cognition and psychological problems. In patients, the global efficiency, local efficiency, and average clustering coefficient were significantly lower, whereas characteristic path length was larger compared to healthy control. Pertinently, nodal path length of left middle frontal gyrus was positively correlated with Pittsburgh Sleep Quality Index scores. The rich club analysis identified six affected nodes: bilateral dorsolateral superior frontal gyrus, bilateral supplementary motor area, left hippocampus, and left pallidum. Furthermore, six significantly weakened structural connections seeding from these rich club nodes have shown significant correlations with clinical index or polysomnography parameters. CONCLUSION: In NT1 patients, WM structural connectome has shown to be disrupted, which were primarily distributed in frontal-parietal cortex, subcortical regions, and particularly cingulate, potentially affecting their clinical manifestations.

AAAI Conference 2022 Conference Paper

OA-FSUI2IT: A Novel Few-Shot Cross Domain Object Detection Framework with Object-Aware Few-Shot Unsupervised Image-to-Image Translation

  • Lifan Zhao
  • Yunlong Meng
  • Lin Xu

Unsupervised image-to-image (UI2I) translation methods aim to learn a mapping between different visual domains with well-preserved content and consistent structure. It has been proven that the generated images are quite useful for enhancing the performance of computer vision tasks like object detection in a different domain with distribution discrepancies. Current methods require large amounts of images in both source and target domains for successful translation. However, data collection and annotations in many scenarios are infeasible or even impossible. In this paper, we propose an Object-Aware Few-Shot UI2I Translation (OA-FSUI2IT) framework to address the few-shot cross domain (FSCD) object detection task with limited unlabeled images in the target domain. To this end, we first introduce a discriminator augmentation (DA) module into the OA-FSUI2IT framework for successful few-shot UI2I translation. Then, we present a patch pyramid contrastive learning (PPCL) strategy to further improve the quality of the generated images. Last, we propose a self-supervised content-consistency (SSCC) loss to enforce the content-consistency in the translation. We implement extensive experiments to demonstrate the effectiveness of our OA-FSUI2IT framework for FSCD object detection and achieve state-of-the-art performance on the benchmarks of Normal-to-Foggy, Day-to-Night, and Cross-scene adaptation. The source code of our proposed method is also available at https: //github. com/emdata-ailab/FSCD-Det.

YNICL Journal 2020 Journal Article

Age-related atrophy of cortical thickness and genetic effect of ANK3 gene in first episode MDD patients

  • Yuqi Cheng
  • Jian Xu
  • Chenglong Dong
  • Zonglin Shen
  • Cong Zhou
  • Na Li
  • Yi Lu
  • Liuyi Ran

Brain ageing is thought to be related to geriatric depression, but the relationship between ageing and depression among middle aged individuals is unknown. The present study aimed to evaluate whether the age-related reduction of brain cortical thickness (CT) can be found in adult first-episode MDD patients, as well as to identify the possible genetic effect of the ANK3 gene polymorphism age-relates CT reduction. This study recruited 153 first-episode MDD patients with a disease duration < 2 years and 276 healthy controls (HC), and the CT of 68 whole brain regions and two ANK3 SNPs (rs1994336 and rs10994359) were analyzed. The results showed that although the CT of both groups was negative correlated with age, the MDD group had significant greater age-related decrease in CT than the HC group (–9. 35 × 10−3 mm/year for MDD vs. –1. 23 × 10−3 mm/year for HC in the left lateral orbitofrontal lobe). The multivariate analysis of covariance (MANCOVA) results yielded significant interactions of diagnosis × age, genotype × age and diagnosis × genotype interaction for rs10994359. In HC, the C allele showed a protective effect on age-related CT reduction. The reduction in CT with age was several times as greater in non-C carriers as in C carriers (–3. 54 × 10−3 vs. –0. 15 × 10−3 mm/year in left supramarginal gyrus) for HC. However, this protective effect disappeared in patients with MDD. We did not find a clear effect of rs1994336 on the age-related CT reduction. The findings indicate that the widespread accelerated brain ageing occurs early in adult-onset depression and this ageing may be a pathological mechanisms of depression rather than an outcome of the disease. The ANK3 rs10994359 polymorphism may partially affect regional cortical ageing in MDD.

AAAI Conference 2019 Conference Paper

End-to-End Knowledge-Routed Relational Dialogue System for Automatic Diagnosis

  • Lin Xu
  • Qixian Zhou
  • Ke Gong
  • Xiaodan Liang
  • Jianheng Tang
  • Liang Lin

Beyond current conversational chatbots or task-oriented dialogue systems that have attracted increasing attention, we move forward to develop a dialogue system for automatic medical diagnosis that converses with patients to collect additional symptoms beyond their self-reports and automatically makes a diagnosis. Besides the challenges for conversational dialogue systems (e. g. topic transition coherency and question understanding), automatic medical diagnosis further poses more critical requirements for the dialogue rationality in the context of medical knowledge and symptom-disease relations. Existing dialogue systems (Madotto, Wu, and Fung 2018; Wei et al. 2018; Li et al. 2017) mostly rely on datadriven learning and cannot be able to encode extra expert knowledge graph. In this work, we propose an End-to-End Knowledge-routed Relational Dialogue System (KR-DS) that seamlessly incorporates rich medical knowledge graph into the topic transition in dialogue management, and makes it cooperative with natural language understanding and natural language generation. A novel Knowledge-routed Deep Q-network (KR-DQN) is introduced to manage topic transitions, which integrates a relational refinement branch for encoding relations among different symptoms and symptomdisease pairs, and a knowledge-routed graph branch for topic decision-making. Extensive experiments on a public medical dialogue dataset show our KR-DS significantly beats stateof-the-art methods (by more than 8% in diagnosis accuracy). We further show the superiority of our KR-DS on a newly collected medical dialogue system dataset, which is more challenging retaining original self-reports and conversational data between patients and doctors.

IJCAI Conference 2019 Conference Paper

HorNet: A Hierarchical Offshoot Recurrent Network for Improving Person Re-ID via Image Captioning

  • Shiyang Yan
  • Jun Xu
  • Yuai Liu
  • Lin Xu

Person re-identification (re-ID) aims to recognize a person-of-interest across different cameras with notable appearance variance. Existing research works focused on the capability and robustness of visual representation. In this paper, instead, we propose a novel hierarchical offshoot recurrent network (HorNet) for improving person re-ID via image captioning. Image captions are semantically richer and more consistent than visual attributes, which could significantly alleviate the variance. We use the similarity preserving generative adversarial network (SPGAN) and an image captioner to fulfill domain transfer and language descriptions generation. Then the proposed HorNet can learn the visual and language representation from both the images and captions jointly, and thus enhance the performance of person re-ID. Extensive experiments are conducted on several benchmark datasets with or without image captions, i. e. , CUHK03, Market-1501, and Duke-MTMC, demonstrating the superiority of the proposed method. Our method can generate and extract meaningful image captions while achieving state-of-the-art performance.

YNIMG Journal 2019 Journal Article

Modular architecture of metabolic brain network and its effects on the spread of perturbation impact

  • Tianhao Zhang
  • Qi Huang
  • Chunxiang Jiao
  • Hua Liu
  • Binbin Nie
  • Shengxiang Liang
  • Panlong Li
  • Xi Sun

Metabolic brain network, which is based on functional correlation patterns of 18F-fluorodeoxyglucose (FDG) positron emission tomography (PET) images, has been widely applied in both basic and clinical neuroscience. Exploring the properties of the metabolic brain network can provide valuable insight to the physiologic and pathologic processes of the brain. Based on the network theory, modular architecture has the ability to limit the spread of local perturbation impact and therefore modular networks are more robust against external damage. However, whether the metabolic brain network has modular architecture remains unknown. Methods 77 rats performed 18F-FDG PET brain imaging. The metabolic brain network was then constructed by measuring interregional metabolic correlation in inter-subject manner. Afterwards, modular architecture of the network was detected by a greedy algorithm. Further, we perturbed the metabolic brain network by inducing focal photothrombotic ischemia in the bilateral motor cortex and then measured the glucose metabolic change of each brain region using FDG-PET. Results A significant modular architecture was found in the metabolic brain network. The network could be divided into four modules which corresponding approximately to executive, learning/memory, visual/auditory and sensorimotor processing functional domains. After inducing the focal ischemia on the bilateral motor cortex, most of the significantly changed brain regions (13 of 17) belong to the sensorimotor module. Conclusion Our results revealed an inherent modular architecture in the metabolic brain network and gave an experimental evidence that the modularity of the metabolism brain network could limit the spread of local perturbation impact.

AIJ Journal 2016 Journal Article

SATenstein: Automatically building local search SAT solvers from components

  • Ashiqur R. KhudaBukhsh
  • Lin Xu
  • Holger H. Hoos
  • Kevin Leyton-Brown

Designing high-performance solvers for computationally hard problems is a difficult and often time-consuming task. Although such design problems are traditionally solved by the application of human expertise, we argue instead for the use of automatic methods. In this work, we consider the design of stochastic local search (SLS) solvers for the propositional satisfiability problem (SAT). We first introduce a generalized, highly parameterized solver framework, dubbed SATenstein, that includes components drawn from or inspired by existing high-performance SLS algorithms for SAT. The parameters of SATenstein determine which components are selected and how these components behave; they allow SATenstein to instantiate many high-performance solvers previously proposed in the literature, along with trillions of novel solver strategies. We used an automated algorithm configuration procedure to find instantiations of SATenstein that perform well on several well-known, challenging distributions of SAT instances. Our experiments show that SATenstein solvers achieved dramatic performance improvements as compared to the previous state of the art in SLS algorithms; for many benchmark distributions, our new solvers also significantly outperformed all automatically tuned variants of previous state-of-the-art algorithms.

IJCAI Conference 2015 Conference Paper

Algorithm Runtime Prediction: Methods and Evaluation (Extended Abstract)

  • Frank Hutter
  • Lin Xu
  • Holger Hoos
  • Kevin Leyton-Brown

Perhaps surprisingly, it is possible to predict how long an algorithm will take to run on a previously unseen input, using machine learning techniques to build a model of the algorithm’s runtime as a function of problem-specific instance features. Such models have many important applications and over the past decade, a wide variety of techniques have been studied for building such models. In this extended abstract of our 2014 AI Journal article of the same title, we summarize existing models and describe new model families and various extensions. In a comprehensive empirical analyis using 11 algorithms and 35 instance distributions spanning a wide range of hard combinatorial problems, we demonstrate that our new models yield substantially better runtime predictions than previous approaches in terms of their generalization to new problem instances, to new algorithms from a parameterized space, and to both simultaneously.

AIJ Journal 2014 Journal Article

Algorithm runtime prediction: Methods & evaluation

  • Frank Hutter
  • Lin Xu
  • Holger H. Hoos
  • Kevin Leyton-Brown

Perhaps surprisingly, it is possible to predict how long an algorithm will take to run on a previously unseen input, using machine learning techniques to build a model of the algorithmʼs runtime as a function of problem-specific instance features. Such models have important applications to algorithm analysis, portfolio-based algorithm selection, and the automatic configuration of parameterized algorithms. Over the past decade, a wide variety of techniques have been studied for building such models. Here, we describe extensions and improvements of existing models, new families of models, and—perhaps most importantly—a much more thorough treatment of algorithm parameters as model inputs. We also comprehensively describe new and existing features for predicting algorithm runtime for propositional satisfiability (SAT), travelling salesperson (TSP) and mixed integer programming (MIP) problems. We evaluate these innovations through the largest empirical analysis of its kind, comparing to a wide range of runtime modelling techniques from the literature. Our experiments consider 11 algorithms and 35 instance distributions; they also span a very wide range of SAT, MIP, and TSP instances, with the least structured having been generated uniformly at random and the most structured having emerged from real industrial applications. Overall, we demonstrate that our new models yield substantially better runtime predictions than previous approaches in terms of their generalization to new problem instances, to new algorithms from a parameterized space, and to both simultaneously.

SAT Conference 2012 Conference Paper

Evaluating Component Solver Contributions to Portfolio-Based Algorithm Selectors

  • Lin Xu
  • Frank Hutter
  • Holger H. Hoos
  • Kevin Leyton-Brown

Abstract Portfolio-based methods exploit the complementary strengths of a set of algorithms and—as evidenced in recent competitions—represent the state of the art for solving many NP-hard problems, including SAT. In this work, we argue that a state-of-the-art method for constructing portfolio-based algorithm selectors, \(\texttt{SATzilla}\), also gives rise to an automated method for quantifying the importance of each of a set of available solvers. We entered a substantially improved version of \(\texttt{SATzilla}\) to the inaugural “analysis track” of the 2011 SAT competition, and draw two main conclusions from the results that we obtained. First, automatically-constructed portfolios of sequential, non-portfolio competition entries perform substantially better than the winners of all three sequential categories. Second, and more importantly, a detailed analysis of these portfolios yields valuable insights into the nature of successful solver designs in the different categories. For example, we show that the solvers contributing most to \(\texttt{SATzilla}\) were often not the overall best-performing solvers, but instead solvers that exploit novel solution strategies to solve instances that would remain unsolved without them.

AAAI Conference 2012 Conference Paper

Predicting Satisfiability at the Phase Transition

  • Lin Xu
  • Holger Hoos
  • Kevin Leyton-Brown

Uniform random 3-SAT at the solubility phase transition is one of the most widely studied and empirically hardest distributions of SAT instances. For 20 years, this distribution has been used extensively for evaluating and comparing algorithms. In this work, we demonstrate that simple rules can predict the solubility of these instances with surprisingly high accuracy. Specifically, we show how classification accuracies of about 70% can be obtained based on cheaply (polynomial-time) computable features on a wide range of instance sizes. We argue in two ways that classification accuracy does not decrease with instance size: first, we show that our models’ predictive accuracy remains roughly constant across a wide range of problem sizes; second, we show that a classifier trained on small instances is sufficient to achieve very accurate predictions across the entire range of instance sizes currently solvable by complete methods. Finally, we demonstrate that a simple decision tree based on only two features, and again trained only on the smallest instances, achieves predictive accuracies close to those of our most complex model. We conjecture that this twofeature model outperforms random guessing asymptotically; due to the model’s extreme simplicity, we believe that this conjecture is a worthwhile direction for future theoretical work.

AAAI Conference 2010 Conference Paper

Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection

  • Lin Xu
  • Holger Hoos
  • Kevin Leyton-Brown

The AI community has achieved great success in designing high-performance algorithms for hard combinatorial problems, given both considerable domain knowledge and considerable effort by human experts. Two influential methods aim to automate this process: automated algorithm configuration and portfolio-based algorithm selection. The former has the advantage of requiring virtually no domain knowledge, but produces only a single solver; the latter exploits per-instance variation, but requires a set of relatively uncorrelated candidate solvers. Here, we introduce Hydra, a novel technique for combining these two methods, thereby realizing the benefits of both. Hydra automatically builds a set of solvers with complementary strengths by iteratively configuring new algorithms. It is primarily intended for use in problem domains for which an adequate set of candidate solvers does not already exist. Nevertheless, we tested Hydra on a widely studied domain, stochastic local search algorithms for SAT, in order to characterize its performance against a well-established and highly competitive baseline. We found that Hydra consistently achieved major improvements over the best existing individual algorithms, and always at least roughly matched—and indeed often exceeded— the performance of the best portfolios of these algorithms.

IJCAI Conference 2009 Conference Paper

  • Ashiqur R. KhudaBukhsh
  • Lin Xu
  • Holger H. Hoos
  • Kevin Leyton-Brown

Designing high-performance algorithms for computationally hard problems is a difficult and often time-consuming task. In this work, we demonstrate that this task can be automated in the context of stochastic local search (SLS) solvers for the propositional satisfiability problem (SAT). We first introduce a generalised, highly parameterised solver framework, dubbed SATenstein, that includes components gleaned from or inspired by existing high-performance SLS algorithms for SAT. The parameters of SATenstein control the selection of components used in any specific instantiation and the behaviour of these components. SATenstein can be configured to instantiate a broad range of existing high-performance SLSbased SAT solvers, and also billions of novel algorithms. We used an automated algorithm configuration procedure to find instantiations of SATenstein that perform well on several well-known, challenging distributions of SAT instances. Overall, we consistently obtained significant improvements over the previously best-performing SLS algorithms, despite expending minimal manual effort. 1