arXiv subjects

Meng Xiao

Publications and source records attributed to Meng Xiao.

At least 37 records · Page 2Linked to original sources

arXiv2025

Observation of Fully Flat Bands in a Photonic Dipolar Kagome Lattice

Flat bands, characterized by zero group velocity and strong energy localization, enable interaction-enhanced phenomena across both quantum and classical systems. Existing photonic flat-band implementations were limited to evanescent-wave systems, specific lattice symmetries, or complex supercell modulations. A simple, universal, and efficient approach to realizing flat bands without dedicated source excitation is to be explored. Here, inspired by geometrically frustrated configurations, we theoretically proposed and experimentally demonstrated threefold-degenerate flat bands by integrating orbital and rotational degrees of freedom in a photonic dipolar kagome lattice. By rotating the dipole orientation, the system exhibits a band flip transition at which point all bands achieve complete flatness and degeneracy across the entire Brillouin zone. In contrast to conventional s-orbital kagome lattices with only a single flat band, our approach flattens the entire band structure, eliminating dispersive modes and enabling compatibility with arbitrary excitations. These results establish a new mechanism for flat-band engineering, offering a tunable strategy for enhancing light-matter interactions and may have applications in compact photonic devices and energy-efficient information processing.

physics.optics↗

arXiv2025

Knowledge-Guided Biomarker Identification for Label-Free Single-Cell RNA-Seq Data: A Reinforcement Learning Perspective

Gene panel selection aims to identify the most informative genomic biomarkers in label-free genomic datasets. Traditional approaches, which rely on domain expertise, embedded machine learning models, or heuristic-based iterative optimization, often introduce biases and inefficiencies, potentially obscuring critical biological signals. To address these challenges, we present an iterative gene panel selection strategy that harnesses ensemble knowledge from existing gene selection algorithms to establish preliminary boundaries or prior knowledge, which guide the initial search space. Subsequently, we incorporate reinforcement learning through a reward function shaped by expert behavior, enabling dynamic refinement and targeted selection of gene panels. This integration mitigates biases stemming from initial boundaries while capitalizing on RL's stochastic adaptability. Comprehensive comparative experiments, case studies, and downstream analyses demonstrate the effectiveness of our method, highlighting its improved precision and efficiency for label-free biomarker discovery. Our results underscore the potential of this approach to advance single-cell genomics data analysis.

q-bio.GN↗

arXiv2025

Observation of Arbitrarily Configurable Nonlinear Topological Modes

Nonlinear topology is an emerging field that combines the intrinsic reconfigurability of nonlinear systems with the robustness of topological protection, offering fertile ground for unconventional phenomena and novel applications. Recently, arbitrarily configurable nonlinear topological modes (ANTMs) were proposed, enabling wavefunctions to be configured into arbitrary profiles , and offering greatly enhanced capacity for topological modes and high-throughput topological transport. Here we present the first direct experimental demonstration of ANTMs . These nonlinear topological modes are robust against disorder while also being continuously reshaped and reconfigured in real time through external control. These counterintuitive properties highlight the versatility of arbitrarily morphing nonlinear topological modes and pave the way for highly adaptable topological devices capable of operating reliably across diverse application scenarios, including those involving imperfections, signal variability, and dynamic conditions.

physics.optics↗

arXiv2025

Soft Graph Clustering for single-cell RNA Sequencing Data

Clustering analysis is fundamental in single-cell RNA sequencing (scRNA-seq) data analysis for elucidating cellular heterogeneity and diversity. Recent graph-based scRNA-seq clustering methods, particularly graph neural networks (GNNs), have significantly improved in tackling the challenges of high-dimension, high-sparsity, and frequent dropout events that lead to ambiguous cell population boundaries. However, their reliance on hard graph constructions derived from thresholded similarity matrices presents challenges:(i) The simplification of intercellular relationships into binary edges (0 or 1) by applying thresholds, which restricts the capture of continuous similarity features among cells and leads to significant information loss.(ii) The presence of significant inter-cluster connections within hard graphs, which can confuse GNN methods that rely heavily on graph structures, potentially causing erroneous message propagation and biased clustering outcomes. To tackle these challenges, we introduce scSGC, a Soft Graph Clustering for single-cell RNA sequencing data, which aims to more accurately characterize continuous similarities among cells through non-binary edge weights, thereby mitigating the limitations of rigid data structures. The scSGC framework comprises three core components: (i) a zero-inflated negative binomial (ZINB)-based feature autoencoder; (ii) a dual-channel cut-informed soft graph embedding module; and (iii) an optimal transport-based clustering optimization module. Extensive experiments across ten datasets demonstrate that scSGC outperforms 13 state-of-the-art clustering models in clustering accuracy, cell type annotation, and computational efficiency. These results highlight its substantial potential to advance scRNA-seq data analysis and deepen our understanding of cellular heterogeneity.

cs.LG↗

arXiv2025

Reinforcement Learning-based Feature Generation Algorithm for Scientific Data

Feature generation (FG) aims to enhance the prediction potential of original data by constructing high-order feature combinations and removing redundant features. It is a key preprocessing step for tabular scientific data to improve downstream machine-learning model performance. Traditional methods face the following two challenges when dealing with the feature generation of scientific data: First, the effective construction of high-order feature combinations in scientific data necessitates profound and extensive domain-specific expertise. Secondly, as the order of feature combinations increases, the search space expands exponentially, imposing prohibitive human labor consumption. Advancements in the Data-Centric Artificial Intelligence (DCAI) paradigm have opened novel avenues for automating feature generation processes. Inspired by that, this paper revisits the conventional feature generation workflow and proposes the Multi-agent Feature Generation (MAFG) framework. Specifically, in the iterative exploration stage, multi-agents will construct mathematical transformation equations collaboratively, synthesize and identify feature combinations ex-hibiting high information content, and leverage a reinforcement learning mechanism to evolve their strategies. Upon completing the exploration phase, MAFG integrates the large language models (LLMs) to interpreta-tively evaluate the generated features of each significant model performance breakthrough. Experimental results and case studies consistently demonstrate that the MAFG framework effectively automates the feature generation process and significantly enhances various downstream scientific data mining tasks.

cs.LG↗

arXiv2025

Simplified Template Cross Sections -- Stage 1.1 and 1.2

Simplified Template Cross Sections (STXS) have been adopted by the LHC experiments as a common framework for Higgs measurements. Their purpose is to reduce the theoretical uncertainties that are directly folded into the measurements as much as possible, while at the same time allowing for the combination of the measurements between different decay channels as well as between experiments. We report the complete, revised definition of the STXS kinematic bins (stage 1.1 and stage 1.2), which have been used for the measurements by the ATLAS and CMS experiments using the full LHC Run 2 datasets. The main focus is on the four dominant Higgs production processes, namely gluon-fusion, vector-boson fusion, production in association with a vector boson and in association with a $t\bar t$ pair. We also comment briefly on the treatment of other production modes.

hep-ph↗

arXiv2025

SciHorizon: Benchmarking AI-for-Science Readiness from Scientific Data to Large Language Models

In recent years, the rapid advancement of Artificial Intelligence (AI) technologies, particularly Large Language Models (LLMs), has revolutionized the paradigm of scientific discovery, establishing AI-for-Science (AI4Science) as a dynamic and evolving field. However, there is still a lack of an effective framework for the overall assessment of AI4Science, particularly from a holistic perspective on data quality and model capability. Therefore, in this study, we propose SciHorizon, a comprehensive assessment framework designed to benchmark the readiness of AI4Science from both scientific data and LLM perspectives. First, we introduce a generalizable framework for assessing AI-ready scientific data, encompassing four key dimensions: Quality, FAIRness, Explainability, and Compliance-which are subdivided into 15 sub-dimensions. Drawing on data resource papers published between 2018 and 2023 in peer-reviewed journals, we present recommendation lists of AI-ready datasets for Earth, Life, and Materials Sciences, making a novel and original contribution to the field. Concurrently, to assess the capabilities of LLMs across multiple scientific disciplines, we establish 16 assessment dimensions based on five core indicators Knowledge, Understanding, Reasoning, Multimodality, and Values spanning Mathematics, Physics, Chemistry, Life Sciences, and Earth and Space Sciences. Using the developed benchmark datasets, we have conducted a comprehensive evaluation of over 50 representative open-source and closed source LLMs. All the results are publicly available and can be accessed online at www.scihorizon.cn/en.

cs.LG↗

arXiv2025

Characterization of higher-order topological superconductors using Bott indices

The abundance of bulk and boundary topologies in higher-order topological phases offer remarkable tunability and diversity to boundary states but also pose a challenge to their unified topological characterization. In this work, we propose a theoretical framework to characterize time-reversal invariant topological superconductors hosting Majorana Kramers pairs (MKP) of corner states by using a series of spin Bott indices, which capture both bulk and boundary states topology. The developed invariants can characterize MKP in arbitrarily shaped systems and all distinct spatial distribution patterns of MKP. As an illustrative example, we apply our theory to analyze the Kane-Mele model with sublattice-dependent superconducting pairing potentials. In this representative model, both intrinsic and extrinsic higher-order topological superconductors can be realized and various patterns of MKP can be engineered through edge cleavage. Despite their high sensitivity to boundary terminations, MKP can be faithfully characterized by the proposed topological invariants. We further demonstrate the characterization of higher-order topological superconductors in the BDI symmetry class using Bott indices without resolving the spin degree of freedom.

cond-mat.supr-con↗

arXiv2025

GCAL: Adapting Graph Models to Evolving Domain Shifts

This paper addresses the challenge of graph domain adaptation on evolving, multiple out-of-distribution (OOD) graphs. Conventional graph domain adaptation methods are confined to single-step adaptation, making them ineffective in handling continuous domain shifts and prone to catastrophic forgetting. This paper introduces the Graph Continual Adaptive Learning (GCAL) method, designed to enhance model sustainability and adaptability across various graph domains. GCAL employs a bilevel optimization strategy. The "adapt" phase uses an information maximization approach to fine-tune the model with new graph domains while re-adapting past memories to mitigate forgetting. Concurrently, the "generate memory" phase, guided by a theoretical lower bound derived from information bottleneck theory, involves a variational memory graph generation module to condense original graphs into memories. Extensive experimental evaluations demonstrate that GCAL substantially outperforms existing methods in terms of adaptability and knowledge retention.

cs.LG↗

arXiv2025

COMAE: COMprehensive Attribute Exploration for Zero-shot Hashing

Zero-shot hashing (ZSH) has shown excellent success owing to its efficiency and generalization in large-scale retrieval scenarios. While considerable success has been achieved, there still exist urgent limitations. Existing works ignore the locality relationships of representations and attributes, which have effective transferability between seeable classes and unseeable classes. Also, the continuous-value attributes are not fully harnessed. In response, we conduct a COMprehensive Attribute Exploration for ZSH, named COMAE, which depicts the relationships from seen classes to unseen ones through three meticulously designed explorations, i.e., point-wise, pair-wise and class-wise consistency constraints. By regressing attributes from the proposed attribute prototype network, COMAE learns the local features that are relevant to the visual attributes. Then COMAE utilizes contrastive learning to comprehensively depict the context of attributes, rather than instance-independent optimization. Finally, the class-wise constraint is designed to cohesively learn the hash code, image representation, and visual attributes more effectively. Experimental results on the popular ZSH datasets demonstrate that COMAE outperforms state-of-the-art hashing techniques, especially in scenarios with a larger number of unseen label classes.

cs.CV↗

arXiv2025

Collaborative Multi-Agent Reinforcement Learning for Automated Feature Transformation with Graph-Driven Path Optimization

Feature transformation methods aim to find an optimal mathematical feature-feature crossing process that generates high-value features and improves the performance of downstream machine learning tasks. Existing frameworks, though designed to mitigate manual costs, often treat feature transformations as isolated operations, ignoring dynamic dependencies between transformation steps. To address the limitations, we propose TCTO, a collaborative multi-agent reinforcement learning framework that automates feature engineering through graph-driven path optimization. The framework's core innovation lies in an evolving interaction graph that models features as nodes and transformations as edges. Through graph pruning and backtracking, it dynamically eliminates low-impact edges, reduces redundant operations, and enhances exploration stability. This graph also provides full traceability to empower TCTO to reuse high-utility subgraphs from historical transformations. To demonstrate the efficacy and adaptability of our approach, we conduct comprehensive experiments and case studies, which show superior performance across a range of datasets.

cs.LG↗

arXiv2025

DynMoLE: Boosting Mixture of LoRA Experts Fine-Tuning with a Hybrid Routing Mechanism

Instruction-based fine-tuning of large language models (LLMs) has achieved remarkable success in various natural language processing (NLP) tasks. Parameter-efficient fine-tuning (PEFT) methods, such as Mixture of LoRA Experts (MoLE), combine the efficiency of Low-Rank Adaptation (LoRA) with the versatility of Mixture of Experts (MoE) models, demonstrating significant potential for handling multiple downstream tasks. However, the existing routing mechanisms for MoLE often involve a trade-off between computational efficiency and predictive accuracy, and they fail to fully address the diverse expert selection demands across different transformer layers. In this work, we propose DynMoLE, a hybrid routing strategy that dynamically adjusts expert selection based on the Tsallis entropy of the router's probability distribution. This approach mitigates router uncertainty, enhances stability, and promotes more equitable expert participation, leading to faster convergence and improved model performance. Additionally, we introduce an auxiliary loss based on Tsallis entropy to further guide the model toward convergence with reduced uncertainty, thereby improving training stability and performance. Our extensive experiments on commonsense reasoning benchmarks demonstrate that DynMoLE achieves substantial performance improvements, outperforming LoRA by 9.6% and surpassing the state-of-the-art MoLE method, MoLA, by 2.3%. We also conduct a comprehensive ablation study to evaluate the contributions of DynMoLE's key components.

cs.CL↗

arXiv2025

Large Language Model Agent: A Survey on Methodology, Applications and Challenges

The era of intelligent agents is upon us, driven by revolutionary advancements in large language models. Large Language Model (LLM) agents, with goal-driven behaviors and dynamic adaptation capabilities, potentially represent a critical pathway toward artificial general intelligence. This survey systematically deconstructs LLM agent systems through a methodology-centered taxonomy, linking architectural foundations, collaboration mechanisms, and evolutionary pathways. We unify fragmented research threads by revealing fundamental connections between agent design principles and their emergent behaviors in complex environments. Our work provides a unified architectural perspective, examining how agents are constructed, how they collaborate, and how they evolve over time, while also addressing evaluation methodologies, tool applications, practical challenges, and diverse application domains. By surveying the latest developments in this rapidly evolving field, we offer researchers a structured taxonomy for understanding LLM agents and identify promising directions for future research. The collection is available at https://github.com/luo-junyu/Awesome-Agent-Papers.

cs.CL↗

arXiv2025

FastFT: Accelerating Reinforced Feature Transformation via Advanced Exploration Strategies

Feature Transformation is crucial for classic machine learning that aims to generate feature combinations to enhance the performance of downstream tasks from a data-centric perspective. Current methodologies, such as manual expert-driven processes, iterative-feedback techniques, and exploration-generative tactics, have shown promise in automating such data engineering workflow by minimizing human involvement. However, three challenges remain in those frameworks: (1) It predominantly depends on downstream task performance metrics, as assessment is time-consuming, especially for large datasets. (2) The diversity of feature combinations will hardly be guaranteed after random exploration ends. (3) Rare significant transformations lead to sparse valuable feedback that hinders the learning processes or leads to less effective results. In response to these challenges, we introduce FastFT, an innovative framework that leverages a trio of advanced strategies.We first decouple the feature transformation evaluation from the outcomes of the generated datasets via the performance predictor. To address the issue of reward sparsity, we developed a method to evaluate the novelty of generated transformation sequences. Incorporating this novelty into the reward function accelerates the model's exploration of effective transformations, thereby improving the search productivity. Additionally, we combine novelty and performance to create a prioritized memory buffer, ensuring that essential experiences are effectively revisited during exploration. Our extensive experimental evaluations validate the performance, efficiency, and traceability of our proposed framework, showcasing its superiority in handling complex feature transformation tasks.

cs.LG↗

arXiv2025

Topological Degeneracy Induced by Twisting

In recent years, twisting has emerged as a new degree of freedom that plays an increasingly important role in Bloch bands of various physical systems. However, there is currently a lack of reports on the non-trivial physics of topological degeneracy in twisted systems. In this work, we investigated the intrinsic physical correlation between twisting and topological degeneracy. We found that twisting not only breaks the symmetry of the system but also introduces topological degeneracy that does not exist under the original symmetric system without twisting. Furthermore, the topological degeneracy can be easily tuned through twisting. This new twist-induced topological degeneracy gives rise to a unique polarization-degenerate birefringent medium, wherein the twist angle acts as a novel degree of freedom for dispersion and polarization management of interface states. Exhibiting fascinating properties and experimental feasibilities, our work points to new possibilities in the research of various topological physics in twisted photonics.

physics.optics↗

arXiv2025

Extracting $α_\mathrm{S}$ at future $e^+e^{-}$ Higgs factory with energy correlators

The prospected sensitivity in $α_\mathrm{S}$ determination using an event shape observable, ratio of energy correlators at future electron-positron colliders is presented. The study focuses on the collinear region which has suffered from large theoretical and hadronization uncertainty in the past. The ratio effectively reduces the impacts of the uncertainties. With the amount of data that future electron-positron colliders could produce in 1 minute (40 $\text{pb}^{-1}$), a 1--2\% precision of $α_\mathrm{S}$ could be reached depending on the hadronization uncertainty considered.

hep-ph↗

arXiv2025

A comprehensive review on developments of synthetic dimensions

The concept of synthetic dimensions has emerged as a powerful framework in photonics and atomic physics, enabling the exploration of high-dimensional physics beyond conventional spatial constraints. Originally developed for quantum simulations in high dimensions, synthetic dimensions have since demonstrated advantages in designing novel Hamiltonians and manipulating quantum or optical states for exploring topological physics, and for applications in computing and information processing. Here we provide a comprehensive overview of progress in synthetic dimensions across photonic, atomic, and other physical platforms over the past decade. We showcase different approaches used to construct synthetic dimensions and highlight key physical phenomena enabled by the advantage of such a framework. By offering a unified perspective on developments in this field, we aim to provide insights into how synthetic dimensions can bridge fundamental physics and applied technologies, fostering interdisciplinary engagement in quantum simulation, atomic and photonic engineering, and information processing.

physics.optics↗

arXiv2025

Towards Continuous Reuse of Graph Models via Holistic Memory Diversification

This paper addresses the challenge of incremental learning in growing graphs with increasingly complex tasks. The goal is to continuously train a graph model to handle new tasks while retaining proficiency in previous tasks via memory replay. Existing methods usually overlook the importance of memory diversity, limiting in selecting high-quality memory from previous tasks and remembering broad previous knowledge within the scarce memory on graphs. To address that, we introduce a novel holistic Diversified Memory Selection and Generation (DMSG) framework for incremental learning in graphs, which first introduces a buffer selection strategy that considers both intra-class and inter-class diversities, employing an efficient greedy algorithm for sampling representative training nodes from graphs into memory buffers after learning each new task. Then, to adequately rememorize the knowledge preserved in the memory buffer when learning new tasks, a diversified memory generation replay method is introduced. This method utilizes a variational layer to generate the distribution of buffer node embeddings and sample synthesized ones for replaying. Furthermore, an adversarial variational embedding learning method and a reconstruction-based decoder are proposed to maintain the integrity and consolidate the generalization of the synthesized node embeddings, respectively. Extensive experimental results on publicly accessible datasets demonstrate the superiority of \method{} over state-of-the-art methods.

cs.LG↗