Search arXiv⌕ Search

arXiv subjects

Zhou Su

Publications and source records attributed to Zhou Su.

At least 19 recordsLinked to original sources

NotaryMark: Multi-Bit Watermarking for Black-Box DatasetUsage Auditing in Text-to-Image Diffusion Models

As generative artificial intelligence (AI) models increasingly require data, more publicly available yet licensed data is being harvested and used without authorization. Although several previous studies have proposed watermarking methods for dataset copyright auditing, their applicability to the text-to-image (T2I) setting remains notably limited. The core drawback is that watermarks embedded by existing techniques are often treated as noise and are gradually filtered out and attenuated during the latent noising-denoising process of diffusion model training. We propose NotaryMark, to our knowledge the first multi-bit watermarking method specifically designed for black-box auditing of T2I training dataset use. The core idea of NotaryMark is to align the watermark with the latent denoising of diffusion models, thereby overcoming the signal decay that plagues existing multi-bit methods during sampling. We evaluate NotaryMark across three datasets and three diffusion models spanning watermark capacities from 8 to 1024 bits. With a watermark capacity below 32 bits, it achieves a high average bit accuracy of 0.85-0.90. With a watermark capacity exceeding 32 bits, it maintains bit accuracy between 0.67 and 0.80, consistently outperforming existing multi-bit watermark methods whose bit accuracy is around 0.42-0.60. Furthermore, we design a voting-based aggregation scheme to boost the bit accuracy with a modest budget of 30 queries. Building on this, we incorporate error-correcting codes to enable reliable decoding and tracing of the embedded identifier information. Robustness evaluation against fifteen evasion attacks spanning seven categories shows that NotaryMark remains robust under most evaluated settings, while stronger attacks generally suppress watermark evidence only at the cost of substantial utility degradation, demonstrating its practical reliability against malicious tampering.

cs.CR↗

Constrained Tensor Decomposition-Based Target Sensing for Sparse Non-Uniform Array-Enabled AFDM ISAC Systems

Sparse non-uniform array-enabled affine frequency division multiplexing (AFDM) is a promising candidate for integrated sensing and communication (ISAC), while its performance critically depends on accurate target parameter estimation. In this paper, we propose a constrained tensor decomposition-based sensing framework for delay, Doppler, and angle estimation. Specifically, a manifold-constrained alternating least squares algorithm is developed by exploiting the sparse array geometry structure, enabling robust factor matrix extraction and direct angle estimation. In addition, we analyze the uniqueness condition of the tensor decomposition. From the decomposed factor matrices, delays and Doppler shifts are coarsely estimated by pulse compression, and refined by an iterative one dimensional golden-section search.Moreover, the Cramér-Rao bound (CRB) is derived to characterize the fundamental performance limit of the considered estimation problem. Finally, simulation results validate the effectiveness of the proposed estimation algorithm.

eess.SP↗

Stealthy Malicious Interference Detection in UAV Formations: A Power-Domain Signaling Game Approach

Reliable intra-swarm communication is fundamental to cooperative sensing, control, and mission execution in unmanned aerial vehicle (UAV) swarms. In open low-altitude shared-spectrum environments, coexisting UAVs may cause benign interference through spectrum reuse and signal leakage, while jamming UAVs may deliberately degrade critical intra-swarm links. Since a jamming UAV can adjust its transmit power to disguise signal-to-interference-plus-noise ratio (SINR) degradation as link fluctuation in benign interference, stealthy jammer UAV detection remains a challenge. In this paper, we propose a novel belief-driven stealthy jammer UAV detection scheme from the perspective of Bayesian security game. To capture stealthy interference in shared-spectrum UAV swarms, the interfering UAV is modeled as a hidden benign or jamming type, whose transmit power strategy induces the SINR observed by the defender. The defender updates its posterior belief from the observed SINR and decides whether to maintain normal operation or trigger defensive power boosting. We characterize pure-strategy perfect Bayesian equilibrium (PBE) conditions under separating structures with distinguishable type and pooling structures with indistinguishable observations. Numerical results show that the proposed scheme improves the defender's expected utility compared to the conventional schemes.

cs.CR↗

Antenna Positioning and Beamforming Optimization in MA Enabled Secure ISAC Systems: A Gradient-Based Meta Learning Approach

Integrated sensing and communications (ISAC) significantly improves spectral efficiency but introduces security risks regarding the interception of embedded communication signals. This paper proposes an movable antenna (MA)-enabled secure ISAC system that utilizes the spatial degrees of freedom of MA to mitigate these risks. Then, a problem is formulated to maximize the system secrecy rate by jointly optimizing antenna positioning, transmit beamforming, and artificial noise. However, the principal challenge arises from the non-convexity of the optimization problem and the strong coupling of the optimization variables. Generally, traditional optimization methods for this problem suffer from complex mathematical derivations, while existing deep learning approaches rely heavily on the training data distribution. To address these issues, we introduce a gradient-based meta learning (GML) algorithm, which works without pre-training and demonstrates favorable performance. Specifically, the algorithm establishes a neural network for each optimization variable, where the gradient of the objective function with respect to the variable serves as the input, and the output of the network determines the variable's update step. By handling the constraints and constructing penalty terms, the global loss function is used to guide the optimization process. Extensive numerical simulations confirm that the proposed algorithm achieves satisfactory performance in terms of both communication security and sensing capabilities.

eess.SP↗

Movable Antennas Enabled Wireless Powered Networks: Principles and Technologies

As an emerging framework, movable antenna (MA)-enabled wireless powered networks (WPNs) have attracted growing attention. WPNs integrate wireless communication and energy transfer. MA can dynamically adjust the position of antenna units by introducing additional spatial degrees of freedom, so as to make full use of channel gain, optimize the effect of energy beamforming, and further improve the performance of WPNs. In this article, we first classify the implementations of MA by driving architectures, and review the fundamental principles of WPNs. We then highlight the key advantages of MA-enabled WPNs in enhancing wireless power transfer efficiency, realizing flexible and adaptive beamforming, and improving system robustness and interference resilience. Furthermore, four representative application scenarios and three key enabling technologies are discussed. A case study is also presented to show the reduction in transmit power brought by MA for WPNs. Finally, we discuss the challenges and future directions of MA-enabled WPNs, aiming to provide reference for future research and practice.

cs.NI↗

A Unified Analysis of Importance-Corrected Momentum Actor-Critic over a Markovian Trajectory

We present a generic actor-critic method that combines a ridge-regularized pathwise least-squares temporal-difference (LSTD) critic with importance-corrected momentum (ICM) actors. The critic solves a ridge-regularized system per frame by Newton-Schulz inversion and needs no stepsize, no knowledge of the mixing time, and no rank condition. Averaging stochastic policy gradients over frames of $T$ consecutive transitions, the ICM actors incur a frame-dependent gradient bias of order $\frac{1}{T}$. To our knowledge, we establish the first finite-time bounds for ICM actor-critic methods with normalized and unnormalized steps along a single Markovian trajectory. Up to a stationary-to-discounted distribution mismatch, the averaged gradient norm over $K$ updates is bounded by ${\cal O}(K^{-1/3}+\frac{1}{T})$ for normalized steps and by ${\cal O}(K^{-1/4}+\frac{1}{T})$ for unnormalized steps. We specialize these bounds to Muon, normalized stochastic gradient descent (SGD) with momentum, SGD with momentum, and AdaNorm, and compare them in the nuclear norm. With a dimension-free stepsize, Muon confines the factor $\min\{m,n\}^{1/2}$ associated with an $m\times n$ actor parameter matrix to the noise and correction terms. The comparison also characterizes when orthogonalization guarantees a larger noiseless ascent than normalization: exactly when the gradient's nuclear rank exceeds the spectral-to-Frobenius curvature ratio.

cs.LG↗

Joint Beamforming Optimization and Dynamic Tracking in RIS-Enabled Secure ISAC Systems

This paper investigates a reconfigurable intelligent surface (RIS)-enabled secure integrated sensing and communication (ISAC) system, where the direct links between the base station (BS) and users are blocked, and the mobile eavesdropper is treated as the sensing target. The mobility of the eavesdropper induces time-varying wiretap channels, potentially compromising secure transmission when outdated eavesdropper information is used. To address this challenge, the BS dynamically tracks the eavesdropper over consecutive time slots and exploits the predicted state information to adapt its transmission strategy. A sum secrecy rate maximization problem is formulated by jointly optimizing the BS beamforming, artificial noise, and RIS reflection coefficients, subject to a constraint on the tracking error covariance to ensure the required sensing accuracy. To tackle the resulting nonconvex optimization problem with temporal coupling, an iterative algorithm integrating an extended Kalman filter (EKF) with an alternating optimization framework is developed. Specifically, the EKF recursively predicts and updates the eavesdropper's state, while the joint optimization problem is decomposed into four tractable subproblems that are solved iteratively. Simulation results demonstrate that the proposed algorithm achieves improved secrecy performance while effectively tracking the trajectory of the mobile eavesdropper, compared with benchmark schemes.

eess.SP↗

Adaptive Beam Hopping and Power Control for Dual-Layer Over-the-Air Online Federated Learning in LEO Satellite Networks

This paper investigates over-the-air (OTA) computation enabled online federated learning (FL) in low-Earth orbit (LEO) satellite networks. Specifically, we consider a dual-layer OTA aggregation architecture, where ground devices upload analog model updates to serving satellites via uplink OTA aggregation, and satellites forward the aggregated signals to a data processing center through the second round OTA aggregation. Then, we formulate a long-term data-utilization maximization problem in which devices continuously collect new data and untrained samples gradually lose freshness. The problem is subject to the satellite beam budget, transmit-power limit, and global mean squared error (MSE) constraint that governs end-to-end aggregation distortion. This yields a coupled mixed-integer nonlinear programming (MINLP) problem, involving tightly coupled discrete beam-hopping decisions and continuous power control. Due to the combinatorial action space and nonconvex constraints, the problem is NP-hard and computationally intractable. Furthermore, the time-varying satellite topology and dynamic data generation render it a sequential decision-making problem, necessitating adaptive online scheduling. To address these issues, we cast the problem as a Markov decision process and develop a proximal policy optimization (PPO)-based deep reinforcement learning framework that jointly optimizes adaptive beam hopping and power control, using an MSE-aware reward to balance data utilization and aggregation accuracy. Numerical simulation results verify that the proposed algorithm consistently outperforms other benchmark schemes, achieving superior long-term data utilization and faster FL convergence while satisfying the MSE requirement.

cs.IT↗

Beamforming and Trajectory Optimization for Aerial RIS-Aided Secure ISAC via Model Predictive Control

This paper proposes a novel aerial reconfigurable intelligent surface (RIS)-aided secure integrated sensing and communication (ISAC) architecture. An unmanned aerial vehicle (UAV)-mounted RIS establishes virtual line-of-sight links to bypass blockages, serving legitimate users while sensing potential eavesdroppers. To ensure communication security and sensing reliability, we formulate an infinite-horizon dynamic control problem maximizing the long-term average system secrecy rate and minimizing UAV flight energy. This formulation jointly optimizes the UAV trajectory, active beamforming with artificial noise (AN) at the base station, and RIS phase shifts, subject to strict radar signal-to-noise ratio and UAV kinematic constraints. Due to the highly coupled non-convex variables, solving this problem directly is intractable. Therefore, we propose an online joint optimization framework based on model predictive control (MPC). Within each receding horizon, alternating optimization is employed to decouple the problem into three subproblems, efficiently solved via successive convex approximation and difference of convex programming. Extensive simulations demonstrate that our MPC-based algorithm significantly outperforms static baselines in secrecy rate, exhibiting superior online correction capability and robustness against environmental perturbations.

eess.SP↗

Broadband LEO Satellite Constellations for Next-Generation Navigation: Potentials, Enabling Technologies, and Challenges

The rapid deployment of broadband low Earth orbit (LEO) constellations provides new opportunities for next-generation navigation. Compared with conventional global navigation satellite systems (GNSS), broadband LEO systems provide stronger received signals, wider bandwidths, rapidly varying satellite geometry, and larger constellation scales, offering new capabilities for positioning, navigation, and timing (PNT). Meanwhile, their communication-oriented waveforms, high dynamics, and resource-constrained architectures introduce new challenges that are fundamentally different from those in GNSS. This article provides a comprehensive overview of broadband LEO constellations for next-generation navigation, covering their fundamental characteristics, representative use cases, key enabling technologies, and open challenges. We first compare broadband LEO systems with conventional GNSS and summarize the main technical routes for LEO-based PNT. We then discussed the emerging use cases in GNSS-challenged, multipath-dominant, and integrated communication and navigation (ICAN) scenarios. Key enabling technologies including waveform design, high-dynamic signal processing, and constellation resource scheduling are further reviewed. As a representative case study, the navigation-oriented optimization of the Starlink primary synchronization sequence demonstrates that subcarrier power allocation can improve multipath resistance while maintaining ranging accuracy. Finally, several challenges and future directions of broadband LEO-based navigation are discussed, aiming to provide reference for future researches.

eess.SP↗

Tensor-Based Dynamic Channel Estimation for mmWave Movable Antenna MIMO Systems

This paper investigates the dynamic channel estimation algorithm in mmWave movable antenna (MA) multiple-input multiple-output (MIMO) systems. To achieve highly accurate channel estimation, we propose a tensor decomposition-based channel estimation algorithm. First, by leveraging the path response model and utilizing the intrinsic sparsity of mmWave channels, the channel corresponding to MA pairs at the base station and mobile station is transformed into a superposition of channels from sparse paths. Next, the received signal is constructed as a fourth-order tensor to fully capture the high-dimensional structural information of the MA MIMO channel. Then, two tensor decomposition schemes are adopted to extract the factor matrices, and our analysis reveals that the uniqueness of the decomposition can be guaranteed in our model. Subsequently, the propagation loss, frequency offset, angle of arrival/departure, and time delay are obtained based on these factor matrices and the channel matrix can be rebuilt. Additionally, Cramér-Rao bound (CRB) is also derived as a performance evaluation standard, proving that the proposed algorithm achieves a higher estimation accuracy and nearly approaches this minimum bound. Moreover, normalized mean square error (NMSE) is selected as the evaluation metrics for estimation accuracy. Finally, simulation results reveal a notable reduction in the estimation error of the proposed algorithm when compared to the baseline algorithms, confirming its estimation advantage.

eess.SP↗

SparLeak: Privacy Leakage from Sparse Attention in LLM Inference on Shared GPUs

Sparse attention is widely used to accelerate long-context inference in modern large language models (LLMs), but its input-dependent execution behavior introduces previously unexplored privacy risks. We identify a new GPU micro-architectural side channel, termed Sparsity-Induced Memory Access (SIMA), which arises from secret-dependent key-value cache access patterns induced by sparse attention. Based on this observation, we present SparLeak, a phase-aware side-channel attack that extracts SIMA traces during LLM inference and enables two practical privacy extractions: query attribute inference from prefill-phase traces and autoregressive response reconstruction from decoding-phase traces. By reconstructing approximate token-level sparsity profiles from page-level observations and applying profiling-based learning, SparLeak accurately recovers sensitive information, including user-query attributes and private LLM response content. Extensive evaluation across three LLM architectures, three sparse attention mechanisms, and three privacy-sensitive datasets shows that SparLeak achieves average attack success rates of 90.9% for attribute inference and 87.3% for response reconstruction under real-world LLM serving settings, highlighting the significance to account for SIMA leakage when deploying sparse-attention-based LLM systems. We provide anonymized SIMA traces, trained attack models, evaluation scripts, and documentation as artifacts at https://anonymous.4open.science/r/Janus_artifacts/.

cs.LG↗

Enabling Regulatory Multi-Agent Collaboration: Architecture, Challenges, and Solutions

Large language models (LLMs)-empowered autonomous agents are transforming both digital and physical environments by enabling adaptive, multi-agent collaboration. While these agents offer significant opportunities across domains such as finance, healthcare, and smart manufacturing, their unpredictable behaviors and heterogeneous capabilities pose substantial governance and accountability challenges. In this paper, we propose a blockchain-enabled layered architecture for regulatory agent collaboration, comprising an agent layer, an off-chain computation layer, and an on-chain anchoring layer. Within this framework, we design three key modules: (i) an agent behavior tracing and arbitration module for automated accountability, (ii) a dynamic reputation evaluation module for trust assessment in collaborative scenarios, and (iii) a malicious behavior forecasting module for early detection of adversarial activities. Our approach establishes a systematic foundation for trustworthy, resilient, and scalable regulatory mechanisms in large-scale agent ecosystems. Finally, we discuss the future research directions for blockchain-enabled regulatory frameworks in multi-agent systems.

cs.AI↗

NOSA: Native and Offloadable Sparse Attention

Decoding throughput improvements from larger inference batches are limited by GPU memory, which is largely consumed by the key-value (KV) cache. Prior training-free KV cache offloading alleviates this by keeping redundant context on the CPU and fetching only a sparse subset for attention, but it often degrades long-generation quality due to training-inference mismatch on sparse patterns. Meanwhile, trainable sparse attention is incompatible with efficient offloading, as unconstrained KV accesses may force large CPU-to-GPU transfers and erase throughput gains. To this end, we propose NOSA, a trainable sparse attention mechanism natively designed for KV cache offloading. NOSA explicitly constrains the volume of CPU-GPU KV transfers, thereby achieving low communication overhead and high decoding throughput. We further build NOSI, a KV cache offloading inference system that fully unlocks NOSA's efficiency. Empirical results on 1,3,8B LLMs demonstrate that NOSA outperforms KV cache offloading baselines on general, long-input, and long-generation tasks, while boosting decoding throughput by up to 5.04x, 1.92x, and 1.83x over FullAttn, InfLLMv2, and ShadowKV, respectively. We release our code at https://github.com/thunlp/NOSA.

cs.CL↗

RIS-Assisted Secure ISAC: Fundamentals, Applications, and Future Directions

Integrated sensing and communication (ISAC) has emerged as a key enabler for sixth-generation (6G) networks, yet its broadcast nature at the physical layer leaves transmissions vulnerable to malicious eavesdropping, particularly when physical blockages degrade direct links. Reconfigurable intelligent surface (RIS) offers a promising defense paradigm at the physical layer to address these issues, by reconstructing virtual line-of-sight links and dynamically reshaping the spatial propagation environment. In this article, we provide a comprehensive overview of RIS-assisted secure ISAC systems, covering its fundamentals, practical applications, and open future research directions. We first outline cooperative deployment topologies and basic electromagnetic operating principles. We then analyze the technical advantages of passive RIS integration in mitigating bottlenecks in resource competition across communication secrecy, sensing precision, and hardware sustainability. We also present representative applications, including urban vehicular networks, monitoring with unmanned aerial vehicle support, industrial Internet-of-thing, and privacy in smart homes. A case study quantifies gains in secrecy rate and spatial nulling capabilities achieved through joint active and passive beamforming under full blockage of direct links. Finally, we identify key open challenges and future research directions to enable practical, scalable, and intelligent deployment of RIS-assisted secure ISAC systems.

eess.SP↗

A Tutorial on Movable Antenna-Enabled ISAC Systems: Fundamentals, Parameter Estimation, and Security Issues

Movable antenna (MA) technology has recently emerged as a promising paradigm for enhancing the flexibility and performance of wireless systems by allowing antennas to dynamically adjust their spatial positions within a confined region. Meanwhile, integrated sensing and communication (ISAC) has attracted significant attention as a key technology for next-generation wireless networks, aiming to integrate communication and sensing within a shared hardware and spectral framework. By leveraging the additional spatial degrees of freedom offered by MA, MA-enabled ISAC systems provide new opportunities to enhance both communication performance and sensing accuracy. However, the integration of MA into ISAC also poses new challenges in parameter estimation and security. In this tutorial, we provide a comprehensive overview of MA-enabled ISAC systems, with a particular focus on their fundamentals, parameter estimation, and security issues. First, we introduce the basic principles of MA and ISAC, and review representative MA-enabled ISAC systems and their potential applications. Then, we establish unified mathematical models for communication and sensing, and systematically review representative channel and sensing parameter estimation methods tailored to MA-enabled ISAC systems. Numerical comparisons are provided to illustrate the characteristics and performance of different estimation methods. Furthermore, we investigate the security issues of MA-enabled ISAC systems, introduce the fundamentals of physical-layer security (PLS), and summarize how the spatial reconfigurability of MAs can be exploited to enhance the security of ISAC systems. Representative case studies are presented to demonstrate the performance gains of MA-enabled secure ISAC systems. Finally, we identify several open issues and future research directions toward practical MA-enabled ISAC systems.

eess.SP↗

DWBench: Holistic Evaluation of Watermark for Dataset Copyright Auditing

The surging demand for large-scale datasets in deep learning has heightened the need for effective copyright protection, given the risks of unauthorized use to data owners. Although the dataset watermark technique holds promise for auditing and verifying usage, existing methods are hindered by inconsistent evaluations, which impede fair comparisons and assessments of real-world viability. To address this gap, we organize existing methods according to two key dimensions, implementation and verification, to support a consistent analysis and evaluation pipeline across tasks. Based on this framework, we develop DWBench, a unified benchmark and open-source toolkit for systematically evaluating image dataset watermark techniques in classification and generation tasks. Using DWBench, we assess 25 representative methods under standardized conditions, perturbation-based robustness tests, multi-watermark coexistence, and multi-user interference. To enable accurate and reproducible benchmarking, we use TPR@5%FPR for unified sample-level comparison and introduce the verification success rate (VSR) for dataset-level auditing. Key findings reveal that standard single-watermark evaluations tend to overestimate practical auditability. Methods that verify reliably in isolation often suffer from performance degradation at low watermarked-sample ratios, while yielding ambiguous ownership evidence in complex multi-user and multi-watermark settings. We hope that DWBench can facilitate advances in watermark reliability and practicality, thus strengthening copyright safeguards in the face of widespread AI-driven data exploitation.

cs.CR↗

GML-Based Optimization for Movable Antenna Wireless Networks: Challenges and Opportunities

Movable antenna (MA) is proposed as an emerging technology for future wireless networks. By leveraging the additional spatial degrees of freedom, MA can proactively reshape the wireless propagation environment, thereby enhancing network performance.However, fully unlocking the potential of MA networks necessitates the joint optimization of MA antenna positioning and beamforming. For this non-convex and highly coupled problem, existing solutions exhibit significant limitations. Therefore, this paper proposes a gradient-based meta learning (GML) optimization framework. Specifically, we first elaborate on the hardware architecture and channel characteristics of MA, based on which we analyze the primary challenges in optimizing MA wireless networks. Subsequently, we introduce the fundamental logic of the GML framework and compare it with existing methods. Furthermore, we discuss the constraint handling strategies for applying the proposed optimization framework to MA networks. A specific case is studied to show the performance of proposed framework based on numerical simulation. Finally, this paper outlines future research directions for both the GML framework and MA wireless networks.

eess.SP↗