arXiv subjects

Tao Li

Publications and source records attributed to Tao Li.

At least 91 records · Page 5Linked to original sources

arXiv2026

Disorder effect on the superfluid density and the origin of the pseudogap end point in the cuprate superconductors

A major puzzle in the study of the cuprate superconductivity is the origin of the pseudogap end point. Intriguingly, such a critical doping is also where the superfluid density of the system reaches its maximum. A non-monotonic doping dependence of the superfluid density is rather unusual since the Drude weight of the cuprate system is found to increase monotonically with the doping concentration. It is generally believed that such a peculiar behavior should be attributed to both the strongly correlated nature of the cuprate system and the disorder effect. In this work, we develop a variational theory for the zero temperature superfluid density of the disordered $t-J$ model. This is achieved in two steps. First, we perform an unrestricted variational optimization of an RVB variational ground state for the disordered $t-J$ model. Second, we construct the variational state that describes the paramagnetic current response on such an RVB state. The zero temperature superfluid density $ρ_{s}(0)$ is then extracted from the curvature of the variational ground state energy of the system as a function of the external electromagnetic field. We find that $ρ_{s}(0)$ computed in this way is remarkably robust against the disorder effect. More specifically, we find that $ρ_{s}(0)$ is a monotonically increasing function of doping concentration $x$ and scales linearly with the total optical weight. This is consistent with the observation in the underdoped cuprates but is strongly at odd with the behavior in the overdoped cuprates. The strong contrast between the disorder effect in the underdoped and the overdoped regime lends strong support to our previous proposal that there exist a Mott transition between a doped-Mott-insulating metal in the underdoped regime and a fermi-liquid-like metal in the overdoped regime around the pseudogap end point.

cond-mat.supr-con↗

arXiv2026

Formalize, Don't Optimize: The Heuristic Trap in LLM-Generated Combinatorial Solvers

Large Language Models (LLMs) struggle to solve complex combinatorial problems through direct reasoning, so recent neuro-symbolic systems increasingly use them to synthesize executable solvers. A central design question is how the LLM should represent the solver, and whether it should also attempt to optimize search. We introduce CP-SynC-XL, a benchmark of 100 combinatorial problems (4,577 instances), and evaluate three solver-construction paradigms: native algorithmic search (Python), constraint modeling through a Python solver API (Python + OR-Tools), and declarative constraint modeling (MiniZinc + OR-Tools). We find a consistent representational divergence: Python + OR-Tools attains the highest correctness across LLMs, while MiniZinc + OR-Tools has lower absolute coverage despite using the same OR-Tools back-end. Native Python is the most likely to return a schema-valid solution that fails verification, whereas solver-backed paths preserve higher conditional fidelity. On the heuristic axis, prompting for search optimization yields only small median speed-ups (1.03-1.12x) and a strongly bimodal effect: many instances slow down, and correctness drops sharply on a long tail of problems. A paired code-level audit traces these regressions to a recurring heuristic trap. Under an efficiency-oriented prompt, the LLM may replace complete search with local approximations (Python), inject unverified bounds (Python + OR-Tools), or add redundant declarative machinery that overwhelms or over-constrains the model (MiniZinc + OR-Tools). These findings support a conservative design principle for LLM-generated combinatorial solvers: use the LLM primarily to formalize variables, constraints, and objectives for verified solvers, and separately check any LLM-authored search optimization before use.

cs.AI↗

arXiv2026

Automated Detection and Climatological Analysis of Ripple-Scale Gravity Wave Instabilities Using a Squeeze-and-Excitation Convolutional Neural Network

All-sky OH airglow imaging provides two-dimensional observations of mesospheric gravity wave structure near ~87 km altitude. Ripple-scale instability signatures, characterized by 5-15 km horizontal wavelengths and short lifetimes, are particularly difficult to identify consistently using manual inspection. In this study, we develop a reproducible, automated detection framework based on a squeeze-and-excitation convolutional neural network (SE-CNN) trained on 41 x 41 pixel image patches, to identify ripple-scale structures in 512 x 512 pixel all-sky airglow images acquired at Yucca Ridge Field Station (40.7o N, 104.9o W). The time-differenced images are normalized using a robust median-absolute-deviation (MAD) scaling procedure to mitigate star contamination and background variability. The model is trained and validated on manually annotated ripple and non-ripple patches, then evaluated using independent test subsets. The automated detection is performed using a sliding-window approach with spatial and temporal clustering criteria for event definition. At the patch level, the classifier achieves 92\% F1-score with high precision and recall. At the event level, automated detections recover approximately 90\% of manually identified ripple events while identifying additional low-amplitude occurrences. Validated against previous manual identification study, the automated detection catalog enables objective quantification of ripple occurrence frequency, seasonal modulation, and lifetime distributions. By emphasizing methodological transparency, calibration considerations, and validation metrics, this framework establishes a scalable measurement technique for systematic detection of mesospheric instability signatures in long-term airglow image archives.

physics.ao-ph↗

arXiv2026

SceneFactory: GPU-Accelerated Multi-Agent Driving Simulation with Physics-Based Vehicle Dynamics

Autonomous-driving simulators typically trade physical fidelity for scalable parallelism. Physics-based platforms such as CARLA and MetaDrive provide articulated vehicle dynamics and contact, but their non-vectorized interfaces make batched training difficult. GPU-batched systems such as Waymax and GPUDrive scale to hundreds of scenarios by replacing rigid-body physics with simplified kinematic models, omitting tire--road interaction, suspension, contact dynamics, and road-condition-dependent friction. We introduce SceneFactory, a GPU-vectorized platform for procedural scene construction, physics-based multi-agent simulation, and RL in autonomous-driving environments. Built on NVIDIA Isaac Sim + Isaac Lab, SceneFactory represents worlds and agents as batched tensors: control, observations, rewards, resets, and policy inference run as GPU tensor operations over the Isaac Lab tensor API. SceneFactory converts Waymo Open Motion Dataset road topologies into simulation-ready USD worlds, runs many worlds concurrently on one GPU, populates each with multiple articulated PhysX vehicles, and maps precipitation and road-surface type to PhysX material friction coefficients. With GPU vectorization, SceneFactory achieves up to 127$\times$ higher throughput than a non-vectorized PhysX baseline on the same GPU and physics solver, reaching 19,250 controlled-agent simulation steps per second at 256 worlds $\times$ 16 agents. Cross-simulator transfer reveals an asymmetric dynamics gap: physics-grounded RL policies transfer to a simplified kinematic bicycle model with 99.5% success, whereas reverse transfer drops to 47.3%. Under wet-road friction, friction-aware policies reduce mean peak DRAC from 58.7 to 27.8,m/s$^2$ without sacrificing goal reach. SceneFactory shows that scalable autonomous-driving training need not discard articulated rigid-body dynamics or physically grounded road-condition variation.

cs.MA↗

arXiv2026

Bifurcations of grazing loops of arbitrary tangent multiplicity in piecewise-smooth systems

In piecewise-smooth differential systems, a hyperbolic limit cycle of a subsystem loses its structural stability if it grazes the switching manifold at a tangent point. Such a cycle is called a grazing loop and in this paper we investigate its bifurcations for arbitrary tangent multiplicity. For the low-multiplicity tangency, the recurrences are comprehensively captured by a functional perturbation with two parameters in previous publications, where the parameters characterize the recurrences near the tangent point and the limit cycle respectively. However, for high-multiplicity tangency, these parameters fail to capture the recurrences and thus, Poincare return maps can not be defined as usual. To address these challenges, we construct a functional perturbation with functions to clarify the recurrences and simultaneously, propose a localization method to make these two recurrences equivalent. We finally establish a quantitative relationship between the multiplicity of tangency and the numbers of crossing limit cycles, sliding loops bifurcating from the grazing loop and the number of tangent points on these sliding loops.

math.DS↗

arXiv2026

Jovian Zonal Winds Revealed from Cassini/VIMS Observations

Understanding Jupiter's zonal winds is crucial to unraveling the dynamics of its atmosphere. Over the last decades, multiple data sources and techniques have been used to study zonal winds in Jupiter. Here, we develop a correlation-based method for the near-infrared data from the Cassini spacecraft to investigate zonal winds at different altitudes. The new method uses Jupiter's rotation to scan the planet as it rotates, allowing retrieval of winds from the analysis of light-curves of specific pixels over the Jovian disc. The method allows the retrieval of winds at multiple wavelengths from the Cassini/VIMS spectral data despite the low spatial resolution and the non-uniform cadence of the data. By applying this method to two VIMS data cubes acquired on 15 January 2001 at 09:42 UT and 16 January 2001 at 03:22 UT, we reveal the zonal winds at five main latitudes using information from three different wavebands, as well as the wind vertical structure at the equator, showing significant vertical wind shear in the troposphere. The vertical wind shear we derived is weaker than as reported in previous studies, highlighting the intricate interactions among multiple dynamical processes in Jupiter's atmosphere and reflecting the complexity of its atmospheric circulation. Despite the uncertainty due to the low spatial/temporal resolution and non-uniform cadence of the Cassini/VIMS-IR spectral data, the new method established in this study maximizes the value of the Cassini/VIMS in understanding Jupiter's zonal winds. Further observations are essential to explore the underlying mechanisms in Jupiter's atmosphere.

astro-ph.EP↗

arXiv2026

Resource-efficient parallel entanglement generation for multinode quantum networks via time-bin multiplexing

Nonlocal entanglement generation among multiple remote quantum nodes provides a critical foundation for a variety of counterintuitive quantum applications. The exponential loss of photons transmitting over optical fibers sets an upper limit for entangling these quantum nodes. Here, we propose a resource-efficient and parallel protocol for entangling multiple remote quantum nodes via time-bin multiplexing. The transmission of a single photon with qudit-encoding in the time-bin mode enables entangling multiple stationary qubits in parallel, when single photons and individual stationary qubits interfaces are used and photon-state modulations are properly introduced before subsequently impinging the photon into each interface. Our protocol can generate parallel multipartite entanglement among ($N\geq3$) quantum nodes with the dimension of the photonic time bins independent of $N$, exponentially reducing the requirements for the coherence time of the stationary qubits and for the complexity of the photonic modulations. These distinct features make our protocol particularly advantageous for the development of multinode quantum networks.

quant-ph↗

arXiv2026

Reducing Conversational Escalation in Large Language Model Dialogue with Nonviolent Communication Constraints

Large language models (LLMs) are increasingly used in emotionally charged situations involving interpersonal conflict, frustration, and distress. While prior safety research has focused on preventing explicit harms such as toxic or policy-violating content, less attention has been paid to conversational behaviors that may unintentionally escalate conflict. In this paper, we investigate whether LLMs can be guided toward more de-escalating dialogue behavior through lightweight prompt-level constraints derived from Nonviolent Communication (NVC). We reformulate NVC principles as process-oriented guidelines that discourage blame attribution, emphasize attention to users' emotional experiences, and encourage clarification before advice. Using a dual-agent simulation framework across multiple instruction-tuned models and user resistance levels, we show that NVC-constrained prompting consistently reduces conversational escalation and stabilizes interactions with highly resistant users. These results suggest that simple communication constraints can meaningfully improve the trustworthiness of LLM dialogue in conflict-prone settings.

cs.CL↗

arXiv2026

Parallel distributed quantum gates for dual-species quantum emitters

We propose a parallel protocol for implementing distributed nonlocal quantum gates between spatially separated stationary qubits encoded in dual-species quantum emitters (i.e., color-center and superconducting qubits). By utilizing entangled photon pairs with distinct frequencies as a quantum data bus, our approach connects spatially separated devices without requiring quantum frequency conversion or preshared entanglement, while maintaining an always-ready and resource-efficient property for distributed quantum computing and networks. Furthermore, we demonstrate the feasibility of implementing parallel distributed nonlocal quantum gates on multiple pairs of spatially separated qubits using a single high-dimensional entangled photon pair, which directly benefits from the enhanced quantum capacity provided by optical qudit encoding. Our protocol establishes a scalable and practically implementable framework for distributed quantum networks, potentially enabling the development of future large-scale quantum computing architectures.

quant-ph↗

arXiv2026

SLIDE: Simultaneous Model Downloading and Inference at the Wireless Network Edge

To support on-device inference, the next-generation mobile networks are expected to support real-time model downloading services to mobile users. However, powerful AI models typically have large model sizes, resulting in excessive end-to-end (E2E) downloading-and-inference (DAI) latency. To address this issue, we propose a simultaneous model downloading and inference (SLIDE) framework, which allows users to perform inference with downloaded layers while simultaneously receiving the remaining layers of the model. To this end, we formulate a task throughput maximization problem by jointly optimizing model provisioning, spectrum bandwidth allocation, and computing resource allocation for multi-user downlink systems. Unlike traditional DAI frameworks, SLIDE introduces recursive dependencies across layers, where inference latency depends recursively on the downloading bandwidth and computing resource allocation for each of the preceding layers. To solve this challenging problem, we design an efficient algorithm that acquires the optimal solution with polynomial-time complexity. Simulation results demonstrate that the proposed SLIDE framework significantly improves task throughput under latency and communication resource constraints compared with the conventional model downloading schemes.

cs.NI↗

arXiv2026

Bi-LoRA: Efficient Sharpness-Aware Minimization for Fine-Tuning Large-Scale Models

Fine-tuning large-scale pre-trained models with limited data presents significant challenges for generalization. While Sharpness-Aware Minimization (SAM) has proven effective in improving generalization by seeking flat minima, its substantial extra memory and computation overhead make it impractical for large models. Integrating SAM with parameter-efficient fine-tuning methods like Low-Rank Adaptation (LoRA) is a promising direction. However, we find that directly applying SAM to LoRA parameters limits the sharpness optimization to a restricted subspace, hindering its effectiveness. To address this limitation, we propose Bi-directional Low-Rank Adaptation (Bi-LoRA), which introduces an auxiliary LoRA module to model SAM's adversarial weight perturbations. It decouples SAM's weight perturbations from LoRA optimization: the primary LoRA module adapts to specific tasks via standard gradient descent, while the auxiliary module captures the sharpness of the loss landscape through gradient ascent. Such dual-module design enables Bi-LoRA to capture broader sharpness for achieving flatter minima while remaining memory-efficient. Another important benefit is that the dual design allows for simultaneous optimization and perturbation, eliminating SAM's doubled training costs. Extensive experiments across diverse tasks and architectures demonstrate Bi-LoRA's efficiency and effectiveness in enhancing generalization.

cs.LG↗

arXiv2026

In-Context Autonomous Network Incident Response: An End-to-End Large Language Model Agent Approach

Rapidly evolving cyberattacks demand incident response systems that can autonomously learn and adapt to changing threats. Prior work has extensively explored the reinforcement learning approach, which involves learning response strategies through extensive simulation of the incident. While this approach can be effective, it requires handcrafted modeling of the simulator and suppresses useful semantics from raw system logs and alerts. To address these limitations, we propose to leverage large language models' (LLM) pre-trained security knowledge and in-context learning to create an end-to-end agentic solution for incident response planning. Specifically, our agent integrates four functionalities, perception, reasoning, planning, and action, into one lightweight LLM (14b model). Through fine-tuning and chain-of-thought reasoning, our LLM agent is capable of processing system logs and inferring the underlying network state (perception), updating its conjecture of attack models (reasoning), simulating consequences under different response strategies (planning), and generating an effective response (action). By comparing LLM-simulated outcomes with actual observations, the LLM agent repeatedly refines its attack conjecture and corresponding response, thereby demonstrating in-context adaptation. Our agentic approach is free of modeling and can run on commodity hardware. When evaluated on incident logs reported in the literature, our agent achieves recovery up to 23% faster than those of frontier LLMs.

cs.CR↗

arXiv2026

WisPaper: Your AI Scholar Search Engine

We present \textsc{WisPaper}, an end-to-end agent system that transforms how researchers discover, organize, and track academic literature. The system addresses two fundamental challenges. (1)~\textit{Semantic search limitations}: existing academic search engines match keywords but cannot verify whether papers truly address complex research questions; and (2)~\textit{Workflow fragmentation}: researchers must manually stitch together separate tools for discovery, organization, and monitoring. \textsc{WisPaper} tackles these through three integrated modules. \textbf{Scholar Search} combines rapid keyword retrieval with \textit{Deep Search}, in which an agentic model, \textsc{WisModel}, validates candidate papers against user queries through structured reasoning. Discovered papers flow seamlessly into \textbf{Library} with one click, where systematic organization progressively builds a user profile that sharpens the recommendations of \textbf{AI Feeds}, which continuously surfaces relevant new publications and in turn guides subsequent exploration, closing the loop from discovery to long-term awareness. On TaxoBench, \textsc{WisPaper} achieves 22.26\% recall, surpassing the O3 baseline (20.92\%). Furthermore, \textsc{WisModel} attains 93.70\% validation accuracy, effectively mitigating retrieval hallucinations.

cs.IR↗

arXiv2026

A MIDAS-based Data Acquisition System for Gaseous Detectors

We present a data acquisition~(DAQ) software based on the MIDAS framework, specifically for gaseous detectors to support the detector deployments and applications. It implements a comprehensive suite of functions, including parameter configuration, data acquisition, decoding, and storage, alongside web-based operation and real-time monitoring capabilities. We establish a fully unified workflow spanning data acquisition to offline analysis, enabling real-time visualization of signal waveforms and energy spectra. The system has been successfully deployed in the PandaX-III experiment, which utilized a high-pressure gaseous detector to search for neutrinoless double beta decay. Its performance and stability have been validated through tests involving two distinct electronics setups and joint commissioning with the detector.

physics.ins-det↗

arXiv2026

ADAM: A Systematic Data Extraction Attack on Agent Memory via Adaptive Querying

Large Language Model (LLM) agents have achieved rapid adoption and demonstrated remarkable capabilities across a wide range of applications. To improve reasoning and task execution, modern LLM agents would incorporate memory modules or retrieval-augmented generation (RAG) mechanisms, enabling them to further leverage prior interactions or external knowledge. However, such a design also introduces a group of critical privacy vulnerabilities: sensitive information stored in memory can be leaked through query-based attacks. Although feasible, existing attacks often achieve only limited performance, with low attack success rates (ASR). In this paper, we propose ADAM, a novel privacy attack that features data distribution estimation of a victim agent's memory and employs an entropy-guided query strategy for maximizing privacy leakage. Extensive experiments demonstrate that our attack substantially outperforms state-of-the-art ones, achieving up to 100% ASRs. These results thus underscore the urgent need for robust privacy-preserving methods for current LLM agents.

cs.CR↗

arXiv2026

ALDEN: Boosting Private Data Extraction from Retrieval-Augmented Generation Systems via Active Learning and Distribution Estimation

Retrieval-Augmented Generation (RAG) is widely used to augment large language models with external knowledge retrieval to improve reliability and generalization. However, recent studies have shown that RAG systems remain vulnerable to data extraction attacks, where adversaries can extract private data by embedding malicious commands into user queries. Despite their feasibility, existing attacks typically suffer from low data extraction rates and limited practical effectiveness. Here, we propose ALDEN, a novel attack that effectively and efficiently extracts private data from RAGs. First, we employ active learning to diversify malicious queries and improve data extraction rates. Second, we observe that the data distribution of the underlying knowledge base provides valuable guidance for query generation and introduce a decay-based dynamic algorithm to estimate the corresponding topic distribution. By combining them together, we demonstrate that ALDEN substantially outperforms state-of-the-art methods through comprehensive evaluations.

cs.IR↗

arXiv2026

Precise $^{136}$Xe Double Beta Decay Measurement in PandaX-4T with Implications on the Nuclear Matrix Elements and Majorons

The continuous spectrum of double beta decay ($ββ$) provides a sensitive probe to test the predictions of the standard model and to search for signatures of new physics beyond it. We present a comprehensive analysis of the $^{136}$Xe $ββ$ spectrum utilizing $39.1 \pm 0.7~\textrm{kg}\cdot\textrm{yr}$ of $^{136}$Xe exposure from the PandaX-4T experiment. The analysis yields the most precise measurement to date of the $^{136}$Xe two-neutrino double beta decay ($2νββ$) half-life, $(2.14 \pm 0.05) \times 10^{21}$ years, the uncertainty of which is reduced by a factor of 2 compared to our previous result. We measure the parameter $ξ_{31}^{2ν}$, defined as the ratio between the subleading and leading components of the $^{136}$Xe $2νββ$ nuclear matrix element, to be $0.59^{+0.41}_{-0.38}$, which is consistent with theoretical predictions. We also search for Majoron-emitting modes of $^{136}$Xe $ββ$, establishing the most stringent limit for the spectral index $n=7$.

nucl-ex↗

arXiv2026

Global near-real-time daily emissions of atmospheric pollutants from power plants

The power sector is a major source of fossil fuel use and air pollutant emissions, making high-spatiotemporal-resolution emission accounting essential for effective mitigation policy and air quality management. Yet existing public inventories are often limited by low timeliness and coarse resolution. Here, we develop a global, plant-level, daily, multi-pollutant emission database for the power sector by integrating nearly 3 million hourly-to-daily near-real-time power generation records from 57 countries, representing about 81% of global fossil-fuel-based electricity generation, with fundamental information for more than 10,000 power plants worldwide, including location and installed capacity. The dataset substantially improves the timeliness and granularity of global power-sector emission estimates. From 2019 to 2025, emissions of most pollutants increased, with 2025 daily mean emissions reaching 0.274 kt/d for BC, 45.1 kt/d for CO, 0.418 kt/d for NH3, 52.2 kt/d for NOx, 3.01 kt/d for NMVOC, 0.418 kt/d for OC, 6.76 kt/d for PM10, 5.11 kt/d for PM2.5, and 78.5 kt/d for SO2. Compared with 2019, NMVOC showed the largest increase, whereas SO2 was the only pollutant to decline overall. Coal remained the dominant source of sulfur-, nitrogen-, and particulate-related emissions, while gas and biomass contributed more to carbonaceous species and reduced nitrogen. The dataset also captures pronounced seasonal, regional, and short-term variability. Against EDGAR for 2019-2022, our estimates agree well, with Pearson correlations of 0.92-0.99 and mean relative deviations of 8.8%-28.1%. This near-real-time, high-resolution dataset provides a strong foundation for air pollution control, carbon mitigation, emission monitoring, and satellite-based inversion.

physics.ao-ph↗