Search arXivSearch

arXiv subjects

Xiang Zhao

Publications and source records attributed to Xiang Zhao.

At least 19 recordsLinked to original sources

MakoXC: Rearchitecting DFT Exchange-Correlation with Matrix-Aligned and Knowledge-Organized Sparsity

Density Functional Theory (DFT) is indispensable for materials science and drug discovery, yet the exchange--correlation (XC) evaluation remains a major bottleneck due to its cubic scaling. Although linear-scaling methods exploit electronic nearsightedness to reduce asymptotic complexity, they produce irregular sparse workloads that hide implicit sparsity and prevent efficient use of modern AI accelerators. We present MakoXC, a modular matrix-aligned XC evaluation engine that rearchitects nearsightedness-induced sparsity into regular, accelerator-friendly computations. MakoXC co-designs three key techniques: (1) Matrix-Aligned Cells reorganize nearsightedness-induced interactions into dense, accelerator-aligned data clusters; (2) Sparsity-Guided Activation translates deeper implicit sparsity into numerically correct structured execution for practical linear scaling; and (3) Kernel-Fused Pipeline consolidates fragmented workloads into a unified, compute-intensive execution path that fully unleashes accelerator throughput. Extensive evaluations show that MakoXC achieves average speedups of 67.8$\times$ speedup over standard XC evaluation and 4.7$\times$ over state-of-the-art linear-scaling methods. When integrated into a production-grade commercial DFT package, MakoXC scales XC evaluation to ubiquitin (1,231 atoms, def2-SVP) on 64 GPUs, enabling the end-to-end DFT calculation to complete in under five minutes. By restructuring XC evaluation into a unified, structured computation, MakoXC demonstrates how scientific workloads can achieve genuine low complexity while maximizing parallel efficiency on AI accelerators.

cs.DC

Panning for Gold: Expanding Domain-Specific Knowledge Graphs with General Knowledge

Domain-specific knowledge graphs (DKGs) are critical yet often suffer from limited coverage compared to General Knowledge Graphs (GKGs). Existing tasks to enrich DKGs rely primarily on extracting knowledge from external unstructured data or completing KGs through internal reasoning, but the scope and quality of such integration remain limited. This highlights a critical gap: little systematic exploration has been conducted on how comprehensive, high-quality GKGs can be effectively leveraged to supplement DKGs. To address this gap, we propose a new and practical task: domain-specific knowledge graph fusion (DKGF), which aims to mine and integrate relevant facts from general knowledge graphs into domain-specific knowledge graphs to enhance their completeness and utility. Unlike previous research, this new task faces two key challenges: (1) high ambiguity of domain relevance, i.e., difficulty in determining whether knowledge from a GKG is truly relevant to the target domain , and (2) cross-domain knowledge granularity misalignment, i.e., GKG facts are typically abstract and coarse-grained, whereas DKGs frequently require more contextualized, fine-grained representations aligned with particular domain scenarios. To address these, we present ExeFuse, a neuro-symbolic framework based on a novel Fact-as-Program paradigm. ExeFuse treats fusion as an executable process, utilizing neuro-symbolic execution to infer logical relevance beyond surface similarity and employing target space grounding to calibrate granularity. We construct new datasets to establish the first standardized evaluation suite for this task. Extensive experiments demonstrate that ExeFuse effectively overcomes domain barriers to achieve superior fusion performance.

cs.AI

Baryon-number-violating nucleon decays into a dark photon particle

Baryon-number-violating (BNV) nucleon decays into a light new particle represent an exciting yet experimentally unexplored frontier. In this work, we systematically study nucleon decays into a dark photon using a low-energy effective field theory extended with a dark photon $X$, referred to as $X$LEFT. We first construct a complete set of leading-order BNV $X$LEFT operators and then perform a systematic matching onto the chiral perturbation theory for operators involving light $u,d,s$ quarks that dominantly contribute to nucleon decays. Within the chiral framework, we derive general expressions for the decay widths of both two- and three-body nucleon decays and analyze the momentum distributions in the latter. Finally, we thoroughly reinterpret the existing experimental data on conventional two-body modes (into a lepton and a meson) to set lower bounds on partial lifetimes of the corresponding three-body modes involving an additional dark photon. These bounds allow us to further set stringent constraints on the $X$LEFT operators and other correlated decay modes. Our results provide a toolkit for future experimental and theoretical studies of these exotic nucleon decays.

hep-ph

Mechanical Analysis of Parachute Suspension Line Deployment with Binding Tapes Using PINN

Parachutes are widely utilized in aviation, aerospace and lifesaving missions. As the initial stage of parachute deployment, suspension line extraction and straightening directly determines the smooth implementation of subsequent inflation procedures. This ultra-short process involves intricate dynamic load variations. Most existing studies adopt numerical integration of ordinary differential equations to calculate line tension, yet this method fails to rapidly acquire tension values at arbitrary positions along suspension lines. This paper develops a physics-informed neural network (PINN) algorithm for tension prediction during line extraction and straightening, which outperforms traditional integration methods in both computational efficiency and numerical accuracy. Furthermore, the regulatory law of binding tape parameters on line dynamic tension is investigated. Comparative validations against flight test data and conventional numerical results verify the reliability and effectiveness of the proposed PINN framework.

cs.LG

Renormalization-group-improved constraints on dimension-7 baryon-number-violating operators

We study constraints on dimension-7 SMEFT baryon-number-violating operators from nucleon decays by incorporating full renormalization group (RG) running effects. At high new physics scales, we demonstrate that RG running effects help set stringent bounds on all 297 Wilson coefficients compared to the tree-level analysis in which only coefficients involving the first and second fermion generations could be constrained. Our findings highlight that the RG running effects through Yukawa mixings are particularly important for indirectly probing operators involving the second and third generation fermions.

hep-ph

Navigating Unreliable Parametric and Contextual Knowledge: Explicit Knowledge Conflict Resolution for LLM Inference

Large language models (LLMs) have achieved strong performance across a wide range of language-based tasks by leveraging both extensive parametric knowledge and in-context learning ability, enabling them to incorporate external information provided in the input prompt. However, the integration of external knowledge can introduce conflicts, not only between the model's internal parametric knowledge and the external information, but also among multiple pieces of external contexts. Existing approaches typically assume that either the model or the provided context is reliable, overlooking the possibility that both sources may contain errors, and avoid conflicts by privileging one source over the other, rather than actively resolving inconsistencies. To address these limitations, we propose a novel framework MACR for LLM knowledge conflict resolution that moves beyond the conventional binary choice paradigm and incorporates an explicit conflict-resolution mechanism based on a multi-agent reasoning approach. Specifically, we first propose an adaptive knowledge assessment and retrieval approach that employs a modified semantic entropy measure to quantify an LLM's confidence in its answer to a given query. Based on this confidence estimation, MACR either externalizes the model's internal knowledge as textual representations or retrieves relevant external knowledge when internal knowledge is insufficient, generating basic contexts for subsequent reasoning. Then we introduce an inductive multi-agent reasoning framework with three specialized agents that, respectively, induce explicit rules, analyze potential conflicts, and resolve inconsistencies across all available contexts. Empirical results demonstrate that MACR significantly outperforms state-of-the-art baselines across benchmarks, while also providing interpretable resolutions of explicit conflicts.

cs.AI

UniLab: A Heterogeneous Architecture for Robot RL Beyond GPU-Dominant Paradigms

Simulation-based RL for contemporary robot control is increasingly organized around GPU-resident simulation: physics, rollout collection, and learning are placed on a single GPU-centric execution path. This paradigm has greatly improved training speed, but it has also encouraged a default assumption that efficient training requires physics to reside on the GPU. We revisit this assumption. Our view is that, in simulation-dominated robot control, the essential question is not which processor runs physics, but whether simulation throughput, policy learning, and runtime synchronization form an efficient end-to-end loop. We present UniLab, a heterogeneous CPU-simulation / GPU-learning architecture that decouples CPU-parallel simulation from GPU policy updates through a unified runtime for data movement, buffering, and synchronization. UniLab is implemented as a complete and extensible training system using MuJoCoUni and MotrixSim CPU-batched physics backends, supporting PPO, FastSAC, FlashSAC, and APPO. On representative simulation-based robot control tasks, UniLab improves end-to-end training efficiency by 3--10$\times$ under the same hardware configuration, while reducing dependence on the NVIDIA CUDA-based software stack and supporting cross-platform execution on the Apple macOS platform and the AMD ROCm and Intel XPU accelerator backends. These results show that GPU simulation is an effective path to efficient training, but not a necessary one, broadening the practical system choices available for robot RL training. Project page: https://unilabsim.github.io.

cs.RO

QFT as a set of ODEs

Correlation functions of local operators in Quantum Field Theory (QFT) on hyperbolic space can be fully characterized by the set of QFT data $\lbrace Δ_i,C_{ijk},b^{\hat{\mathcal{O}}}_j\rbrace$. These are the scaling dimensions of boundary operators $Δ_i$, the boundary Operator Product Expansion (OPE) coefficients $C_{ijk}$ and the Boundary Operator Expansion (BOE) coefficients $b^{\hat{\mathcal{O}}}_j$ that characterize how each bulk operator $\hat{\mathcal{O}}$ can be expanded in terms of boundary operators $\mathcal{O}_j$.For simplicity, we focus on two dimensional QFTs and derive a universal set of first order Ordinary Differential Equations (ODEs) that encode the variation of the QFT data under an infinitesimal change of a bulk relevant coupling. In principle, our ODEs can be used to follow a Renormalization Group (RG) flow starting from a solvable QFT into a strongly coupled phase and to the flat space limit.

hep-th

DeepQuantum: A PyTorch-based Software Platform for Quantum Machine Learning and Photonic Quantum Computing

We introduce DeepQuantum, an open-source, PyTorch-based software platform for quantum machine learning and photonic quantum computing. This AI-enhanced framework enables efficient design and execution of hybrid quantum-classical models and variational quantum algorithms on both CPUs and GPUs. For photonic quantum computing, DeepQuantum implements Fock, Gaussian, and Bosonic backends, catering to different simulation needs. To our knowledge, it is the first framework to realize closed-loop integration of three paradigms of quantum computing, namely quantum circuits, photonic quantum circuits, and measurement-based quantum computing, thereby enabling robust support for both specialized and universal photonic quantum algorithm design. Furthermore, DeepQuantum supports large-scale simulations based on tensor network techniques and a distributed parallel computing architecture. We demonstrate these capabilities through comprehensive benchmarks and illustrative examples. With its unique features, DeepQuantum is intended to be a powerful platform for both AI for Quantum and Quantum for AI.

quant-ph

Meituan Merchant Business Diagnosis via Policy-Guided Dual-Process User Simulation

Simulating group-level user behavior enables scalable counterfactual evaluation of merchant strategies without costly online experiments. However, building a trustworthy simulator faces two structural challenges. First, information incompleteness causes reasoning-based simulators to over-rationalize when unobserved factors such as offline context and implicit habits are missing. Second, mechanism duality requires capturing both interpretable preferences and implicit statistical regularities, which no single paradigm achieves alone. We propose Policy-Guided Hybrid Simulation (PGHS), a dual-process framework that mines transferable decision policies from behavioral trajectories and uses them as a shared alignment layer. This layer anchors an LLM-based reasoning branch that prevents over-rationalization and an ML-based fitting branch that absorbs implicit regularities. Group-level predictions from both branches are fused for complementary correction. We deploy PGHS on Meituan with 101 merchants and over 26,000 trajectories. PGHS achieves a group simulation error of 8.80%, improving over the best reasoning-based and fitting-based baselines by 45.8% and 40.9% respectively.

cs.AI

Nucleon decays into three leptons: contact contributions

Baryon number violating (BNV) nucleon decays into three leptons provide a unique probe of BNV interactions beyond the conventional two-body modes involving a single lepton and a light meson. In a previous work [Nucleon decays into three leptons: noncontact contributions, arXiv:2512.02692.], two of us analyzed the noncontact contributions to these decays arising from dimension-6 (dim-6) operators within the low-energy effective field theory (LEFT), and found that they are severely suppressed due to stringent constraints on these dim-6 operators. In this work, we continue this endeavor by systematically investigating the contact contributions originating from dim-9 LEFT operators. We construct a complete basis of dim-9 operators relevant to these processes, and subsequently match them onto chiral perturbation theory to calculate their decay widths. By employing existing experimental data, we derive stringent constraints on the relevant operators. In addition, we present the analysis of an ultraviolet-complete model to demonstrate its connection with our theoretical framework, thereby facilitating further studies of these exotic nucleon decays in upcoming neutrino experiments with large fiducial masses.

hep-ph

STDDN: A Physics-Guided Deep Learning Framework for Crowd Simulation

Accurate crowd simulation is crucial for public safety management, emergency evacuation planning, and intelligent transportation systems. However, existing methods, which typically model crowds as a collection of independent individual trajectories, are limited in their ability to capture macroscopic physical laws. This microscopic approach often leads to error accumulation and compromises simulation stability. Furthermore, deep learning-driven methods tend to suffer from low inference efficiency and high computational overhead, making them impractical for large-scale, efficient simulations. To address these challenges, we propose the Spatio-Temporal Decoupled Differential Equation Network (STDDN), a novel framework that guides microscopic trajectory prediction with macroscopic physics. We innovatively introduce the continuity equation from fluid dynamics as a strong physical constraint. A Neural Ordinary Differential Equation (Neural ODE) is employed to model the macroscopic density evolution driven by individual movements, thereby physically regularizing the microscopic trajectory prediction model. We design a density-velocity coupled dynamic graph learning module to formulate the derivative of the density field within the Neural ODE, effectively mitigating error accumulation. We also propose a differentiable density mapping module to eliminate discontinuous gradients caused by discretization and introduce a cross-grid detection module to accurately model the impact of individual cross-grid movements on local density changes. The proposed STDDN method has demonstrated significantly superior simulation performance compared to state-of-the-art methods on long-term tasks across four real-world datasets, as well as a major reduction in inference latency.

cs.LG

Locality constraints in AdS$_2$ without parity

We study bulk locality constraints in quantum field theories in AdS$_2$. The known derivation of locality sum rules in AdS$_{d+1}$ does not apply for $d=1$ due to the different singularity structure of the conformal blocks and the inequivalence of operator orderings on the boundary. Assuming unitarity and a mild growth condition, we establish power-law bounds for correlators, derive dispersion relations and an expansion in terms of ``even'' and ``odd'' local blocks that converges in the entire AdS$_2$. These yield two novel families of symmetric and antisymmetric locality sum rules. We test these sum rules explicitly in the free scalar field theory.

hep-th

Lepton flavor of four-fermion operator and fermion portal dark matter

We study the ultraviolet realization of semileptonic four-fermion operator $O_{ledq}^{αβ11}$ that incorporates Majorana dark matter (DM) in both lepton-flavor-conserving (LFC) and lepton-flavor-violating (LFV) scenarios at the one-loop level via box diagram, which effectively alleviates the lower bounds on the new physics scale. The interplay between the model-independent constraints on the Wilson coefficients and DM direct detection, relic density, and collider searches in the context of fermion portal DM model with two mediators is investigated. We find that both the projected future constraint on the LFC Wilson coefficient $C_{ledq}^{2211}/Λ^2< (12.3~\text{TeV})^{-2}$ from the measurements of neutrino non-standard interaction in the next-generation neutrino oscillation experiments, and LFV constraint $C_{ledq}^{1211}/Λ^2< \left(2.2\times 10^3~\text{TeV} \right)^{-2}$ from ongoing charged-lepton-flavor-violation searches, provide a complementary exploration of the parameter space encompassing the DM mass and scalar mass. With the colored mediator mass typically around $2~\text{TeV}$, the sensitivity of the indirect constraints on the four-fermion operator could surpass those of collider searches and DM direct detection, in scenarios where the masses of the DM and scalar are close. By ensuring the correct DM relic density, however, we obtain that the collider searches and DM direct detection are more sensitive to the electroweak scale DM and scalar compared to the indirect constraints.

hep-ph

Prism: Towards Lowering User Cognitive Load in LLMs via Complex Intent Understanding

Large Language Models are rapidly emerging as web-native interfaces to social platforms. On the social web, users frequently have ambiguous and dynamic goals, making complex intent understanding-rather than single-turn execution-the cornerstone of effective human-LLM collaboration. Existing approaches attempt to clarify user intents through sequential or parallel questioning, yet they fall short of addressing the core challenge: modeling the logical dependencies among clarification questions. Inspired by the Cognitive Load Theory, we propose Prism, a novel framework for complex intent understanding that enables logically coherent and efficient intent clarification. Prism comprises four tailored modules: a complex intent decomposition module, which decomposes user intents into smaller, well-structured elements and identifies logical dependencies among them; a logical clarification generation module, which organizes clarification questions based on these dependencies to ensure coherent, low-friction interactions; an intent-aware reward module, which evaluates the quality of clarification trajectories via an intent-aware reward function and leverages Monte Carlo Sample to simulate user-LLM interactions for large-scale,high-quality training data generation; and a self-evolved intent tuning module, which iteratively refines the LLM's logical clarification capability through data-driven feedback and optimization. Prism consistently outperforms existing approaches across clarification interactions, intent execution, and cognitive load benchmarks. It achieves stateof-the-art logical consistency, reduces logical conflicts to 11.5%, increases user satisfaction by 14.4%, and decreases task completion time by 34.8%. All data and code are released.

cs.AI

Enhancing Microwave Heating Uniformity in Cavities Using a 2-bit Coding Metasurface

A novel method for enhancing microwave heating uniformity using a 2-bit coding metasurface is proposed. This metasurface is specially designed to scatter incident waves into multiple directions at 2.45 GHz rather than just one, significantly improving the electric field distribution uniformity within a cavity, and eliminating the need to redesign the cavity itself or modify the power excitation. Simulated results demonstrate a reduction in the coefficient of variation (COV) of potato temperature from 0.694 to 0.461, indicating enhanced heating uniformity while maintaining efficiency. Additionally, the measured potato temperatures show excellent agreement with the simulated results, validating the effectiveness of the proposed method.

physics.app-ph

WaveOrder: A differentiable wave-optical framework for scalable biological microscopy with diverse modalities

Correlative computational microscopy can accelerate imaging and modeling of cellular dynamics by relaxing trade-offs inherent to dynamic imaging. Existing computational microscopy frameworks are either specialized or overly generic, limiting use to fixed configurations or domain experts. We introduce WaveOrder, a generalist wave-optical framework for imaging the architectural order of biomolecules. WaveOrder reconstructs diverse specimen properties from multi-channel acquisitions, with or without fluorescence. It provides a unified representation of linear optical properties and differentiable physics-based image formation models spanning widefield, confocal, light-sheet, and oblique label-free geometries. WaveOrder uses physics-informed ML to auto-tune model parameters and solve blind shift-variant restoration problems. This open-source, PyTorch-based framework enables scalable quantitative imaging across scales from organelles to adult zebrafish, and improves restoration of cellular structures in high-throughput experiments. We validate WaveOrder on diverse imaging applications, demonstrating its ability to recover biomolecular structure beyond the limits of existing approaches.

physics.optics

Adaptive almost full recovery in sparse nonparametric models

We observe an unknown function of $d$ variables $f(\boldsymbol{t})$, $\boldsymbol{t} \in[0,1]^d$, in the Gaussian white noise model of intensity $\varepsilon>0$. We assume that the function $f$ is regular and that it is a sum of $k$-variate functions, where $k$ varies from $1$ to $s$ ($1\leq s\leq d$). These functions are unknown to us and only a few of them are nonzero. In this article, we address the problem of identifying the nonzero function components of $f$ almost fully in the case when $d=d_\varepsilon\to \infty$ as $\varepsilon\to 0$ and $s$ is either fixed or $s=s_\varepsilon\to \infty$, $s=o(d)$ as $\varepsilon\to 0$. This may be viewed as a variable selection problem. We derive the conditions when almost full variable selection in the model at hand is possible and provide a selection procedure that achieves this type of selection. The procedure is adaptive to the level of sparsity described by the sparsity index $β\in(0,1)$. We also derive conditions that make almost full variable selection in the model of our interest impossible. In view of these conditions, the proposed selector is seen to perform asymptotically optimal. The theoretical findings are illustrated numerically.

math.ST