Searcharxiv⌕ Search

arXiv subjects

Zhouyu Li

Publications and source records attributed to Zhouyu Li.

18 recordsLinked to original sources
arXiv2026

Invisible Manipulation Channels in AI-Assisted Financial Advisory: Implications for Market Integrity and Regulatory Design

AI systems are increasingly deployed for credit assessment and investment advisory in global financial markets, yet the integrity of their inference pipelines remains insufficiently addressed by existing regulatory frameworks. This paper identifies and empirically validates an invisible manipulation channel operating at the sampling layer of LLM inference--a vulnerability that allows adversaries to systematically bias AI-generated financial opinions while preserving full compliance with output-based audit mechanisms, including statistical watermarking. We show that this inference-stage manipulation is statistically hard to detect: the Kullback-Leibler divergence between manipulated and normal output distributions can be made arbitrarily small, so that any output-based detection scheme requires impractically large sample sizes to achieve reliable detection power. Empirical experiments across credit rating and investment advisory scenarios show that directional bias keywords can be amplified by 1.8-1.9x under stealth-preserving (aware) manipulation while triggering zero of six black-box detectors and preserving watermark integrity. The vulnerability generalizes across three mainstream watermarking schemes and three heterogeneous model architectures, establishing it as a systemic financial infrastructure risk. Software-based defenses including cryptographically secure pseudorandom number generators are entirely ineffective, while QRNG combined with TEE hardware isolation achieves 100% attack blocking--reducing the target rate to the natural baseline--by replacing the predictable hash key with quantum-derived entropy that renders all pre-computed manipulation targets invalid. We propose four regulatory amendments centered on mandatory QRNG certification for high-risk financial AI systems under NIST SP 800-90B, inference-layer supply chain audits, and output provenance mechanisms.

cs.CR↗
arXiv2025

OrbitChain: Orchestrating In-orbit Real-time Analytics of Earth Observation Data

Earth observation analytics have the potential to transform many sectors. However, due to limited ground connections, it currently takes hours to days to download and analyze Earth observation data, diminishing the value of data for time-sensitive applications like disaster monitoring or search-and-rescue. To enable real-time analytics, we propose OrbitChain, an in-orbit multi-satellite Earth analytics framework. OrbitChain uses a pipelined design to decompose workflows into analytics functions, and orchestrates constellation-wide resources to finish real-time analytics tasks. It provides timely insights to Earth sensing applications and enables advanced workflows like in-orbit tip-and-cue. Hardware-in-the-loop experiments show that OrbitChain can deliver analytics results in minutes, supports up to 60% more analytics workload than existing frameworks, and reduces inter-satellite communication overhead by up to 45%.

cs.DC↗
arXiv2025

SA2FE: A Secure, Anonymous, Auditable, and Fair Edge Computing Service Offloading Framework

The inclusion of pervasive computing devices in a democratized edge computing ecosystem can significantly expand the capability and coverage of near-end computing for large-scale applications. However, offloading user tasks to heterogeneous and decentralized edge devices comes with the dual risk of both endangered user data security and privacy due to the curious base station or malicious edge servers, and unfair offloading and malicious attacks targeting edge servers from other edge servers and/or users. Existing solutions to edge access control and offloading either rely on "always-on" cloud servers with reduced edge benefits or fail to protect sensitive user service information. To address these challenges, this paper presents SA2FE, a novel framework for edge access control, offloading and accounting. We design a rerandomizable puzzle primitive and a corresponding scheme to protect sensitive service information from eavesdroppers and ensure fair offloading decisions, while a blind token-based scheme safeguards user privacy, prevents double spending, and ensures usage accountability. The security of SA2FE is proved under the Universal Composability framework, and its performance and scalability are demonstrated with implementation on commodity mobile devices and edge servers.

cs.CR↗
arXiv2025

Rank-Based Modeling for Universal Packets Compression in Multi-Modal Communications

The rapid increase in networked systems and data transmission requires advanced data compression solutions to optimize bandwidth utilization and enhance network performance. This study introduces a novel byte-level predictive model using Transformer architecture, capable of handling the redundancy and diversity of data types in network traffic as byte sequences. Unlike traditional methods that require separate compressors for different data types, this unified approach sets new benchmarks and simplifies predictive modeling across various data modalities such as video, audio, images, and text, by processing them at the byte level. This is achieved by predicting subsequent byte probability distributions, encoding them into a sparse rank sequence using lossless entropy coding, and significantly reducing both data size and entropy. Experimental results show that our model achieves compression ratios below 50%, while offering models of various sizes tailored for different communication devices. Additionally, we successfully deploy these models on a range of edge devices and servers, demonstrating their practical applicability and effectiveness in real-world network scenarios. This approach significantly enhances data throughput and reduces bandwidth demands, making it particularly valuable in resource-constrained environments like the Internet of Things sensor networks.

cs.NI↗
arXiv2025

QuESat: Satellite-Assisted Quantum Internet for Global-Scale Entanglement Distribution

Entanglement distribution across remote distances is critical for many quantum applications. Currently, the de facto approach for remote entanglement distribution relies on optical fiber for on-the-ground entanglement distribution. However, the fiber-based approach is incapable of global-scale entanglement distribution due to intrinsic limitations. This paper investigates a new hybrid ground-satellite quantum network architecture (QuESat) for global-scale entanglement distribution, integrating an on-the-ground fiber network with a global-scale passive optical network built with low-Earth-orbit satellites. The satellite network provides dynamic construction of photon lightpaths based on near-vacuum beam guides constructed via adjustable arrays of lenses, forwarding photons from one ground station to another with very high efficiency over long distances compared to using fiber. To assess the feasibility and effectiveness of QuESat for global communication, we formulate lightpath provisioning and entanglement distribution problems, considering the orbital dynamics of satellites and the time-varying entanglement demands from ground users. A two-stage algorithm is developed to dynamically configure the beam guides and distribute entanglements, respectively. The algorithm combines randomized and deterministic rounding for lightpath provisioning to enable global connectivity, with optimal entanglement swapping for distributing entanglements to meet users' demands. By developing a ground-satellite quantum network simulator, QuESat achieves multi-fold improvements compared to repeater networks.

quant-ph↗
arXiv2023

FENDI: Toward High-Fidelity Entanglement Distribution in the Quantum Internet

A quantum network distributes quantum entanglements between remote nodes, and is key to many applications in secure communication, quantum sensing and distributed quantum computing. This paper explores the fundamental trade-off between the throughput and the quality of entanglement distribution in a multi-hop quantum repeater network. Compared to existing work which aims to heuristically maximize the entanglement distribution rate (EDR) and/or entanglement fidelity, our goal is to characterize the maximum achievable worst-case fidelity, while satisfying a bound on the maximum achievable expected EDR between an arbitrary pair of quantum nodes. This characterization will provide fundamental bounds on the achievable performance region of a quantum network, which can assist with the design of quantum network topology, protocols and applications. However, the task is highly non-trivial and is NP-hard as we shall prove. Our main contribution is a fully polynomial-time approximation scheme to approximate the achievable worst-case fidelity subject to a strict expected EDR bound, combining an optimal fidelity-agnostic EDR-maximizing formulation and a worst-case isotropic noise model. The EDR and fidelity guarantees can be implemented by a post-selection-and-storage protocol with quantum memories. By developing a discrete-time quantum network simulator, we conduct simulations to show the characterized performance region (the approximate Pareto frontier) of a network, and demonstrate that the designed protocol can achieve the performance region while existing protocols exhibit a substantial gap.

cs.NI↗
arXiv2023

MetaMorphosis: Task-oriented Privacy Cognizant Feature Generation for Multi-task Learning

With the growth of computer vision applications, deep learning, and edge computing contribute to ensuring practical collaborative intelligence (CI) by distributing the workload among edge devices and the cloud. However, running separate single-task models on edge devices is inefficient regarding the required computational resource and time. In this context, multi-task learning allows leveraging a single deep learning model for performing multiple tasks, such as semantic segmentation and depth estimation on incoming video frames. This single processing pipeline generates common deep features that are shared among multi-task modules. However, in a collaborative intelligence scenario, generating common deep features has two major issues. First, the deep features may inadvertently contain input information exposed to the downstream modules (violating input privacy). Second, the generated universal features expose a piece of collective information than what is intended for a certain task, in which features for one task can be utilized to perform another task (violating task privacy). This paper proposes a novel deep learning-based privacy-cognizant feature generation process called MetaMorphosis that limits inference capability to specific tasks at hand. To achieve this, we propose a channel squeeze-excitation based feature metamorphosis module, Cross-SEC, to achieve distinct attention of all tasks and a de-correlation loss function with differential-privacy to train a deep learning model that produces distinct privacy-aware features as an output for the respective tasks. With extensive experimentation on four datasets consisting of diverse images related to scene understanding and facial attributes, we show that MetaMorphosis outperforms recent adversarial learning and universal feature generation methods by guaranteeing privacy requirements in an efficient way for image and video analytics.

cs.CV↗
arXiv2023

ESDI: Entanglement Scheduling and Distribution in the Quantum Internet

Quantum entanglement distribution between remote nodes is key to many promising quantum applications. Existing mechanisms have mainly focused on improving throughput and fidelity via entanglement routing or single-node scheduling. This paper considers entanglement scheduling and distribution among many source-destination pairs with different requests over an entire quantum network topology. Two practical scenarios are considered. When requests do not have deadlines, we seek to minimize the average completion time of the communication requests. If deadlines are specified, we seek to maximize the number of requests whose deadlines are met. Inspired by optimal scheduling disciplines in conventional single-queue scenarios, we design a general optimization framework for entanglement scheduling and distribution called ESDI, and develop a probabilistic protocol to implement the optimized solutions in a general buffered quantum network. We develop a discrete-time quantum network simulator for evaluation. Results show the superior performance of ESDI compared to existing solutions.

cs.NI↗
arXiv2023

Weak Differentiability to Nonuniform Nonlinear Degenerate Elliptic Systems under $p,q$-growth Condition on the Heisenberg Group

The paper concerns the weak differentiability of weak solutions to two kinds of nonuniform nonlinear degenerate elliptic systems under the $p,q$-growth condition on the Heisenberg Group. We use the iteration to fractional difference quotients on the Heisenberg Group to get the weak differentiability of weak solution $u$ in the vertical direction (i.e., ${L^p}$($1<p<4$) integrability of $Tu$) and then the second order weak differentiability of weak solution in the horizontal directions (i.e., ${L^2}$ integrability of $\nabla_H^2u$) and weak differentiability of gradient of weak solution in the vertical direction (i.e., ${L^2}$ integrability of $T{\nabla_H}u$)).

math.AP↗
arXiv2022

Liouville type theorems for the stationary Hall-MHD equations in local Morrey spaces

This paper is concerned with the Liouville type theorems for the 3D stationary incompressible Hall-MHD equations. We establish that under some sufficient conditions in local Morrey spaces, solutions of the stationary Hall-MHD equations are identically zero. In particular, we also prove Liouville type results for the stationary incompressible MHD equations on $\mathbb{R}^3$. Our theorems extend and generalize the classical results for the stationary incompressible Navier-Stokes equations.

math.AP↗
arXiv2022

Global smooth solutions to the 3D non-resistive MHD equations with low regularity axisymmetric data

The purpose of this paper is to study the incompressible non-resistive MHD equations in $\mathbb{R}^3$. We establish the global well-posedness of classical solutions if the initial data is axially symmetric and the swirl components of the velocity and magnetic vorticity vanish. In particular, the special axially symmetric initial data can be arbitrarily large and satisfy low regularity assumptions.

math.AP↗
arXiv2021

Global regularity for the 3D Hall-MHD equations with low regularity axisymmetric data

In this paper, we consider the global well-posedness of the incompressible Hall-MHD equations in $\mathbb{R}^3$. We prove that the solution of this system is globally regular if the initial data is axisymmetric and the swirl components of the velocity and magnetic vorticity are trivial. It should be pointed out that the initial data without any smallness and in low regularity spaces. This improves a previous result established in \cite{Fan2013}.

math.AP↗
arXiv2021

On Endpoint Regularity Criterion of the 3D Navier-Stokes equations

Let $(u, π)$ with $u=(u_1,u_2,u_3)$ be a suitable weak solution of the three dimensional Navier-Stokes equations in $\mathbb{R}^3\times [0, T]$. Denote by $\dot{\mathcal{B}}^{-1}_{\infty,\infty}$ the closure of $C_0^\infty$ in $\dot{B}^{-1}_{\infty,\infty}$. We prove that if $u\in L^\infty(0, T; \dot{B}^{-1}_{\infty,\infty})$, $u(x, T)\in \dot{\mathcal{B}}^{-1}_{\infty,\infty})$, and $u_3\in L^\infty(0, T; L^{3, \infty})$ or $u_3\in L^\infty(0, T; \dot{B}^{-1+3/p}_{p, q})$ with $3<p, q< \infty$, then $u$ is smooth in $\mathbb{R}^3\times [0, T]$. Our result improves a previous result established by Wang and Zhang [Sci. China Math. 60, 637-650 (2017)].

math.AP↗