Searcharxiv⌕ Search

arXiv subjects

Tao Li

Publications and source records attributed to Tao Li.

At least 55 records · Page 3Linked to original sources

Agentic Incident Response through Digital Twin-Enhanced Multiscale Planning

Incident response is currently managed by security operators using predefined playbooks, resulting in slow, labor-intensive security decision-making processes. Consequently, there is a growing need for automated incident response planning. Decision-theoretic approaches based on control, optimization, and reinforcement learning have been proposed to automate such planning tasks with well-grounded approaches, yet most of which, while guaranteeing strong performance, are limited to abstract models and cannot be directly applied to operational systems. A promising approach to mitigate this limitation is to use the security knowledge embedded in large language models (LLMs) to develop agentic response systems. However, current agentic approaches rely on repeated invocations of the LLM to generate a response plan, which is unreliable and limits the planning horizon due to hallucination. In this paper, we develop a principled LLM-based planning method by combining decision-theoretic planning with LLM-generated response commands. The proposed agentic incident response approach uses a rollout planner to compute a high-level response strategy that allocates security resources (the tactical scale), which is then translated into executable commands by a lightweight LLM agent (the operational scale). Within this architecture, we use a digital twin that supports tactical planning through simulation and operational execution through emulation. Across three attack scenarios, our agentic approach reduces recovery execution time by 15.1\% on average and increases the recovery rate by 33.6\% over frontier LLM baselines.

cs.CR↗

Securing Contrastive mmWave-based Human Activity Recognition against Adversarial Label Flipping

Wireless Human Activity Recognition (HAR), leveraging their non-intrusive nature, has the potential to revolutionize various sectors, including healthcare, virtual reality, and surveillance. The advent of millimeter wave (mmWave) technology has significantly enhanced the capabilities of wireless HAR systems. This paper presents the first systematic study on the vulnerabilities of mmWave-based HAR to label flipping poisoning attacks in the context of supervised contrastive learning. We identify three label poisoning attacks on the contrastive mmWave-based HAR and propose corresponding countermeasures. The efficacy of the attacks and also our countermeasures are experimentally validated on a prototype system. The attacks and countermeasures can be easily extended to other wireless HAR systems, thereby promoting security considerations in system design and deployment.

cs.CR↗

To What Extent Can Inherent Communication Noise Guarantee Privacy in Distributed Cooperative Control?

This paper proposes a differentially private distributed cooperative control scheme for multi-agent systems (MAS). Unlike conventional approaches that actively inject artificial noise for privacy protection, this work investigates whether inherent communication noise can itself serve as a natural privacy mechanism. A physically motivated communication-noise model is developed for mobile MAS by incorporating transmitter perturbation, receiver noise, path-loss attenuation, and log-normal shadowing. The resulting effective noise variance depends on inter-agent state differences, thereby capturing the distance-dependent signal perturbation arising in practice. Based on this model, a distributed finite-horizon Linear Quadratic Regulator (LQR) mechanism is designed to achieve formation tracking while protecting agents' private control preferences. Rather than protecting the full local cost function, the proposed privacy formulation focuses on the ratio of the LQR weighting matrices, which captures the trade-off between tracking accuracy and control effort when the quadratic cost structure is publicly known. A set-theoretic sensitivity analysis shows that this weighting-ratio adjacency formulation yields less conservative privacy bounds than gradient-based protection under the considered addition/removal adjacency relation. Theoretical analysis demonstrates that, under suitable design conditions, the proposed mechanism provides bounded cumulative (ε,δ)-differential privacy guarantees for the weighting ratios over an infinite horizon without artificial noise injection. Meanwhile, the cooperative tracking error is shown to converge almost surely and in mean square to a finite random limit, with its expectation remaining bounded. Numerical examples validate the theoretical results and illustrate the resulting privacy-performance trade-off.

eess.SY↗

NWaaS: A Non-Intrusive and Privacy-Preserving Watermarking-as-a-Service System with Adaptive Resource Scheduling

Securing intellectual property (IP) in Machine Learning as a Service is critical yet challenging. While deep neural network watermarking serves as a standard defense against model extraction, existing Watermarking-as-a-Service paradigms face a triple challenge of intrusiveness, privacy risks, and inefficiency. To address these challenges, we propose Non-intrusive Watermarking as a Service (NWaaS), a holistic framework enabling trustworthy and efficient IP protection. We first introduce $\mathtt{ShadowMark}$, a novel watermarking algorithm that establishes a side-channel for ownership verification without modifying the model. It ensures zero performance degradation and eliminates the need for parameter-heavy fine-tuning as well as access to original training data, thereby addressing the intrusiveness and inefficiency inherent in existing approaches. Leveraging this non-intrusive property, we design a collaborative partitioning mechanism that allows model owners to offload self-defined partial layers, enabling a flexible trade-off between IP privacy and service cost. Furthermore, to mitigate latency from collaborative computing under high concurrency and enhance system resource utilization, we propose proportion disparity joint scheduling, a payload-balancing resource scheduling algorithm tailored to the heterogeneous constraints of edge-cloud environments. Extensive experiments demonstrate that NWaaS provides robust ownership verification across diverse continuous X-to-Image modalities, while ensuring secure owner privacy protection and superior system performance.

cs.CR↗

ASTRA-Net: Anatomy-Specific Transfer and Representation Alignment for Drug-Induced Sleep Endoscopy Segmentation

Quantitative drug-induced sleep endoscopy (DISE) requires reliable airway boundaries at specific anatomical levels. Pixel-level DISE annotations are scarce, and manual contouring limits the scalability of quantitative assessment. To address this limitation, we developed ASTRA-Net for known-plane DISE segmentation with limited real annotations. Stage 1 aligned intermediate ConvNeXt-Base representations from 14,250 unlabeled virtual endoscopy frames derived from computed tomography and real DISE frames. Virtual images were used only for feature alignment. Stage 2 fine-tuned four independent UNet++ decoders on 401 real annotated frames. Structured zero-mask supervision constrained incompatible plane outputs and invalid frames. Six alignment configurations used maximum mean discrepancy, domain adversarial learning, or both objectives. On a hold-out evaluation set of 100 frames, the five-model MMD-only segmentation ensemble achieved a mean Dice of 0.8927, with a 95% image-level bootstrap interval of 0.8631 to 0.9160. The mean intersection over union was 0.8239. A classification- enabled variant of the same alignment configuration reached a restricted four-plane top-1 accuracy of 0.92 on the same hold-out frames. These results indicate that ASTRA-Net can support frame-level, plane-specific DISE boundary delineation when real annotations are limited.

cs.CV↗

Dynamics of Long-lived Carriers in Molybdenum Carbide Nanosheets

Molybdenum carbide (MoC) is a promising candidate for substituting expensive platinum-group metals in many applications owing to its low cost and excellent properties, therefore a comprehensive understanding of its carrier dynamics is demanded for advancing the synthesis strategy and implementation of MoC. In this work, the carrier relaxation in MoC nanosheets is investigated by combining the femtosecond transient reflection spectroscopy with the first-principles calculations. The measured processes of electron-electron, electron-phonon, and phonon-phonon scattering show significantly longer lifetimes compared to those of other transition metal carbides. Through the analysis of calculated phonon dispersion, the nanosecond carrier lifetime is explained by the restricted phonon decay pathways, which is induced by the large mass difference between Mo and C atoms. The observed slow carrier cooling rate in our study offers a straightforward approach for effectively utilizing hot carriers, which is expected to improve the performance of photothermal and photovoltaic devices.

cond-mat.mtrl-sci↗

Monogamy inequalities of entanglement of assistance in $2\otimes 2\otimes d$ systems

The monogamy relations characterize the distribution of quantum correlations among the multipartite quantum systems. We study the monogamy relations of the entanglement of assistance in $2\otimes 2\otimes d$ systems. We present explicitly the relations satisfied by the concurrence, the tangle and the concurrence of assistance, which can be used to derive rigorous monogamy relations. Detailed examples are given to illustrate our results.

quant-ph↗

Normal form method of center-focus problem in piecewise-smooth systems and algorithm design

We investigate the normal form method in piecewise-smooth monodromic systems to distinguish center from focus and determine the order of focus as well as degenerate Hopf bifurcations. For the normal form of piecewise-smooth monodromic systems given in previous publications in the sense of topologically equivalence, we prove the algebraic equivalence between the Lyapunov constants of the original piecewise-smooth system and the coefficient series of its normal form. With this algebraic equivalence, we prefer to compute the normal form coefficient series to avoid cumbersome integrals of trigonometric functions in the computation of Lyapunov constants, and find the relations of foci of the piecewise-smooth system and its subsystems: among the orders and among the stabilities. Moreover, we design algorithms for computing the normal form coefficient series and combine them with the obtained stability relation to construct stabilizing switching signals for state-dependent switched nonlinear systems, one basic problem in the control theory.

math.DS↗

Circuit and Krylov complexity of primordial perturbations of modified gravity in inflation

In this work, we investigate quantum complexity diagnostics of primordial curvature perturbations within the inflationary paradigm. We compare canonical scalar-field inflation with the modified gravity model $f(ϕ,R)$, focusing on the evolution of the two-mode squeezed state generated by the coupling between the $\vec{k}$ and $-\vec{k}$ momentum sectors. Starting from the quadratic action for curvature perturbations, we derive the evolution equations for the squeezed strength $r_k$ and squeezed angle $ϕ_k$, utilizing them to evaluate both circuit complexity and Krylov-space diagnostics. Specifically, we compute the Krylov complexity, Krylov entropy, Lanczos coefficients $b_n$, and an effective dissipative contribution $c_n$ within an open-system extension. Our numerical results demonstrate that the $f(ϕ,R)$ coupling enhances the squeezed strength relative to the canonical scalar field inflation. Since the Krylov complexity of the two-mode squeezed state is directly controlled by the mean pair number ($K=\sinh^2 r_k$), this enhancement leads to a smaller growth in Krylov complexity and related Krylov-space quantities. Furthermore, circuit complexity displays a more pronounced evolution in the $f(ϕ,R)$ framework, particularly after the horizon exit regime. Ultimately, our work sheds new light on the quantum complexity of modified gravity $f(ϕ,R)$.

hep-th↗

RPLSS: A randomized projected linear systems solver

The projected linear system solver (PLSS), by incrementally appending columns to a random or deterministic sketching matrix, provides an attractive finite termination property for consistent linear systems. Nevertheless, a critical computational bottleneck of PLSS is accessing the whole coefficient matrix per iteration, making it prohibitive for extremely large-scale problems or applications with missing data. To alleviate this limitation, we propose a unified randomized PLSS (RPLSS) framework, built upon the tailored randomized row or column selection strategies that require only partial matrix information per iteration, for solving a general linear system, whether it is under- or overdetermined, and whether it is consistent or not. Within this framework, we develop a randomized Gaussian Kaczmarz method and its extended variant as row-action solvers, and randomized coordinate descent variants as column-action solvers. Theoretically, we prove that our methods inherit the finite termination property of PLSS, while achieving an exponential convergence rate, overcoming the sluggish convergence inherent in conventional randomized Kaczmarz and coordinate descent methods. Numerical experiments demonstrate the superiority of our method against state-of-the-art randomized methods, particularly in scenarios with large missing data.

math.NA↗

Prima.cpp: Fast 30-70B LLM Inference on Heterogeneous and Low-Resource Home Clusters

On-device inference offers privacy, offline use, and instant response, but consumer hardware restricts large language models (LLMs) to low throughput and capability. To overcome this challenge, we present prima.cpp, a distributed on-device inference system that runs 30-70B LLMs on consumer home clusters with mixed CPUs/GPUs, insufficient RAM/VRAM, slow disks, Wi-Fi links, and heterogeneous OSs. We introduce pipelined-ring parallelism (PRP) to overlap disk I/O with compute and communication, and address the prefetch-release conflict in mmap-based offloading. We further propose Halda, a heterogeneity-aware scheduler that co-optimizes per-device CPU/GPU workloads and device selection under RAM/VRAM constraints. On four consumer home devices, a 70B model reaches 674 ms/token TPOT with <6% memory pressure, and a 32B model with speculative decoding achieves 26 tokens/s. Compared with llama.cpp, exo, and dllama, our proposed prima.cpp achieves 5-17 times lower TPOT, supports fine-grained model sizes from 8B to 70B, ensures broader cross-OS and quantization compatibility, and remains OOM-free, while also being Wi-Fi tolerant, privacy-preserving, and hardware-independent. The code is available at https://github.com/OpenCPIL/prima.cpp.

cs.DC↗

Towards Mitigation of Hallucination for LLM-empowered Agents: Progressive Generalization Bound Exploration and Watchdog Monitor

Empowered by large language models (LLMs), intelligent agents have become a popular paradigm for interacting with open environments to facilitate AI deployment. However, hallucinations generated by LLMs-where outputs are inconsistent with facts-pose a significant challenge, undermining the credibility of intelligent agents. Only if hallucinations can be mitigated, the intelligent agents can be used in real-world without any catastrophic risk. Therefore, effective detection and mitigation of hallucinations are crucial to ensure the dependability of agents. Unfortunately, the related approaches either depend on white-box access to LLMs or fail to accurately identify hallucinations. To address the challenge posed by hallucinations of intelligent agents, we present HalMit, a novel black-box watchdog framework that models the generalization bound of LLM-empowered agents and thus detect hallucinations without requiring internal knowledge of the LLM's architecture. Specifically, a probabilistic fractal sampling technique is proposed to generate a sufficient number of queries to trigger the incredible responses in parallel, efficiently identifying the generalization bound of the target agent. Experimental evaluations demonstrate that HalMit significantly outperforms existing approaches in hallucination monitoring. Its black-box nature and superior performance make HalMit a promising solution for enhancing the dependability of LLM-powered systems.

cs.LG↗

Measurement of solar $pp$ neutrino flux with the new PandaX-4T data

We report a new measurement of the solar proton--proton ($pp$) neutrino flux via neutrino--electron elastic scattering using the PandaX-4T Run 2 data set collected between 2024 and 2026, corresponding to an exposure of 1.9 tonne$\cdot$yr. Before Run 2 data taking, the detector underwent a series of upgrades to improve its response and background conditions. Time variations of radioactive noble-gas impurities are constrained using the physics data themselves, complemented by measurements from the gas-assay system. The analysis introduced improvements in the data processing chain, detector response characterization, and background models. A blind spectral analysis was then performed on the electronic-recoil data across a wide energy range from 20 to 1000 keV. In combination with the Run 0 data published earlier, the fitted $pp$ flux is $(8.5 \pm 3.5)\times 10^{10}$ $\mathrm{cm^{-2}s^{-1}}$, consistent with the prediction of the Standard Solar Model. With a statistical significance of $2.2σ$ above background, this marks the first positive indication of solar $pp$ neutrino--electron scattering below an electronic-recoil energy of 165 keV.

hep-ex↗

Labimus: A Simulation and Benchmark for Humanoid Dexterous Manipulation in Chemical Laboratory

Laboratory automation has made remarkable progress through robotic platforms and AI-driven scientific reasoning. However, many laboratory operations (e.g., solid--solid transfer) remain inherently dynamic and require real-time adaptation to different materials and experimental conditions. Such precision-critical manipulations are difficult to standardize, motivating the use of humanoid robots with dexterous hands. Despite this opportunity, no existing benchmark evaluates humanoid manipulation in precision-critical laboratory environments. We present Labimus, to our knowledge, the first benchmark for humanoid dexterous manipulation in organic chemistry laboratories. Labimus reconstructs over 30 functionally faithful assets from real organic chemistry workstations through real-to-sim modeling, collectively covering the core operations of routine organic chemistry experiments. The benchmark integrates articulated laboratory instruments, particle-based powder physics, and closed-loop instrument readouts, enabling a complete manipulation-to-measurement pipeline. It further defines six atomic operations and a seven-step solid-weighing workflow derived from real laboratory standard operating procedures. We introduce a precision-aware evaluation protocol designed to jointly measure task completion, experimental precision, and long-horizon execution. We benchmark three representative policies under procedural layouts and environmental perturbations. Results reveal a precision gap: policies that successfully complete laboratory tasks can still fail to satisfy the quantitative tolerances required by experimental protocols. Our benchmark exposes a fundamental disconnect between task completion and experimental validity, providing a new testbed for developing reliable humanoid robots for scientific laboratories.

cs.RO↗

Rethinking On-policy Optimization for Query Augmentation

Recent advances in large language models (LLMs) have led to a surge of interest in query augmentation for information retrieval (IR). Two main approaches have emerged. The first prompts LLMs to generate answers or pseudo-documents that serve as new queries, relying purely on the model's parametric knowledge or contextual information. The second applies reinforcement learning (RL) to fine-tune LLMs for query rewriting, directly optimizing retrieval metrics. While having respective advantages and limitations, the two approaches have not been compared under consistent experimental conditions. In this work, we present the first systematic comparison of prompting-based and RL-based query augmentation across diverse benchmarks, including evidence-seeking, ad hoc, and tool retrieval. Our key finding is that under a compute-aware comparison setting, simple, training-free query augmentation often performs on par with, or even surpasses, more expensive RL-based counterparts, especially when using powerful LLMs. Motivated by this discovery, we introduce a novel hybrid method, On-policy Pseudo-document Query Expansion (OPQE), in which the LLM policy learns to generate a pseudo-document that maximizes retrieval performance, rather than rewriting the query, thus merging the flexibility and generative structure of prompting with the targeted optimization of RL. We show OPQE outperforms both standalone prompting and RL-based rewriting, demonstrating that a synergistic approach yields the best results. We open source our implementation to facilitate reproducibility.

cs.CL↗

Continuous-Time Decentralized Online Estimation With Additive Noises

We study a decentralized online estimation problem with additive communication noises over the fixed digraph. Each node has a linear measurement of an unknown parameter with random measurement matrices and runs a continuous-time online estimation algorithm. We transform the convergence analysis of the algorithm into the stability analysis of the non-autonomous linear stochastic differential equation (SDE) with random time-varying coefficients, and develop the asymptotic stability by numerical approximation theory. Based on the stability results, we show that the algorithm gains can be properly designed to ensure mean square convergence if the measurement matrices and the communication graph satisfy the stochastic spatial-temporal persistence of excitation condition. Furthermore, a special case where the measurement matrices contain a Markov chain is investigated, and the theoretical results are demonstrated by a numerical example.

eess.SY↗

Inpainting U-Net for seamless pedestrian-level wind prediction across urban morphologies

Pedestrian-level wind prediction is essential for urban design and wind-comfort assessment, but high-fidelity simulations such as LES remain computationally expensive for rapid evaluation. This study develops a two-stage U-Net framework for efficient prediction of time-averaged pedestrian-level wind speed over realistic urban morphologies. The model is trained and evaluated using the UrbanTALES dataset, which contains realistic city configurations under different approaching wind directions. In the first stage, a baseline U-Net model (M1) predicts wind fields patch-by-patch from normalised building height and fetch information. This formulation allows application to urban domains of arbitrary size, but independent patch inference can introduce discontinuities at patch boundaries. To address this, a second U-Net model (M2) is introduced as an inpainting-based refinement model. M2 uses a larger contextual window containing the initial M1 prediction and local morphology to reduce discontinuities using neighbouring flow information. During full-field inference, M2 is applied iteratively using a Gauss-Seidel scheme until convergence. Results show that M1 captures the main spatial distribution of pedestrian-level wind speed and performs well in low- and moderate-velocity regions, although high-velocity peaks are less accurate. M2 substantially reduces patch-boundary artefacts and improves spatial coherence. Across unseen urban cases, the framework reproduces mean velocity and spatial variability reasonably well, while maximum velocities remain underestimated. Overall, the proposed framework provides an efficient and flexible surrogate model for high-resolution pedestrian-level wind prediction across realistic urban morphologies.

cs.CV↗

LLM-Assisted Model-Based GUI Testing for Vue.js Web Applications

Vue.js is a popular framework for building modern web applications. As Vue.js functionality and tooling support grow, ensuring its reliability (through automated testing) is becoming increasingly important. Although model-based testing has been successfully used to automate graphical user interface (GUI) testing on other platforms, its application to Vue.js remains challenging: Transition candidates, which are spread across router configurations and single-file components (SFCs), must be concretized and normalized into an executable page transition graph (PTG) for testing. To address this, we propose the LLMVue framework, which uses a large language model (LLM) to generate a PTG from Vue.js source code. LLMVue infers component hierarchies and route transitions, merging them into a unified PTG across multiple SFCs. We evaluated LLMVue on a collection of ten open-source Vue.js projects from GitHub, using GPT-4o as the LLM backbone. The constructed graphs demonstrate high precision and recall, with low graph edit distance. LLMVue -guided testing also significantly improves the coverage and exploration efficiency, compared to a random exploration baseline (with the same time constraints). To the best of our knowledge, this is the first use of LLMs for model-based GUI testing of Vue.js applications using source-level PTG extraction.

cs.SE↗