Searcharxiv⌕ Search

arXiv subjects

Jian Li

Publications and source records attributed to Jian Li.

At least 55 records · Page 3Linked to original sources
arXiv2026

Point-gap topology in amorphous non-Hermitian quantum systems

Recent studies have revealed that not only does the correspondence between spectral winding numbers and skin modes break down in non-Hermitian systems, but the energy spectrum itself is highly sensitive to generic perturbations, system size, and boundary conditions. In amorphous non-Hermitian systems, where the positions of lattice sites are uncertain, the spectral instability becomes even more severe, making it difficult to identify stable topological edge states from the eigenvalue spectrum alone. To overcome this challenge, we introduce a correspondence between stable zero-mode singular states and mid-gap states of the energy spectrum in the thermodynamic limit. Because the singular value spectrum is highly robust against small perturbations and variation in size, topological edge states can be reliably probed via singular values even in finite-sized systems. Based on the singular-value decomposition of the Hamiltonian, we construct a topological invariant in real space to characterize the associated topologically protected edge states. Our approach provides a general strategy for exploring point-gap topology in real space and redefine the non-Hermitian skin effect from a new perspective.

quant-ph↗
arXiv2026

RoMeRL: Balancing Feedback Coverage and the Memory-Reward Trap in Self-Evolving Agent Memory via Reduced-Order Utility States

Learning-based memory systems for self-evolving LLM agents face two tightly coupled challenges. First, trajectory-indexed utilities grow with the interaction history, thereby dispersing limited feedback over an ever-expanding state space. Second, because trajectory-level rewards are jointly assigned to co-retrieved memories, irrelevant experiences may receive misleading utility updates and consequently enter the memory-reward trap. To address these challenges, we introduce Reduced-Order Memory Reinforcement Learning (RoMeRL), which represents the growing trajectory-indexed utility space using a fixed-dimensional per-task memory state factorized by outcome polarity and memory dynamics. RoMeRL incorporates new experiences through a fixed set of semantic coordinates whose contents are updated or replaced over time, thereby concentrating feedback over a bounded utility support. Theoretically, we show that this reduced-order parameterization increases the average feedback received by each utility coordinate and characterize the steady-state occupancy of erroneous coordinates under a generic coordinate-transition model. Empirically, across ALFWorld and LifelongAgentBench, RoMeRL improves task performance, reduces the Cold-Q ratio by 80.0%, increases feedback density by approximately 6.0 times, reduces the maintained memory size by 84.4%, and cuts LLM calls by 21.1%. These results show that reduced-order utility states support efficient self-evolving agent memory while limiting persistent reward contamination. Code is available at: https://github.com/YOUNG-fnxm/RoMeRL

cs.LG↗
arXiv2026

Dual-Adversarial Safety Alignment: Cultivating Intrinsic Threat Comprehension in LRMs

Large reasoning models (LRMs) achieve remarkable success on complex tasks but remain vulnerable to harmful prompts that induce unsafe outputs. Recent methods align LRMs using direct refusals or safety rationales, yet often focus on prompt patterns rather than intrinsic attack mechanisms. As a result, these pattern-centric alignments struggle to generalize across diverse jailbreaks, compromising adversarial robustness and reasoning utility. We propose AdvSafe, a dual-adversarial framework that enables LRMs to internalize unsafety knowledge by explicitly deconstructing adversarial mechanisms. This moves beyond pattern-dependent traces, fostering robust cognitive defense without compromising reasoning utility. Our pipeline operates via a two-phase adversarial game. First, in adversarial synthesis, an autonomous agent dynamically crafts deceptive jailbreak prompts, adapting its strategies to breach a strong teacher model. Second, in adversarial extraction, the breached teacher executes a cognitive counter-attack. For every successful jailbreak, the teacher unmasks the camouflage, explaining why the attack succeeds and how such prompts can be identified and mitigated. This dual-adversarial process yields a compact reasoning dataset capturing rich, generalizable unsafety knowledge. Student models trained on this dataset implicitly acquire safety alignment through intrinsic threat comprehension. Experiments show that with only 1K synthesized samples, AdvSafe-aligned LRMs achieve significantly stronger jailbreak robustness than existing baselines, with almost no utility degradation. Furthermore, AdvSafe improves robustness against out-of-distribution prompts, demonstrating that learning unsafety knowledge enables a superior robustness-utility trade-off and generalizes beyond seen attack patterns.

cs.LG↗
arXiv2026

RareLens: Towards End-to-End Rare Disease Care via Aligning Divergent Large Language Model Reasoning

Rare diseases represent one of the most challenging settings for clinical decision-making, where heterogeneous presentations, sparse evidence and limited expertise create persistent uncertainty throughout the care pathway. Although artificial intelligence could help, existing systems largely address isolated tasks, particularly diagnosis, and usually rely on downstream investigations rather than information available at initial presentation. Here we show that clinical AI performance under uncertainty can be improved not by scaling a single model, but by exploiting the diversity of multiple imperfect reasoning systems. Across heterogeneous large language models, we identify divergent reasoning trajectories with complementary error patterns and develop RareLens, which learns to reconcile these perspectives into actionable decisions across four stages of rare disease care: risk screening, diagnosis, treatment planning and prognosis prediction. Built on RarelensBench, a real-world dataset of 157,525 cases spanning all 33 Orphanet categories and more than 7,000 conditions, RareLens outperformed every frontier model tested, including GPT-5, DeepSeek-R1, Claude-3.7-Sonnet and Gemini-2.5-Pro, across all stages. It achieved an area under the curve of 0.917 for screening and top-1 accuracies of 65.5% and 89.8% for diagnosis and treatment. In an external evaluation involving 1,287 cases and 23 physicians, autonomous RareLens and physicians assisted by RareLens both outperformed unaided physicians, while demonstrating that effective human-AI collaboration requires more than simply providing model outputs. These findings establish divergent model reasoning as an exploitable source of information and suggest a general strategy for building AI systems that operate reliably under high clinical uncertainty.

cs.AI↗
arXiv2026

Microscopic Statistical Calculation of Nuclear Level Density Based on Relativistic Density Functional Theory

A microscopic statistical model based on the relativistic density functional theory (RDFT) is developed to calculate the nuclear level density (NLD). The approach employs self-consistent single-particle levels obtained from RDFT as input, incorporates pairing correlations within a finite-temperature Bardeen-Cooper-Schrieffer (BCS) theory, and accounts for rotational and vibrational collective enhancement effects. The spin cut-off parameter is calculated from the single-particle levels, thereby naturally retaining the shell effects and the structural characteristics of different nuclei. Using the shape-coexisting nucleus 98Sr as a representative example, the microscopic origin of the deformation effect on the NLD is investigated. In addition, the calculated NLDs are systematically compared with those from various phenomenological and microscopic models, as well as with available experimental data. The results indicate that although certain discrepancies exist among different models, they exhibit consistent overall evolutionary trends. Meanwhile, the RDFT-based microscopic statistical approach is capable of providing a reasonable description of the experimental NLDs as well as the s- and p-wave neutron resonance spacings.

nucl-th↗
arXiv2026

AdaMARP: An Adaptive Multi-Agent Interaction Framework for General Immersive Role-Playing

LLM role-playing aims to portray arbitrary characters in interactive narratives, yet existing systems often suffer from limited immersion and adaptability. They typically under-model dynamic environmental information and assume largely static scenes and casts, offering insufficient support for multi-character orchestration, scene transitions, and on-the-fly character introduction. We propose an adaptive multi-agent role-playing framework, AdaMARP, featuring an immersive message format that interleaves [Thought], (Action), , and Speech, together with an explicit Scene Manager that governs role-playing through discrete actions (init_scene, pick_speaker, switch_scene, add_role, end) accompanied by rationales. To train these capabilities, we construct AdaRPSet for the Actor Model and AdaSMSet for supervising orchestration decisions, and introduce AdaptiveBench for trajectory-level evaluation. Experiments across multiple backbones and model scales demonstrate consistent improvements: AdaRPSet enhances character consistency, environment grounding, and narrative coherence, with an 8B actor outperforming several commercial LLMs, while AdaSMSet enables smoother scene transitions and more natural role introductions, surpassing Claude Sonnet 4.5 using only a 14B LLM.

cs.AI↗
arXiv2026

AlphaSchema: Exploring the Space of Trading Semantics for LLM-Based Alpha Mining

Automated alpha mining has increasingly adopted large language model (LLM) agents for factor generation and iterative discovery. However, existing LLM-based systems often delegate both factor construction and search decisions to the agent itself, without an explicit exploration space or a principled mechanism for navigating that space. As a result, exploration remains largely implicit and difficult to control or optimize systematically. We introduce AlphaSchema, which constructs and explores a structured space of trading semantics for alpha mining. Each point in this space is a schema plan composed of Event, Context, Qualities, Direction, and Output, specifying the semantics of a candidate factor before implementation. AlphaSchema decouples exploration from implementation: an LLM translates selected schema plans into executable factors, while evaluated rewards are accumulated to learn a surrogate model over the semantic space. An iterative selection mechanism uses this model to balance global exploration, surrogate-guided exploitation, and local mutation. Experiments on the Chinese stock market show that AlphaSchema discovers factor pools with strong predictive and portfolio performance. Further analyses show that the semantic search process navigates diverse regions while increasingly allocating evaluations toward high-reward regions, and that implementations of the same schema plans by different LLMs exhibit comparable predictive quality, suggesting that alpha mining quality is largely robust to the choice of LLM within our framework.

cs.AI↗
arXiv2026

M3: A State-Event Generative Foundation Model for Market Microstructure Dynamics

Market microstructure simulation aims to model how liquidity, prices, and order flow evolve in electronic financial markets. Since market data reveal only one realized trajectory, many important questions are inherently counterfactual and require realistic trajectory-level simulation. Existing financial generative models, however, often model order events and market states, such as the LOB, in isolation, overlooking the dynamic interaction between order flow and liquidity in market microstructure. We propose the \textbf{M3} (\underline{M}arket \underline{M}icrostructure \underline{M}odel), a state-event generative foundation model for market microstructure dynamics. \textbf{M3} learns to generate future order-flow trajectories, while accounting for the evolving interaction between order events and limit-order-book liquidity. Trained on large-scale order-level real stock market data, \textbf{M3} exhibits predictable scaling behavior, reproduces key market stylized facts, and enables practical simulation-based applications including forecasting, stress testing, and market-impact analysis. These results suggest a scalable foundation-model paradigm for counterfactual market simulation at the microstructure level.

q-fin.CP↗
arXiv2026

Prescriptive preparation and verification of nonstabilizer states

High-fidelity quantum state preparation is a central task in quantum information science. In practice, it is commonly guided either by full quantum state tomography, which becomes prohibitively resource-intensive as system size grows, or by empirically chosen measurement settings that lack principled optimality. Here we show that quantum state verification (QSV) can be elevated from a purely diagnostic tool to a prescriptive framework for quantum state preparation, directly specifying experimentally optimal measurements and quantitative fidelity indicators without full state reconstruction. We experimentally realize this prescriptive paradigm using a three-qubit nonstabilizer $W$ state and a modified homogeneous QSV protocol. The verification measurements not only certify the prepared state with high confidence but also serve as a tomography-free indicator that systematically informs the preparation procedure. Using only nine measurement settings and $10^4$ samples, we achieve high-fidelity state preparation consistent with full tomography that requires orders of magnitude more resources. Beyond the present implementation, the prescriptive structure of QSV is naturally compatible with closed-loop feedback control, outlining a pathway toward genuine real-time quantum state preparation in future low-latency platforms.

quant-ph↗
arXiv2026

Hidden topology and strong quantum metric bounds in trivial systems

The quantum metric integral (QMI) in two-dimensional (2D) systems is conventionally bounded from below by the Chern number. For systems with zero Chern number or identically vanishing Berry curvature, however, this bound becomes trivial and provides no useful geometric constraints. Here, we develop a dimension-reduction framework that decomposes the 2D QMI into lower-dimensional components in a nested-loop way. With this method, we establish a nonzero lower bound on the QMI arising from one-dimensional topological obstructions even when the conventional 2D topology is trivial. We explicitly demonstrate this mechanism in a tilted 2D Su-Schrieffer-Heeger model and an anisotropic Wilson-Dirac model with chiral symmetry. The resulting lower bounds of QMI are determined by the quantized Wannier bands along two different directions. We further investigate the quantum geometry in higher-order topological phases following the same strategy. By introducing Wannier-band basis obtained from the nested Wilson loop, we demonstrate that the Wannier-band QMI is bounded from below by the higher-order topological invariant, e.g. the quadrupole moment in Benalcazar-Bernevig-Hughes model. Our results establish nonzero lower bounds on QMI from a dimension-reduction framework, thereby generalizing the fundamental relation between quantum geometry and topology.

cond-mat.mes-hall↗
arXiv2026

Spatial nonlocality imaging via metasurface

Bell nonlocality is both a defining signature of entanglement and a key quantum information resource. However, visualizing and certifying nonlocal correlations across a spatially multimode photonic field remains challenging due to the rapidly growing measurement cost of spatially resolved projective tests. To address this issue, we build a spatial nonlocality imaging scheme that directly reveals the spatial distribution of quantum nonlocality by integrating a metasurface that performs parallel polarization projections with a quantum-adaptive neural network. Spatially resolved Clauser--Horne--Shimony--Holt (CHSH) tests are realized over a 400-pixel biphoton field using an average of only 1.7 detected coincidence pairs per pixel per basis. This approach yields a nonlocality image that maps the two-dimensional spatial distribution of Bell violations across the optical field and reveals the target-state-dependent spatial evolution of Bell violations. It provides a highly resource-efficient route to large-scale Bell certification and opens new possibilities for exploiting spatially multimode entanglement in quantum imaging, quantum networking, and scalable photonic quantum technologies.

quant-ph↗
arXiv2026

Full-Path Nonlinear Modeling of Microwave Power Transmission Through Ionospheric Plasma for Space Solar Power Station

Space Solar Power Station (SSPS) concepts rely on gigawatt-class microwave beams to carry orbital solar energy through the ionosphere, where the beam and the plasma form a coupled nonlinear system: the field heats electrons, the heating alters the collision frequency and plasma density, and the modified medium in turn reshapes the field. To our knowledge, this work is the first study to quantify this two-way interaction between microwave power transmission and the ionospheric plasma environment through full-path nonlinear modeling. The 340 km path from 400 km to 60 km altitude is reconstructed by 34 cascaded two-dimensional axisymmetric finite-element full-wave segments with complex-field transfer, using International Reference Ionosphere (IRI) electron-density and NRLMSISE-00 neutral-atmosphere inputs. A Shallow Neural Network (SNN) surrogate replaces the implicit electron energy balance with an explicit closure that maps altitude and local field magnitude to electron temperature and effective collision frequency, enabling stable nonlinear iteration. For 1 GW beams at 2.45 GHz and 5.8 GHz, the volume-integrated Ohmic deposition is 29.4 kW and 5.11 kW, respectively -- fractional losses of order $10^{-5}$ -- and the ratio between the two bands follows the $ω^{-2}$ scaling of collisional absorption. The deposition concentrates near 95 km altitude, where the product of electron density and collision frequency peaks, whereas the electron-temperature perturbation (up to 3815 K) maximizes in the F region, where cooling is weakest; ponderomotive density depletion remains below 0.02\%. The ionosphere is therefore effectively transparent to the SSPS power budget but not to the beam phase: localized heating and refractive perturbation accumulate phase-front distortion relevant to phased-array beam control, rectenna phase compensation, and environmental assessment.

physics.plasm-ph↗
arXiv2026

Microscopic Study of Charge Properties in Halo Nuclei

Employing the relativistic continuum Hartree-Bogoliubov (RCHB) theory with intrinsic electromagnetic structure corrections, this work primarily investigates the charge properties of halo nuclei along the Ne and P isotopic chains. Our results characterize halo nuclei by an extended tail in the charge density and distinct signatures in the charge form factors at low momentum transfer. Moreover, the higher-order radial moments of nuclear charge density, particularly the eighth moment, exhibit pronounced oscillations, serving as a key indicator of the neutron halo structure. These special features in nuclear charge distributions will serve as key references for identifying halo nuclei.

nucl-th↗
arXiv2026

pFedNavi: Structure-Aware Personalized Federated Vision-Language Navigation for Embodied AI

Vision-Language Navigation VLN requires large-scale trajectory instruction data from private indoor environments, raising significant privacy concerns. Federated Learning FL mitigates this by keeping data on-device, but vanilla FL struggles under VLNs' extreme cross-client heterogeneity in environments and instruction styles, making a single global model suboptimal. This paper proposes pFedNavi, a structure-aware and dynamically adaptive personalized federated learning framework tailored for VLN. Our key idea is to personalize where it matters: pFedNavi adaptively identifies client-specific layers via layer-wise mixing coefficients, and performs fine-grained parameter fusion on the selected components (e.g., the encoder-decoder projection and environment-sensitive decoder layers) to balance global knowledge sharing with local specialization. We evaluate pFedNavi on two standard VLN benchmarks, R2R and RxR, using both ResNet and CLIP visual representations. Across all metrics, pFedNavi consistently outperforms the FedAvg-based VLN baseline, achieving up to 7.5% improvement in navigation success rate and up to 7.8% gain in trajectory fidelity, while converging 1.38x faster under non-IID conditions.

cs.CV↗
arXiv2026

Pulsar Backend for 21 CentiMeter Array: Implementation of Data Acquisition and Initial Results

We implemented a data acquisition system for 21 CentiMeter Array (21CMA), enabling baseband observations targeting pulsars and fast radio bursts. Based on the Radio Frequency System-on-Chip (RFSoC) platform, the new backend is capable of instantaneously covering the effective bandwidth from 50 to 350 MHz, with multi-board synchronization achieved at the timescale of the sampling clock. We observed PSR B0329+54 with a single station to verify the signal path integrity; then solved phase relations of multiple station pairs using bright persistent radio sources like Cas A and Cyg A; using these phase solutions, a multiple-station coherently beamformed observation of PSR B0329+54 was carried out, showing a signal-to-noise ratio of 699.09 for a 2.5-hour observation with eight stations, opening up a possibility of tied-array low-frequency pulsar observations on 21CMA.

astro-ph.IM↗
arXiv2026

Improving General Role-Playing Agents via Psychology-Grounded Reasoning and Role-Aware Policy Optimization

Building general-purpose role-playing agents that faithfully portray any character from a natural-language profile remains challenging. The dominant paradigm -- supervised fine-tuning -- encourages behavioral mimicry without deep, human-like internal thought processes, resulting in poor out-of-distribution generalization. Therefore, we propose \textbf{Psy-CoT}, a psychology-grounded chain-of-thought framework that decomposes pre-response reasoning into three role-specific steps -- \emph{Interaction Perception}, \emph{Psychological Empathy}, and \emph{Logical Construction} -- so that the model \emph{thinks dynamically} from the profile rather than merely mimicking surface patterns. While structured reasoning provides a foundation, it alone is insufficient; reinforcement learning is essential to further align the model with character fidelity. However, we observe that under LLM-based reward models, both generic phrases that hack the reward model and genuinely role-specific phrases receive identical gradient signals -- this hacking accumulates over training, misleading the model into treating both as equally optimal choices. To address this, we propose \textbf{Role-Aware Policy Optimization (RAPO)}, which uses profile--token mutual information to weight gradients asymmetrically -- amplifying role-specific tokens under positive advantage while attenuating them under negative advantage. Experiments on CoSER, CharacterBench, and CharacterEval demonstrate that Psy-CoT outperforms existing role-playing CoT methods, and RAPO consistently surpasses GRPO across multiple model scales.

cs.CL↗
arXiv2026

Adaptive Enhanced Quantum-inspired Simulated Bifurcation Algorithm for Population State Perception

Existing quantum-inspired simulated bifurcation algorithms rely on dynamic scheduling methods but lack the ability to adapt effectively to different problem instances. Additionally, during the evolutionary stage, balancing exploration and exploitation remains challenging. The fundamental issue stems from the widespread use of static preset parameters and globally uniform strategies, which can diminish algorithm effectiveness and lead to result homogenization. This article proposes an Adaptive Enhanced Quantum-inspired Simulated Bifurcation (AE-QSB) framework driven by population states. By leveraging perception indicators of four distinct population states, the QSB algorithm establishes a closed-loop strategy encompassing perception, decision-making, and execution. Within this framework, we introduce three complementary algorithms spanning a spectrum from efficient extremum seeking (ME-BSB), through population-level uniform refinement (SE-DSB), to density-aware adaptive scheduling (SG-DSB). On the medium-sized graph G22, both SE-DSB and SG-DSB achieve a mean gap below 0.05\%, while ME-BSB attains the optimal trade-off between runtime and solution quality with a gap of 0.26\% and the shortest single-run time. We compared AE-QSB variants with other algorithms across all benchmark graphs from G1 to G81. The results demonstrate that AE-QSB achieved the lowest mean gap on 74.6\% of the graphs and the highest average approximation rate on 84.5\% of the graphs. Ablation experiments further revealed that subgroup exploration and rescue mechanisms play crucial roles in both multifactor and single-factor components. This study demonstrates that population statistical information during dynamic evolution provides a computable and effective foundation for adaptive control, enabling quantum-inspired optimization methods to transition from fixed scheduling to data-driven closed-loop control.

cs.NE↗
arXiv2026

GraphPO: Graph-based Policy Optimization for Reasoning Models

Reinforcement Learning with Verifiable Rewards (RLVR) has become a standard paradigm for enhancing the capability of large reasoning models. RLVR typically samples responses independently and optimizes the policy using from final answers. This paradigm has two limitations. First, independently responses often contain similar intermediate reasoning steps, causing redundant exploration and wasted computation. Second, sparse final-answer rewards make it hard to identify useful steps. Tree-based methods partly address this problem by sharing prefixes and comparing branches from the same prefix to provide fine-grained signals. However, tree branches are still expanded independently. When different branches reach similar reasoning states, they cannot share information and repeat similar exploration. Moreover, tree-based methods ignore such dispersion and only perform local comparisons within separate branches, which can lead to higher variance in advantage estimation. To address this challenge, we propose GraphPO (Graph-based Policy Optimization), a novel RL framework that represents rollouts as a directed acyclic graph, with reasoning steps as edges and semantic states summarized from the reasoning paths as nodes. GraphPO merges semantically equivalent reasoning paths into equivalence classes, allowing them to share suffixes and reallocating budget away from redundant expansions to diverse exploration. Furthermore, we assign efficiency advantages to incoming edges and correctness advantages to outgoing edges, thereby improving inference efficiency while deriving process supervision from outcome. Theory shows that GraphPO reduces advantage-estimation variance and enhances reasoning efficiency. Experiments on three LLMs across reasoning and agentic search benchmarks show that GraphPO consistently outperforms chain- and tree-based baselines with the same token budgets or response budgets.

cs.CL↗