arXiv subjects

Jie Lu

Publications and source records attributed to Jie Lu.

At least 19 recordsLinked to original sources

arXiv2026

The semileptonic decays of $Ω_{b}^{}$, $Σ_{b}^{}$ and $Ξ_{b}^{\prime*}$ baryons

In this article, we employ the QCD sum rules basing on three-point correlation function to systematically analyze the transition form factors for the semileptonic decays of the spin $\frac{3}{2}^{+}$ bottom baryons ($Ω_{b}^{*}$, $Σ_{b}^{*}$, and $Ξ_{b}^{\prime *}$) to their corresponding spin $\frac{1}{2}^{+}$ charmed partners. On the phenomenological side, we eliminate the contaminations of the baryons with negative parity and those with lower spin states. The operator product expansion is carried out up to dimension-six condensates, including the perturbative part, quark condensate $\langle \bar{q} q\rangle$, gluon condensate $\langle g_{s}^{2}GG\rangle$, mixed condensate $\langle \bar{q} g_{s}σGq\rangle$, and four-quark condensates $\langle \bar{q} q\rangle^{2}$ and $g_{s}^{2}\langle \bar{q} q\rangle^{2}$. The form factors are evaluated in the space-like region and then are fitted into the time-like physical region via a $z$-series expansion approach. Finally, the semileptonic decay widths for $Ω_{b}^{*}$, $Σ_{b}^{*}$ and $Ξ_{b}^{\prime*}$ baryons are calculated with our predicted form factors, and various polarization observables are also predicted. The predicted results in this work are compared with those predicted by other collaborations, and are expected to be useful for studying the properties of these singly heavy baryons.

hep-ph↗

arXiv2026

The Sirens' Song: When Proximal Background Context Overshadows Distant Evidence

Long-context LLMs focus on retrieving distant evidence from extensive context, yet existing work has largely focused on overcoming distance alone. In this work, we identify the Proximity Trap, insufficient attention to distant evidence often arises less from distance itself than from cumulative competition with abundant, task-irrelevant proximal background. To address the Proximity Trap, we introduce LYRA (Long-context heavY-tailed Relevance Alignment), a t-distributed directional matching mechanism that reshapes the context retrieval distribution, directing more attention mass toward task-relevant evidence, while preserving the relative positional information encoded. Extensive experiments on LongBench-v2, RULER, and LongBench demonstrate consistent improvements across context lengths and task categories. We further introduce ProxBench, a multi-level fine-grained benchmark for evaluating distant evidence utilization under increasing proximal background interference. Project page: https://xiaoyuyoung.github.io/LYRA/

cs.LG↗

arXiv2026

P-POSEMEM: Projective Semantic Memory for Consistent Language Grounding under Pose-Graph Rewrites

A robot following language instructions needs its semantic memory to keep naming the same physical object while the SLAM pose graph underneath is optimized, loop-closed and compressed. Maps committing each detection to a world coordinate cannot: a closure moves the anchor it was measured from, or the solver marginalizes that anchor, and the query then selects a different object although both graphs represent the same posterior. P-POSEMEM stores each observation as an immutable event at its birth keyframe, retains the Bayes-tree elimination conditional of every marginalized keyframe, and integrates the semantic likelihood over the reconstructed joint posterior of poses, anchors and identities. Dproj, the total-variation defect between the language-goal distributions of inference-equivalent full and marginalized graphs, measures this directly. Over 40 HM3DSem scenes and 112,000 queries, P-POSEMEM reproduces the full-graph oracle (Dproj = 0) and reduces goal flips against every memory-reducing baseline. On an eight-run campaign whose 761 closures rewrote the map by up to 47 m, Dproj stays below 10^-13 with 0/288 goal flips when elimination follows the closures, where every ablation and a coordinate committed at insertion flip goals it does not; under a live bounded solver the same memory flips 23/288 against 53 for that frozen coordinate. A pre-registered negative control is detected by Dproj while leaving calibration error and navigation success unchanged, indicating that these measures capture distinct failure modes. Retrieval is held fixed by a shared frozen detector, isolating the gain to memory consistency. Code and data: https://anonymous.4open.science/r/posemem-2328/.

cs.RO↗

arXiv2026

Evidence-Aligned Entity Verification for Hallucination Detection in Retrieval-Augmented Generation

Hallucination detection is crucial for large language models (LLMs), as hallucinated content creates significant barriers in applications requiring factual accuracy. Current detection methods mainly depend on internal signals like uncertainty and self-consistency checks, using the model's pre-trained knowledge to identify unreliable outputs. However, pre-trained knowledge may become outdated and has coverage limitations, especially for specialized or recent information. To address these limitations, retrieval-augmented generation (RAG) has emerged as a promising solution by retrieving relevant evidence at inference time, grounding outputs beyond the model's parametric knowledge. In this paper, we target a critical and practical learning problem RAG-based hallucination detection (RHD), where RAG is employed to enhance hallucination detection by addressing information updating challenges. To address RHD, we propose a novel method Evidence-Aligned Entity Verification (EAEV), which detects entity-level hallucinations by leveraging RAG to align generated entities with retrieved evidence contexts. Specifically, EAEV evaluates entity-evidence alignment through three complementary dimensions and introduces counterfactual stability analysis to ensure robust alignments under evidence perturbations. Experiments across multiple RAG benchmarks demonstrate that EAEV achieves consistent improvements over existing methods with strong generalization capabilities.

cs.AI↗

arXiv2026

Generalizable 6D Pose Estimation of Textureless Objects with Planar-based Gaussian Splatting

Estimating the 6D pose of textureless objects without prior CAD models remains a critical challenge due to the lack of appearance features. While recent generalizable approaches alleviate the dependence on object-specific models, their performance on low-texture objects is often limited by insufficient geometric constraints in the underlying representations. In this work, we propose PG-Pose, a geometry-aware framework combining Planar-based Gaussian Splatting (PGS) reconstruction and Geometry-driven pose optimization. In the offline representation extraction stage, three distinct representations of the object are extracted from multi-view reference RGB images with known poses. PG-Pose reconstructs a 3D Gaussian representation and renders high-fidelity depth maps to generate 3D point clouds through back projection. In the online pose inference stage, the initial pose of the input image is estimated by 2D-3D correspondence matching between the input image and the reconstructed 3D point clouds, followed by a PGS-Refiner for iterative pose optimization. Evaluations on the OnePose-LowTexture datasets, PG-Pose achieves an average accuracy of 94.2% ADD(S)@0.1d, with a 2.1% improvement average accuracy compared with the state-of-the-art (SOTA) GS-based approach. To further demonstrate the effectiveness of PG-Pose for industrial robots in grasping tasks, we deploy it on a dual-arm industrial robot and successfully realize the grasping task on an unseen object.

cs.RO↗

arXiv2026

Analysis of the two-body strong decays of the hidden-charm pentaquark states in QCD sum rules

In the present work, we study the two-body strong decays of the hidden-charm pentaquark states with the quark content $uudc\bar c$ and the quantum numbers $I(J^P)=\frac{1}{2}(\frac{1}{2}^-)$ in the framework of the three-point QCD sum rules. The initial pentaquark states are described by four local diquark-diquark-antiquark type interpolating currents with definite isospin. We construct the three-point correlation functions for the decay channels $P_c\to η_c p$, $J/ψp$, $Λ_c\bar D$, $Λ_c\bar D^{*}$ and $Σ_c\bar D$, and derive the corresponding QCD sum rules for the strong coupling constants. At the hadron side, the correlation functions are expressed in terms of the hadron masses, pole residues, decay constants and strong coupling constants. At the QCD side, they are calculated by carrying out the operator product expansion with the full quark propagators, where the vacuum condensates up to dimension 10 are taken into account. After matching the two representations and performing the double Borel transformations, we extract the strong coupling constants from the selected Lorentz structures. With the obtained coupling constants, we evaluate the partial decay widths and discuss the possible assignments of the corresponding pentaquark states. The numerical results indicate that two of the compact hidden-charm pentaquark states can be related to the $P_c(4312)$ and $P_c(4457)$, respectively, while the other two lower-mass states may be regarded as possible hidden-charm pentaquark candidates to be searched for in future experiments. The present results may be useful for identifying the hidden-charm pentaquark states in future experiments.

hep-ph↗

arXiv2026

Robust Non-Adiabatic Holonomic Gating in Qutrits via Inverse-Engineered Pulse Shaping and Error Compensation

Systematic Rabi-amplitude and detuning errors remain important sources of infidelity in high-fidelity quantum gates. We develop a robust pulse-engineering scheme for non-adiabatic holonomic quantum computing in a three-level $Λ$-type qutrit, combining inverse engineering with time-dependent perturbative analysis. Pulse shaping eliminates the leading second-order Rabi-amplitude contribution, while static detuning introduces a distinct population-mediated channel that cannot be removed within a single control loop. We therefore introduce a compensation loop that exactly cancels the dominant second-order $O_{13}^δ$ contribution, with the residual $O_{12}^δ$ channel further suppressed by pulse shaping. Using the logical average gate fidelity over the complete computational subspace, the optimized composite sequence reaches closed-system fidelities of $99.88\%$--$99.99\%$ for four representative single-qubit gates at $ε=0.2$ and $δ/2π=2$ MHz. With phenomenological decoherence at $T_1=T_2=30~μ{\rm s}$, the NOT and S gates retain fidelities of $99.72\%$ and $99.79\%$, respectively, with a coherence-time crossover near $0.58~μ{\rm s}$. These results identify the regime in which systematic-error suppression outweighs the decoherence cost of the additional control loop.

quant-ph↗

arXiv2026

Agent-Enhanced Heterogeneous Graph RAG for Academic Question Answering

Academic question answering requires reasoning over heterogeneous scholarly graphs, where queries range from simple attribute lookups to multi-hop inference across author--paper--venue structures. Existing retrieval-augmented generation (RAG) systems struggle in this setting due to three limitations: (1) fixed retrieval strategies that do not adapt to varying query complexity, (2) the absence of sufficiency evaluation leading to incomplete or misaligned evidence, and (3) a lack of structured verification against graph facts. To address these issues, we propose an agentic heterogeneous graph RAG method that transforms the three core stages of the RAG pipeline into explicit agentic decision steps. A query-aware retrieval agent analyzes query type and selects an appropriate graph traversal strategy; a sufficiency-aware reranking agent assesses evidence completeness and adaptively expands the retrieved subgraph; and a graph-grounded verification agent checks entity, relation, and attribute correctness before finalizing the answer. Experiments on heterogeneous graphs constructed from OpenAlex and DBLP suggest that our method consistently outperforms strong LLM, graph-augmented RAG, and agent-based baselines.

cs.SI↗

arXiv2026

FreKoo++: Learning Continuous Spectral Dynamics for Temporal Domain Generalization

Temporal Domain Generalization (TDG) aims to learn from historical domains and generalize to unseen future distributions under concept drift. Nevertheless, prevailing TDG methods struggle with complex real-world streaming scenarios involving both multi-scale drift patterns (e.g., long-term periodicity intertwined with short-term incremental changes) and local uncertainties, especially in continuous settings where observations arrive irregularly. To address this limitation, we propose FreKoo++, a novel continuous spectral-dynamical framework that pioneers the unification of continuous Koopman modal dynamics with adaptive spectral disentanglement. Specifically, FreKoo++ maps source-domain parameters into a compact latent space, modeling their evolution as a superposition of learnable continuous modes where complex eigenvalues jointly encode oscillatory frequency and temporal growth or decay. This formulation naturally accommodates irregular timestamps and supports arbitrary horizon extrapolation without rigid discrete stepping. Furthermore, we propose a new adaptive soft spectral weighting mechanism backed by stability and spectral regularization, which automatically isolates persistent dominant dynamics from transient noise without relying on manual frequency thresholds. We derive modal approximation and generalization bounds that characterize how amplitude and eigenvalue estimation errors propagate with the prediction horizon. Extensive experiments on both discrete and continuous TDG benchmarks demonstrate that FreKoo++ achieves state-of-the-art performance under complex multi-scale drifts and irregular sampling.

cs.LG↗

arXiv2026

Deep Reinforcement Learning for 6G AI-RAN: A Comprehensive Survey

The evolution toward sixth-generation (6G) networks is transforming the radio access network (RAN) into a programmable and intelligent control platform that must continuously adapt to heterogeneous services, dynamic environments, and competing performance objectives. Open Radio Access Network (O-RAN) provides the open interfaces, disaggregated architecture, and multi-timescale control loops needed to support this transformation, while deep reinforcement learning (DRL) offers a natural framework for optimizing sequential decisions under uncertainty. However, existing surveys either address artificial intelligence (AI) and machine learning (ML) in O-RAN broadly or focus on isolated DRL use cases, leaving a gap in the systematic connection between DRL methodology, O-RAN architecture, and operational deployment. To the best of our knowledge, this article presents the first dedicated and comprehensive survey of DRL for Open AI-RAN. We review the foundations of model-free, model-based, offline, safe, multi-agent, federated, and transfer learning, and provide an O-RAN-aware framework for formulating RAN control problems through states, observations, actions, rewards, constraints, and temporal structure. We classify DRL applications across radio resource management, mobility management, interference control, traffic steering, energy efficiency, network slicing, integrated sensing and communication, security, and massive MIMO. We further examine multi-agent and federated coordination, foundation models and agentic AI, trustworthy DRL, sim-to-real transfer, continual adaptation, resource-efficient inference, and reinforcement learning operations. Finally, we review experimental platforms, benchmarks, standards, and industry activities, and identify research directions toward sample-efficient, safe, scalable, interoperable, and deployable DRL control for 6G Open AI-RAN.

cs.NI↗

arXiv2026

Spin Splitter without Spin-Split Bands: A Reconfigurable Altermagnetic Texture

The altermagnetic spin-splitter effect converts an electric field into a transverse pure spin current, with no net magnetization and no charge-Hall counterpart. In established materials this function is tied to crystal-fixed spin-split bands that lock the polarization axis to the lattice. We show that the noncoplanar counter-spiral ground state of a frustrated honeycomb magnet instead carries the altermagnetic operation through a $\mathbf Q$-locked helicity mirror $g$. The mirror selects the spin-current polarization and forbids the perpendicular one, while an antitranslation $Θ$ forbids even-parity spin splitting. Band splitting and spin-splitter response therefore rest on different symmetry elements. Either element alone enforces the charge-Hall zero---a redundancy absent from other spin--orbit-free noncollinear routes---and a charge Hall appears only when both elements are removed. Hole doping then realizes a \emph{spin splitter without spin-split bands}---the symmetry-allowed odd-parity residual below $2\times10^{-7}$ of the hopping $t$ at the Fermi level---with $σ_H^{(s_y)}=0.082\,e^2/h$ without spin--orbit coupling and with zero charge Hall response. Selecting among the three degenerate $\mathbf{Q}$ orientations rotates the polarization axis in exact $120^\circ$ steps at fixed magnitude and charge-Hall zero; the selection rules persist in a $32$-site cell accessible to programmable photonic and circuit lattices.

cond-mat.str-el↗

arXiv2026

GAUGE: Granularity-Adaptive Counterfactual Gating of Evidence for Incomplete Multimodal Classification

Multimodal classification typically assumes all modalities are available, yet real-world inputs are often incomplete. Imputation and dynamic fusion can mitigate such incompleteness, but existing methods operate at a coarse modality level and thus cannot retain reliable components while suppressing misleading ones within the same recovered modality, compromising prediction reliability. To address this issue, we propose GAUGE, a lightweight counterfactual gating framework for incomplete multimodal classification. GAUGE first imputes missing modalities with a frozen imputer and encodes observed and recovered inputs uniformly as fine-grained evidence units. Rather than intervening on each unit explicitly, GAUGE scores the counterfactual effect of replacing every unit with a reference representation through prediction-aware Taylor evidence scores, all obtained in a single forward-backward pass. These scores are mapped to continuous gates, which are converted into additive attention-logit biases for unit-wise evidence modulation without altering the backbone architecture. Experiments across six benchmarks demonstrate that GAUGE outperforms strong baselines across diverse incomplete-input settings. Furthermore, a Taylor remainder theoretical analysis characterizes the error of the first-order approximation relative to the exact counterfactual effect, establishing GAUGE as a principled and scalable framework for fine-grained evidence control under modality incompleteness.

cs.LG↗

arXiv2026

The semileptonic decays of $\mathcal{B}_{Q_{1}Q_{2}}(\frac{1}{2}^{+})\rightarrow\mathcal{B}_{Q_{1}}^{*}(\frac{3}{2}^{+})$ in QCD sum rules

In the framework of QCD sum rules, we systematically analyze the weak transition process $\mathcal{B}_{Q_{1}Q_{2}}(\frac{1}{2}^{+})\rightarrow\mathcal{B}_{Q_{1}}^{*}(\frac{3}{2}^{+})$. When doing the operator product expansion in the QCD side, we consider the contributions of perturbative part and vacuum condensate terms up to dimension 6. In the phenomenological side, we eliminate the interferences of the low spin states and negative parity states by employing 16 different dirac structures. As an application, these form factors are finally used to analyze the semileptonic decays of $\mathcal{B}_{Q_{1}Q_{2}}(\frac{1}{2}^{+})\rightarrow\mathcal{B}_{Q_{1}}^{*}(\frac{3}{2}^{+})lν$, where these decays are driven by the transition processes $c\rightarrow d/s+l^{+}+ν_{l}$ and $b\rightarrow u+l^{-}+\overlineν_{l}$. The predicted physical quantities include not only the partial widths, ratios of $Γ_{L}/Γ_{T}$ and the branching fractions, but also some observables such as the forward-backward asymmetry parameter $A_{FB}^{l}$ of lepton, the $P_z^{F}$ component of the polarization vector for daughter baryon and the longitudinal polarization of the lepton $P_z^{l}$. We hope all of these theoretical predictions about the weak decays will be helpful for studying the properties of doubly heavy baryons in experiments in the future.

hep-ph↗

arXiv2026

AC-VLA: Robust Out-of-Distribution Action Execution via Compositional Learning

Vision-Language-Action (VLA) models excel at end-to-end robotic manipulation but struggle with out-of-distribution (OOD) generalization when familiar sub-tasks are recombined in unseen configurations. We identify two mutually reinforcing failure modes: \emph{trajectory overfitting}, where models overfit to holistic trajectory patterns rather than compositional sub-skill semantics; and \emph{perceptual shortcut}, where action tokens over-rely on wrist-view textures at the expense of global spatial grounding. To address both, we introduce \textbf{AC-VLA}, a plug-and-play Action Compositional learning framework comprising two architecture-agnostic components: \textbf{(i)} a compositional learning module that uses an LLM-driven instruction decomposer and a proprioceptive trajectory aligner to generate dense sub-task supervision, followed by mixed training on complete demonstrations and decomposed data to endow the model with compositional generalization; and \textbf{(ii)} a state-conditioned asymmetric masking strategy that suppresses wrist-view inputs during closed-gripper phases, enforcing global semantic grounding. All components are architectural modification-free and directly integrable into any VLA backbone. Instantiated on $π_{0.5}$ and evaluated on LIBERO and LIBERO-OOD benchmarks, AC-VLA achieves a ~28% absolute improvement on compositional OOD tasks while maintaining near-perfect in-distribution performance.

cs.RO↗

arXiv2026

Heterogeneous Information-Bottleneck Coordination Graphs for Multi-Agent Reinforcement Learning

Coordination graphs are a central abstraction in cooperative multi-agent reinforcement learning (MARL), yet existing sparse-graph learners lack a theoretically grounded mechanism to decide which edges should exist and how much information each edge should carry. Current methods rely on heuristic criteria that offer no formal guarantee on the learned topology, and no principled way to allocate different communication capacities to structurally different agent relationships. To address this, we propose Heterogeneous Information-Bottleneck Coordination Graphs (HIBCG), which learns a group-aware sparse graph in which both edge existence and message capacity are theoretically justified. With the graph information bottleneck (GIB) serving as the underlying tool, HIBCG first constructs a group-aligned block-diagonal prior that provides a closed-form criterion for edge retention -- determining which edges should exist and at what density per group block -- and then controls per-agent feature bandwidth on the resulting topology, compressing messages to retain only task-relevant content. We prove that the group-aligned prior strictly tightens the variational bound on topology learning, that the objective decomposes per group block, enabling differential edge control, and that capacity allocation follows a water-filling principle.

cs.AI↗

arXiv2026

Beyond-adiabatic flat Chern bands from a double-helix skyrmion crystal

A central challenge in flat-band engineering is suppressing kinetic energy without sacrificing Berry curvature. We show that a double-helix skyrmion crystal (DHSKX)--two sublattice-resolved skyrmion textures locked at opposite helicities, obtained here as the classical ground state of a frustrated honeycomb spin model--provides such a route under double exchange. The key mechanism is a single real-space organization, phase clustering: the $π$-locked helicities expel the wave function's phase winding from the skyrmion cores, and the magnetic $C_3$ symmetry pins it into three phase-locked clusters whose distributed destructive interference cancels net transport while preserving the Berry curvature. Ordinary skyrmion crystals, even with the same symmetry, do not develop this organization. Phase clustering yields isolated flat $|C| = 1$ Chern bands over broad coupling windows, one of which surpasses the adiabatic reference in quantum geometry at intermediate coupling. In this beyond-adiabatic window, band-projected exact diagonalization gives finite-size evidence consistent with $ν= 1/3$ Laughlin-type fractional-Chern-insulator physics; the same texture also hosts a higher-Chern ($C = -2$) flat band. Built from site-resolved complex hoppings alone, the DHSKX architecture is directly programmable in topolectric, acoustic, and photonic platforms.

cond-mat.str-el↗

arXiv2026

Dimension Reduction for Curves: Simplified and Generalized

We revisit random projections for reducing the dimension of high-dimensional polygonal curves. Drawing from the toolbox of randomized linear algebra, we give a considerably simplified proof of the known $O(\varepsilon^{-2}\log(nm))$ bound on the target dimension of a random projection that preserves the continuous Fréchet distance of polygonal curves up to a factor $(1\pm\varepsilon)$. Our proof is based on the concept of sparse oblivious subspace embeddings. While previous techniques were limited to the case of the Fréchet distance, our techniques are fairly general and extend to all possible distance measures that involve the maximum, a sum or an integral over Euclidean distances between pairs of points on both input curves. We define a generalized dissimilarity measure for curves that includes several popular measures such as Fréchet, $q$-DTW, Hausdorff, etc. as special cases and show that the same dimension reduction technique works for this generalized dissimilarity measure. Finally, we apply the same framework for dimension reduction to piecewise linear surfaces, after extending the distance measure suitably to such surfaces.

cs.DS↗

arXiv2026

Unleashing More Actions via Action Compositional Training for VLA Models

Vision-Language-Action models excel at robotic manipulation, driven by the scale and diversity of demonstration data. However, standard training paradigms often cause VLA models to severely overfit to specific behavioral patterns, rendering them unable to generalize to out-of-distribution scenarios even when those scenarios merely require novel combinations of identical sub-skills. While expanding datasets can mitigate this overfitting, acquiring high-quality robot data remains notoriously labor-intensive and cost-prohibitive. To resolve this impasse without expensive human teleoperation and to truly unleash more actions,i.e., enable VLA models to compose known sub-skills into a much broader set of executable behaviors beyond the original demonstrations-we propose ACT-VLA (Action Compositional Training for VLA Models), an offline data augmentation framework that leverages the model's latent task representations to synthesize novel, physically valid demonstrations directly from existing tasks for policy training. By eliminating additional manual data collection, our method automatically expands the training distribution and mitigates overfitting. We evaluate our approach on challenging manipulation tasks in simulation. Experiments demonstrate that while baseline VLA models generalize poorly due to original distribution overfitting, policies trained with our synthesized data achieve substantially higher success rates, validating that leveraging existing tasks for automated demonstration synthesis provides an effective, scalable, and data-efficient route to broadening VLA generalization.

cs.RO↗