arXiv subjects

Yong Xiao

Publications and source records attributed to Yong Xiao.

At least 19 recordsLinked to original sources

arXiv2026

Skillsets on the Chain: A Blockchain-based Zero-Trust Framework for Agentic AI Networking

Agentic AI networking (AgentNet) systems rely heavily on third-party skillset implementations and distributed multi-agent collaboration, yet they face major claim-to-capability inconsistencies and security vulnerabilities under trust-by-declaration assumptions. To bridge this gap, this paper proposes TrustAgentNet, a dual-tier blockchain-secured zero-trust framework. Specifically, a global Chain of Skillsets (CoS) governs the lifecycle of skillset metadata with protocols empowered by specialized agents to enforce off-chain auditing while maintaining lightweight on-chain cryptographic consensus. Furthermore, transient, task-oriented Chains of Collaboration (CoC) are dynamically established to enable trustless distributed multi-agent collaboration. Theoretical analysis of the three-way trade-off among security level, task performance, and resource overhead is provided and empirically validated. Experimental results on a hardware prototype demonstrate that compared with no-blockchain trust-by-default baselines, the zero-trust overhead of TrustAgentNet is dominated by off-chain inference, while the blockchain layer incurs minor ledger costs via the ledger-IPFS storage and on/off-chain integration design. Crucially, the proposed verification pipeline achieves a flawless 100% accuracy across 50 AI models, correctly validating 40 honest skillsets and intercepting 10 adversarial ones, and generalizes to non-AI domains with an 83.91% accuracy and a 0.85 F1-score across 1478 features from 171 ClawHub skills. Adversarial experiments further show that TrustAgentNet enables autonomous skillset self-recovery against various malicious attacks.

cs.CR↗

arXiv2026

Implicit Semantic-Aware Communication Based on Hypergraph Reasoning

Semantic-aware communication has emerged as a transformative paradigm for next-generation communication systems, shifting the fundamental goal from transmitting bit-level symbols to reliably recovering and understanding the semantic meaning of information. Previous studies have demonstrated that representing the semantic content of source messages as graph-based structures can significantly improve communication efficiency and the accuracy of semantic inference at the receiver. However, existing solutions typically employ graphs that capture only pairwise relationships, thereby neglecting higher-order implicit correlations commonly observed in real-world scenarios, such as group interactions, multi-entity associations, and complex relational contexts. This limitation reduces semantic expressiveness and makes semantic inference susceptible to ambiguity and performance degradation, particularly under noisy or corrupted channel conditions. To address these issues, this paper proposes a novel hypergraph-based implicit semantic reasoning framework, HISR, which leverages hypergraphs to represent complex multi-entity relationships among semantic knowledge entities. In HISR, entities and their associated higher-order relations are mapped into dedicated semantic subspaces tailored to distinct relational contexts. This design not only disentangles diverse semantic interactions to mitigate the over-smoothing effects commonly found in traditional graph embedding methods but also enables robust semantic inference even when partial information loss occurs during transmission. Numerical results show that the proposed HISR achieves up to a 36.6% improvement in implicit semantic interpretation accuracy over the state-of-the-art benchmarks.

cs.AI↗

arXiv2026

Gyrokinetic global simulation of Alfvenic ion temperature gradient mode in reversed magnetic shear

In this work, a systematic study of electromagnetic instabilities driven by the temperature gradient in magnetically confined fusion plasmas with reversed magnetic shear is conducted using gyrokinetic particle-in-cell simulations. An electromagnetic instability arising in the low-beta regime is investigated, where beta=8*pi*nT/B^2 denotes the ratio of plasma pressure to magnetic pressure. Within a reversed shear safety factor (q) profile, when a mode rational surface coincides with the position of zero shear, an instability dominated by only one poloidal harmonic emerges, rather than the conventional ion-temperature-gradient (ITG) mode. Simulation results demonstrate that the instability exhibits pronounced electromagnetic polarization even in the low-beta regime, with a real frequency significantly higher than that of ITG modes, and show that it is destabilized by the temperature gradient and not by the density gradient. This instability can be observed even for a monotonic q profile with weak magnetic shear. Based on a systematic comparison with other typical electrostatic and electromagnetic instabilities, this instability is identified as a weak shear Alfvenic-ion-temperature-gradient (WSAITG) mode, which may provide an explanation for the low-frequency Alfven modes (LFAM) observed in experiments. Wave-particle resonance analysis in phase space reveals that, in contrast to the ITG mode, well-passing particles provide an additional resonant population that drives the WSAITG mode.

physics.plasm-ph↗

arXiv2026

Generalization Bounds of Emergent Communications for Agentic AI Networking

The evolution of 6G networking toward agentic AI networking (AgentNet) systems requires a shift from traditional data pipelines to task-aware, agentic AI-native communication solutions. Emergent communication, a novel communication paradigm in which autonomous agents learn their own signaling protocols through interaction, is increasingly viewed as a promising solution to address the challenges posed by existing rigid, predefined protocol-based networking architecture. However, most existing emergent communication frameworks fail to account for physical networking constraints, such as bandwidth and computational complexity, and often lack a rigorous information-theoretical foundation. To address these challenges, this paper introduces a novel emergent communication framework that facilitates collaborative task-solving among heterogeneous agents through an information-theoretic lens. We propose a novel joint loss function that unifies the optimization of decision-making functions and the learning of communication signaling. Our proposed solution is grounded on the multi-agent and multi-task distributed information bottleneck (DIB) theory, which allows the quantification of the fundamental trade-off between task-relevant information representation and computational complexity. We further provide theoretical generalization bounds of the emergent communication protocol during decentralized inference across unseen environmental states. Experimental validation on a real-world hardware prototype confirms that our proposed framework significantly improves generalization performance, compared to the state-of-the-art solutions.

cs.AI↗

arXiv2026

SANEmerg: An Emergent Communication Framework for Semantic-aware Agentic AI Networking

Future networking systems are envisioned to become part of an agentic AI-native ecosystem in which a vast number of heterogeneous and specialized AI agents cooperate seamlessly to fulfill complex user requirements in real time. However, traditional networking paradigms are characterized by a rigid decoupling of communication and computation, which often leads to significant inefficiencies in large-scale agentic AI networking (AgentNet) systems. Emergent communication offers a novel solution by enabling autonomous agents that support task-specific signaling protocols for information exchange and collaborative coordination. In this paper, we consider a multi-agent emergent communication framework, tailored for semantic-aware AgentNet systems in which the user's semantic intent can be automatically detected, inferred, and linked to a set of sub-tasks to be assigned to a set of agents. We investigate how communication and signaling protocols can emerge among collaborative agents with computationally bounded intelligence under stringent bandwidth constraints. Our proposed framework, called SANEmerg, is designed to facilitate the emergence of communication for collaborative task fulfillment while adhering to the physical limits of AgentNet. SANEmerg incorporates a bandwidth-adaptable importance-filter that dynamically prioritizes the transmission of higher-contribution message dimensions, ensuring robust performance in bandwidth-limited environments. Furthermore, SANEmerg integrates a complexity-regularizer grounded in the Minimum Description Length (MDL) principle to facilitate the emergence of computationally bounded signaling. Evaluated via an AgentNet prototype and extensive experimentation, SANEmerg demonstrates significant performance improvements over state-of-the-art solutions, achieving superior task accuracy while significantly reducing bandwidth and computational overhead.

cs.AI↗

arXiv2026

On the Rate-Distortion-Complexity Tradeoff for Semantic Communication

Semantic communication is a novel communication paradigm that focuses on conveying the user's intended meaning rather than the bit-wise transmission of source signals. One of the key challenges is to effectively represent and extract the semantic meaning of any given source signals. While deep learning (DL)-based solutions have shown promising results in extracting implicit semantic information from a wide range of sources, existing work often overlooks the high computational complexity inherent in both model training and inference for the DL-based encoder and decoder. To bridge this gap, this paper proposes a rate-distortion-complexity (RDC) framework which extends the classical rate-distortion theory by incorporating the constraints on semantic distance, including both the traditional bit-wise distortion metric and statistical difference-based divergence metric, and complexity measure, adopted from the theory of minimum description length and information bottleneck. We derive the closed-form theoretical results of the minimum achievable rate under given constraints on semantic distance and complexity for both Gaussian and binary semantic sources. Our theoretical results show a fundamental three-way tradeoff among achievable rate, semantic distance, and model complexity. Extensive experiments on real-world image and video datasets validate this tradeoff and further demonstrate that our information-theoretic complexity measure effectively correlates with practical computational costs, guiding efficient system design in resource-constrained scenarios.

cs.IT↗

arXiv2026

HoGS: Homophily-Oriented Graph Synthesis for Local Differentially Private GNN Training

Graph neural networks (GNNs) have demonstrated remarkable performance in various graph-based machine learning tasks by effectively modeling high-order interactions between nodes. However, training GNNs without protection may leak sensitive personal information in graph data, including links and node features. Local differential privacy (LDP) is an advanced technique for protecting data privacy in decentralized networks. Unfortunately, existing local differentially private GNNs either only preserve link privacy or suffer significant utility loss in the process of preserving link and node feature privacy. In this paper, we propose an effective LDP framework, called HoGS, which trains GNNs with link and feature protection by generating a synthetic graph. Concretely, HoGS first collects the link and feature information of the graph under LDP, and then utilizes the phenomenon of homophily in graph data to reconstruct the graph structure and node features separately, thereby effectively mitigating the negative impact of LDP on the downstream GNN training. We theoretically analyze the privacy guarantee of HoGS and conduct experiments using the generated synthetic graph as input to various state-of-the-art GNN architectures. Experimental results on three real-world datasets show that HoGS significantly outperforms baseline methods in the accuracy of training GNNs.

cs.LG↗

arXiv2026

Extremalization approach to black hole thermodynamics: perturbations around higher-derivative gravities

When higher-derivative terms are added to a gravitational action, black hole solutions and their thermodynamic properties are generally corrected. Recent progress has shown that, by treating higher-derivative operators as perturbations, the first-order corrections to black hole thermodynamics can be obtained without explicit knowledge of the corresponding perturbed black hole solutions. This result can be understood as a consequence of an extremalization principle underlying the Euclidean action formulation of black hole thermodynamics. In this paper, we emphasize that this extremalization approach is not restricted to perturbations around Einstein gravity. Instead, it can be applied to perturbations of more general higher-derivative gravity theories whose black hole solutions are already known and can be taken as the zeroth-order background. As an explicit illustration, we consider Einstein--Gauss--Bonnet gravity as the zeroth-order theory and study the first-order thermodynamic corrections induced by further higher-order curvature operators. We show that these corrections can be derived without solving the perturbed black hole solutions, both in asymptotically flat and asymptotically AdS spacetimes.

gr-qc↗

arXiv2025

Distributed Information Bottleneck Theory for Multi-Modal Task-Aware Semantic Communication

Semantic communication shifts the focus from bit-level accuracy to task-relevant semantic delivery, enabling efficient and intelligent communication for next-generation networks. However, existing multi-modal solutions often process all available data modalities indiscriminately, ignoring that their contributions to downstream tasks are often unequal. This not only leads to severe resource inefficiency but also degrades task inference performance due to irrelevant or redundant information. To tackle this issue, we propose a novel task-aware distributed information bottleneck (TADIB) framework, which quantifies the contribution of any set of modalities to given tasks. Based on this theoretical framework, we design a practical coding scheme that intelligently selects and compresses only the most task-relevant modalities at the transmitter. To find the optimal selection and the codecs in the network, we adopt the probabilistic relaxation of discrete selection, enabling distributed encoders to make coordinated decisions with score function estimation and common randomness. Extensive experiments on public datasets demonstrate that our solution matches or surpasses the inference quality of full-modal baselines while significantly reducing communication and computational costs.

cs.IT↗

arXiv2025

SANet: A Semantic-aware Agentic AI Networking Framework for Cross-layer Optimization in 6G

Agentic AI networking (AgentNet) is a novel AI-native networking paradigm in which a large number of specialized AI agents collaborate to perform autonomous decision-making, dynamic environmental adaptation, and complex missions. It has the potential to facilitate real-time network management and optimization functions, including self-configuration, self-optimization, and self-adaptation across diverse and complex environments. This paper proposes SANet, a novel semantic-aware AgentNet architecture for wireless networks that can infer the semantic goal of the user and automatically assign agents associated with different layers of the network to fulfill the inferred goal. Motivated by the fact that AgentNet is a decentralized framework in which collaborating agents may generally have different and even conflicting objectives, we formulate the decentralized optimization of SANet as a multi-agent multi-objective problem, and focus on finding the Pareto-optimal solution for agents with distinct and potentially conflicting objectives. We propose three novel metrics for evaluating SANet. Furthermore, we develop a model partition and sharing (MoPS) framework in which large models, e.g., deep learning models, of different agents can be partitioned into shared and agent-specific parts that are jointly constructed and deployed according to agents' local computational resources. Two decentralized optimization algorithms are proposed. We derive theoretical bounds and prove that there exists a three-way tradeoff among optimization, generalization, and conflicting errors. We develop an open-source RAN and core network-based hardware prototype that implements agents to interact with three different layers of the network. Experimental results show that the proposed framework achieved performance gains of up to 14.61% while requiring only 44.37% of FLOPs required by state-of-the-art algorithms.

cs.AI↗

arXiv2025

Explicit and covariant formula for thermodynamic volume in extended black hole thermodynamics

In extended black hole thermodynamics, the cosmological constant and other couplings are treated as thermodynamic variables, yielding the first law $\tilde{\delta}M = T\tilde{\delta}S+\Omega\tilde{\delta}J +\mathcal{V} \tilde{\delta}P+\cdots$, where $P\equiv -\frac{\Lambda}{8\pi}$. A long-standing conceptual gap in this framework is that, unlike $M$, $T$, $S$, $\Omega$, and $J$, the thermodynamic volume $\mathcal{V} $ lacks a first-principles definition and can only be deduced from other thermodynamic quantities. This deficiency indicates that the underlying origin of $\mathcal{V} $ remains poorly understood. In this paper, we resolve this issue and provide an explicit, covariant formula for $\mathcal{V} $. We demonstrate that $\mathcal{V} $ (and the conjugate quantities of other couplings) universally decomposes into two contributions: one arising from the explicit coupling dependence of the Lagrangian, and the other from the response of the fundamental dynamical fields. This clarifies the physical meaning of the thermodynamic volume and places it on the same footing as other intrinsic thermodynamic quantities.

gr-qc↗

arXiv2025

Implicit Semantic Communication Based on Bayesian Reconstruction Framework

Semantic communication is a novel communication paradigm that focuses on the transportation and delivery of the \emph{meaning} of messages. Recent results have verified that a graphical structure provides the most expressive and structurally faithful formalism for representing the relational semantics in most information sources. However, most existing works represent the semantics based on pairwise relation-based graphs, which cannot capture the higher-order interactions that are essential for some semantic sources. This paper proposes a novel Bayesian hypergraph inference-based semantic communication framework that can directly recover implicit semantic information involving high-order hyperedges at the receiver based on the pairwise relation-based explicit semantics sent by the transmitter. Experimental results based on real-world datasets demonstrated that the proposed SBRF achieves up to 90\% recovery accuracy of the high-order hyperedges based on the pairwise relation-based explicit semantics.

cs.IT↗

arXiv2025

Variable-Length Joint Source-Channel Coding for Semantic Communication

This paper investigates a key challenge faced by joint source-channel coding (JSCC) in digital semantic communication (SemCom): the incompatibility between existing JSCC schemes that yield continuous encoded representations and digital systems that employ discrete variable-length codewords. It further results in feasibility issues in achieving physical bit-level rate control via such JSCC approaches for efficient semantic transmission. In this paper, we propose a novel end-to-end coding (E2EC) framework to tackle it. The semantic coding problem is formed by extending the information bottleneck (IB) theory over noisy channels, which is a tradeoff between bit-level communication rate and semantic distortion. With a structural decomposition of encoding to handle code length and content respectively, we can construct an end-to-end trainable encoder that supports the direct compression of a data source into a finite codebook. To optimize our E2EC across non-differentiable operations, e.g., sampling, we use the powerful policy gradient to support gradient-based updates. Experimental results illustrate that E2EC achieves high inference quality with low bit rates, outperforming representative baselines compatible with digital SemCom systems.

cs.IT↗

arXiv2025

Validity of the Background Subtraction Method for Black Hole Thermodynamics in Matter-Coupled Gravity Theories

The background subtraction method has long served as a practical tool for computing the Euclidean action and thermodynamic quantities of black holes. While its equivalence to the Iyer--Wald formalism is well understood in pure gravity theories, its validity in matter-coupled theories remains less clear and has even been questioned in the literature. In this work, we revisit this issue and demonstrate that the equivalence between the Euclidean action method and the Iyer--Wald formalism persists in matter-coupled scenarios. We apply the resulting formulation to two representative examples of such theories, and in both cases, the Euclidean approach performs smoothly. We further identify situations where the method may encounter subtleties due to the special properties of certain matter fields. Our results clarify when background subtraction remains reliable beyond pure gravity and when additional care is necessary.

gr-qc↗

arXiv2025

Plasma Shape Control via Zero-shot Generative Reinforcement Learning

Traditional PID controllers have limited adaptability for plasma shape control, and task-specific reinforcement learning (RL) methods suffer from limited generalization and the need for repetitive retraining. To overcome these challenges, this paper proposes a novel framework for developing a versatile, zero-shot control policy from a large-scale offline dataset of historical PID-controlled discharges. Our approach synergistically combines Generative Adversarial Imitation Learning (GAIL) with Hilbert space representation learning to achieve dual objectives: mimicking the stable operational style of the PID data and constructing a geometrically structured latent space for efficient, goal-directed control. The resulting foundation policy can be deployed for diverse trajectory tracking tasks in a zero-shot manner without any task-specific fine-tuning. Evaluations on the HL-3 tokamak simulator demonstrate that the policy excels at precisely and stably tracking reference trajectories for key shape parameters across a range of plasma scenarios. This work presents a viable pathway toward developing highly flexible and data-efficient intelligent control systems for future fusion reactors.

physics.plasm-ph↗

arXiv2025

A universal relation among Euclidean integrals for black holes in higher-derivative gravity theories

In this paper, we establish a universal equality governing Euclidean integrals of gravitational actions in higher-derivative theories. This relation is shown to hold universally for asymptotically flat black holes in pure gravity, and is generalized to asymptotically anti-de Sitter (AdS) spacetimes through appropriate regularization. We further examine its validity in systems with matter-gravity coupling, identifying that violations occur only when matter fields exhibit pathological behaviors: divergence at the horizon or non-decaying profiles at infinity. These findings reveal fundamental constraints on gravitational thermodynamics and provide diagnostic tools for identifying ill-behaved matter configurations.

gr-qc↗

arXiv2025

The future of gravitational wave science unlocking LIGO potential: AI-driven data analysis and exploration

The advent of gravitational wave astronomy (GW) has revolutionized the observation of cataclysmic cosmic events, such as black hole mergers and neutron star collisions. The Laser Interferometer Gravitational-Wave Observatory (LIGO) has been at the forefront of these discoveries. However, the immense volume and complexity of gravitational wave data present significant challenges for traditional analysis methods. This paper investigates the growing synergy between artificial intelligence (AI) and GW science, emphasizing how AI enhances signal detection, noise reduction, and data interpretation. It begins with an overview of GW fundamentals and the role of machine learning in increasing detector sensitivity. Notable GW events observed by LIGO are discussed alongside persistent analytical challenges such as data quality, generalization, and computational constraints. A comprehensive performance review of AI techniques, including supervised learning, unsupervised learning, deep learning, and reinforcement learning, is presented based on data spanning 2021 to 2024. Evaluation metrics include accuracy, precision, true positive rate (TPR), false positive rate (FPR), and computational efficiency. Findings indicate that deep learning and supervised learning outperform other approaches, particularly in enhancing TPR and minimizing FPR. While unsupervised and reinforcement learning models offer less precision, they demonstrate high efficiency and potential for real-time applications. The study also explores AI integration into next-generation detectors and waveform reconstruction techniques. Overall, the integration of AI into GW research significantly improves the reliability and speed of event detection, unlocking new possibilities for exploring the dynamic universe. This paper provides a comprehensive outlook on the transformative role of AI in shaping the future of GW astronomy.

astro-ph.GA↗

arXiv2025

Robust Federated Learning against Model Perturbation in Edge Networks

Federated Learning (FL) is a promising paradigm for realizing edge intelligence, allowing collaborative learning among distributed edge devices by sharing models instead of raw data. However, the shared models are often assumed to be ideal, which would be inevitably violated in practice due to various perturbations, leading to significant performance degradation. To overcome this challenge, we propose a novel method, termed Sharpness-Aware Minimization-based Robust Federated Learning (SMRFL), which aims to improve model robustness against perturbations by exploring the geometrical property of the model landscape. Specifically, SMRFL solves a min-max optimization problem that promotes model convergence towards a flat minimum by minimizing the maximum loss within a neighborhood of the model parameters. In this way, model sensitivity to perturbations is reduced, and robustness is enhanced since models in the neighborhood of the flat minimum also enjoy low loss values. The theoretical result proves that SMRFL can converge at the same rate as FL without perturbations. Extensive experimental results show that SMRFL significantly enhances robustness against perturbations compared to three baseline methods on two real-world datasets under three perturbation scenarios.

cs.LG↗