Searcharxiv⌕ Search

arXiv subjects

Ming Xiao

Publications and source records attributed to Ming Xiao.

At least 55 records · Page 3Linked to original sources

Adaptive Coded Federated Learning: Privacy Preservation and Straggler Mitigation

In this article, we address the problem of federated learning in the presence of stragglers. For this problem, a coded federated learning framework has been proposed, where the central server aggregates gradients received from the non-stragglers and gradient computed from a privacy-preservation global coded dataset to mitigate the negative impact of the stragglers. However, when aggregating these gradients, fixed weights are consistently applied across iterations, neglecting the generation process of the global coded dataset and the dynamic nature of the trained model over iterations. This oversight may result in diminished learning performance. To overcome this drawback, we propose a new method named adaptive coded federated learning (ACFL). In ACFL, before the training, each device uploads a coded local dataset with additive noise to the central server to generate a global coded dataset under privacy preservation requirements. During each iteration of the training, the central server aggregates the gradients received from the non-stragglers and the gradient computed from the global coded dataset, where an adaptive policy for varying the aggregation weights is designed. Under this policy, we optimize the performance in terms of privacy and learning, where the learning performance is analyzed through convergence analysis and the privacy performance is characterized via mutual information differential privacy. Finally, we perform simulations to demonstrate the superiority of ACFL compared with the non-adaptive methods.

eess.SP↗

Double-Target Collaborative Spectrum Sharing for 6G Hybrid Satellite-Terrestrial Networks with User-Centric Channel Pools

Satellite and terrestrial cellular networks can be integrated together for extended broadband coverage in e.g., maritime communication scenarios, in the upcoming sixth-generation (6G) era. To counter spectrum scarcity, collaborative spectrum sharing is considered for a hybrid satellite-terrestrial network (HSTN) in this paper. With only slowly-varying large-scale channel state information (CSI), joint power and channel allocation is implemented for terrestrial mobile terminals (MTs) which share the same frequency band with the satellite MTs opportunistically. Specially, strict quality service assurance is adopted for terrestrial MTs under the constraint of leakage interference to satellite MTs. With the target of maximizing both the number of served terrestrial MTs and the average sum transmission rate, a double-target spectrum sharing problem is formulated. To solve the complicated mixed integer programming (MIP) problem efficiently, user-centric channel pools are introduced. Simulations demonstrate that the proposed spectrum sharing scheme could achieve a significant performance gain for the HSTN.

cs.IT↗

Computation-resource-efficient Task-oriented Communications

The rapid development of deep-learning enabled task-oriented communications (TOC) significantly shifts the paradigm of wireless communications. However, the high computation demands, particularly in resource-constrained systems e.g., mobile phones and UAVs, make TOC challenging for many tasks. To address the problem, we propose a novel TOC method with two models: a static and a dynamic model. In the static model, we apply a neural network (NN) as a task-oriented encoder (TOE) when there is no computation budget constraint. The dynamic model is used when device computation resources are limited, and it uses dynamic NNs with multiple exits as the TOE. The dynamic model sorts input data by complexity with thresholds, allowing the efficient allocation of computation resources. Furthermore, we analyze the convergence of the proposed TOC methods and show that the model converges at rate $O\left(\frac{1}{\sqrt{T}}\right)$ with an epoch of length $T$. Experimental results demonstrate that the static model outperforms baseline models in terms of transmitted dimensions, floating-point operations (FLOPs), and accuracy simultaneously. The dynamic model can further improve accuracy and computational demand, providing an improved solution for resource-constrained systems.

eess.IV↗

Cooperative Gradient Coding

This work studies gradient coding (GC) in the context of distributed training problems with unreliable communication. We propose cooperative GC (CoGC), a novel gradient-sharing-based GC framework that leverages cooperative communication among clients. This approach ultimately eliminates the need for dataset replication, making it both communication- and computation-efficient and suitable for federated learning (FL). By employing the standard GC decoding mechanism, CoGC yields strictly binary outcomes: either the global model is exactly recovered, or the decoding fails entirely, with no intermediate results. This characteristic ensures the optimality of the training and demonstrates strong resilience to client-to-server communication failures when the communication channels among clients are in good condition. However, it may also result in communication inefficiency and hinder convergence due to its lack of flexibility, especially when communication channels among clients are in poor condition. To overcome this limitation and further harness the potential of GC matrices, we propose a complementary decoding mechanism, termed GC$^+$, which leverages information that would otherwise be discarded during GC decoding failures. This approach significantly improves system reliability under unreliable communication, as the full recovery of the global model typically dominates in GC$^+$. To conclude, this work establishes solid theoretical frameworks for both CoGC and GC$^+$. We provide complete outage analyses for each decoding mechanism, along with a rigorous investigation of how outages affect the structure and performance of GC matrices. Building on these analyses, we derive convergence bounds for both decoding mechanisms. Finally, the effectiveness of CoGC and GC$^+$ is validated through extensive simulations.

cs.DC↗

A Matrix Variational Auto-Encoder for Variant Effect Prediction in Pharmacogenes

Variant effect predictors (VEPs) aim to assess the functional impact of protein variants, traditionally relying on multiple sequence alignments (MSAs). This approach assumes that naturally occurring variants are fit, an assumption challenged by pharmacogenomics, where some pharmacogenes experience low evolutionary pressure. Deep mutational scanning (DMS) datasets provide an alternative by offering quantitative fitness scores for variants. In this work, we propose a transformer-based matrix variational auto-encoder (matVAE) with a structured prior and evaluate its performance on 33 DMS datasets corresponding to 26 drug target and ADME proteins from the ProteinGym benchmark. Our model trained on MSAs (matVAE-MSA) outperforms the state-of-the-art DeepSequence model in zero-shot prediction on DMS datasets, despite using an order of magnitude fewer parameters and requiring less computation at inference time. We also compare matVAE-MSA to matENC-DMS, a model of similar capacity trained on DMS data, and find that the latter performs better on supervised prediction tasks. Additionally, incorporating AlphaFold-generated structures into our transformer model further improves performance, achieving results comparable to DeepSequence trained on MSAs and finetuned on DMS. These findings highlight the potential of DMS datasets to replace MSAs without significant loss in predictive performance, motivating further development of DMS datasets and exploration of their relationships to enhance variant effect prediction.

cs.LG↗

Vision-Aided ISAC in Low-Altitude Economy Networks via De-Diffused Visual Priors

Emerging low-altitude economy networks (LAENets) require agile and privacy-preserving resource control under dynamic agent mobility and limited infrastructure support. To meet these challenges, we propose a vision-aided integrated sensing and communication (ISAC) framework for UAV-assisted access systems, where onboard masked De-Diffusion models extract compact semantic tokens, including agent type, activity class, and heading orientation, while explicitly suppressing sensitive visual content. These tokens are fused with mmWave radar measurements to construct a semantic risk heatmap reflecting motion density, occlusion, and scene complexity, which guides access technology selection and resource scheduling. We formulate a multi-objective optimization problem to jointly maximize weighted energy and perception efficiency via radio access technology (RAT) assignment, power control, and beamforming, subject to agent-specific QoS constraints. To solve this, we develop De-Diffusion-driven vision-aided risk-aware resource optimization algorithm DeDiff-VARARO, a novel two-stage cross-modal control algorithm: the first stage reconstructs visual scenes from tokens via De-Diffusion model for semantic parsing, while the second stage employs a deep deterministic policy gradient (DDPG)-based policy to adapt RAT selection, power control, and beam assignment based on fused radar-visual states. Simulation results show that DeDiff-VARARO consistently outperforms baselines in reward convergence, link robustness, and semantic fidelity, achieving within $4\%$ of the performance of a raw-image upper bound while preserving user privacy and scalability in dense environments.

eess.SY↗

Semantic Communications in 6G: Coexistence, Multiple Access, and Satellite Networks

The exponential growth of wireless users and bandwidth constraints necessitates innovative communication paradigms for next-generation networks. Semantic Communication (SemCom) emerges as a promising solution by transmitting extracted meaning rather than raw bits, enhancing spectral efficiency and enabling intelligent resource allocation. This paper explores the integration of SemCom with conventional Bit-based Communication (BitCom) in heterogeneous networks, highlighting key challenges and opportunities. We analyze multiple access techniques, including Non-Orthogonal Multiple Access (NOMA), to support coexisting SemCom and BitCom users. Furthermore, we examine multi-modal SemCom frameworks for handling diverse data types and discuss their applications in satellite networks, where semantic techniques mitigate bandwidth limitations and harsh channel conditions. Finally, we identify future directions for deploying semantic-aware systems in 6G and beyond.

eess.SP↗

MIMO Pinching-Antenna-Aided SWIPT

Pinching-antenna systems (PASS) have recently emerged as a promising technology for improving wireless communications by establishing or strengthening reliable line-of-sight (LoS) links by adjusting the positions of pinching antennas (PAs). Motivated by these benefits, we propose a novel PASS-aided multi-input multi-output (MIMO) system for simultaneous wireless information and power transfer (SWIPT), where the PASS are equipped with multiple waveguides to provide information transmission and wireless power transfer (WPT) for several multiple antenna information decoding receivers (IDRs), and energy harvesting receivers (EHRs), respectively. Based on the system, we consider maximizing the sum-rate of all IDRs while guaranteeing the minimum harvested energy of each EHR by jointly optimizing the pinching beamforming and the PA positions. To solve this highly non-convex problem, we iteratively optimize the pinching beamforming based on a weighted minimum mean-squared-error (WMMSE) method and update the PA positions with a Gauss-Seidel-based approach in an alternating optimization (AO) framework. Numerical results verify the significant superiority of the PASS compared with conventional designs.

cs.IT↗

Joint User Association and Beamforming Design for ISAC Networks with Large Language Models

Integrated sensing and communication (ISAC) has been envisioned to play a more important role in future wireless networks. However, the design of ISAC networks is challenging, especially when there are multiple communication and sensing (C\&S) nodes and multiple sensing targets. We investigate a multi-base station (BS) ISAC network in which multiple BSs equipped with multiple antennas simultaneously provide C\&S services for multiple ground communication users (CUs) and targets. To enhance the overall performance of C\&S, we formulate a joint user association (UA) and multi-BS transmit beamforming optimization problem with the objective of maximizing the total sum rate of all CUs while ensuring both the minimum target detection and parameter estimation requirements. To efficiently solve the highly non-convex mixed integer nonlinear programming (MINLP) optimization problem, we propose an alternating optimization (AO)-based algorithm that decomposes the problem into two sub-problems, i.e., UA optimization and multi-BS transmit beamforming optimization. Inspired by large language models (LLMs) for prediction and inference, we propose a unified framework integrating LLMs with convex-based optimization methods. First, we propose a comprehensive design of prompt engineering, including few-shot, chain of thought, and self-reflection techniques to guide LLMs in solving the binary integer programming UA optimization problem. Second, we utilize convex-based optimization methods to handle the non-convex beamforming optimization problem based on fractional programming (FP), majorization minimization (MM), and the alternating direction method of multipliers (ADMM) with an optimized UA from LLMs. Numerical results demonstrate that our proposed LLM-enabled AO-based algorithm achieves fast convergence and near upper-bound performance with the GPT-o1 model, outperforming various benchmark schemes.

cs.IT↗

The Larger the Merrier? Efficient Large AI Model Inference in Wireless Edge Networks

The growing demand for large artificial intelligence model (LAIM) services is driving a paradigm shift from traditional cloud-based inference to edge-based inference for low-latency, privacy-preserving applications. In particular, edge-device co-inference, which partitions LAIMs between edge devices and servers, has emerged as a promising strategy for resource-efficient LAIM execution in wireless networks. In this paper, we investigate a pruning-aware LAIM co-inference scheme, where a pre-trained LAIM is pruned and partitioned into on-device and on-server sub-models for deployment. For analysis, we first prove that the LAIM output distortion is upper bounded by its parameter distortion. Then, we derive a lower bound on parameter distortion via rate-distortion theory, analytically capturing the relationship between pruning ratio and co-inference performance. Next, based on the analytical results, we formulate an LAIM co-inference distortion bound minimization problem by jointly optimizing the pruning ratio, transmit power, and computation frequency under system latency, energy, and available resource constraints. Moreover, we propose an efficient algorithm to tackle the considered highly non-convex problem. Finally, extensive simulations demonstrate the effectiveness of the proposed design. In particular, model parameter distortion is shown to provide a reliable bound on output distortion. Also, the proposed joint pruning ratio and resource management design achieves superior performance in balancing trade-offs among inference performance, system latency, and energy consumption compared with benchmark schemes, such as fully on-device and on-server inference. Moreover, the split point is shown to play a critical role in system performance optimization under heterogeneous and resource-limited edge environments.

cs.LG↗

Pinching-Antenna Systems (PASS) Aided Over-the-air Computation

Over-the-air computation (AirComp) enables fast data aggregation for edge intelligence applications. However the performance of AirComp can be severely degraded by channel misalignments. Pinching antenna systems (PASS) have recently emerged as a promising solution for physically reshaping favorable wireless channels to reduce misalignments and thus AirComp errors, via low-cost, fully passive, and highly reconfigurable antenna deployment. Motivated by these benefits, we propose a novel PASS-aided AirComp system that introduces new design degrees of freedom through flexible pinching antenna (PA) placement. To improve performance, we consider a mean squared error (MSE) minimization problem by jointly optimizing the PA position, transmit power, and decoding vector. To solve this highly non-convex problem, we propose an alternating optimization based framework with Gauss-Seidel based PA position updates. Simulation results show that our proposed joint PA position and communication design significantly outperforms various benchmark schemes in AirComp accuracy.

cs.IT↗

Supermassive Black Holes with High Accretion Rates in Active Galactic Nuclei. XII. Reverberation Mapping Results for 15 PG Quasars from a Long-Duration High-Cadence Campaign

We present the first results from long-term high-cadence spectroscopic monitoring of 15 PG quasars with relatively strong Fe II emission as a part of a broader reverberation mapping campaign performed with the Calar Alto Observatory 2.2m telescope. The $V$-band, 5100 Å continuum, and H$β$ broad emission line light curves were measured for a set of quasars for between dozens to more than a hundred epochs from May 2017 to July 2020. Accurate time lags between the variations of the H$β$ broad line fluxes and the optical continuum strength are obtained for all 15 quasars, ranging from $17.0_{-3.2}^{+2.5}$ to $95.9_{-23.9}^{+7.1}$ days in the rest frame. The virial masses of the central supermassive black holes are derived for all 15 quasars, ranging between $0.50_{-0.19}^{+0.18}$ and $19.17_{-2.73}^{+2.98}$ in units of $10^7 M_\odot$. For 11 of the objects in our sample, this is the first reverberation analysis published. Of the rest, two objects have been the subject of previous reverberation studies, but we determine time lags for these that are only half as long as found in the earlier investigations, which had only been able to sample much more sparsely. The remaining two objects have previously been monitored with high sampling rates. Our results here are consistent with the earlier findings in the sense that the time lag and the line width vary inversely consistent with virialization.

astro-ph.GA↗

Supermassive Black Holes with High Accretion Rates in Active Galactic Nuclei. XIV. Long-Duration High-Cadence Reverberation Mapping Results for 11 PG Quasars

We report the results of a long-duration high-cadence reverberation mapping campaign of a second batch of 11 PG quasars using the 2.2m telescope at the Calar Alto Observatory. This follows a similar earlier study of another sample of 15 objects reported by Hu et al. (2021). Among the 11 PG quasars, 8 objects have the H$β$ time lags measured for the first time, while the other 3 objects were observed in previous campaigns, but only had highly uncertain H$β$-lag measurements. Long-term light curves are presented of photometric $V$-band, spectroscopic 5100 Å continuum, and the H$β$ emission line, lasting for $\sim$3--6 years with a cadence of $\sim$6--14 days. Accurate H$β$ time lags ranging from $\sim$20 to 150 days in the rest frame are obtained. The estimated virial masses of the central supermassive black holes range from $\sim$(3--300)$\times10^7 M_\odot$. Combining these results with those reported in Hu et al. (2021), we now have 26 PG quasars, with representative properties, having reliable H$β$ time-lag measurements from our long-duration high-cadence campaign. A tentative fit to the relation between the H$β$ time lag and the continuum luminosity for these 26 objects gives a slope of 0.53.

astro-ph.GA↗

Channel Estimation for XL-MIMO Systems with Decentralized Baseband Processing: Integrating Local Reconstruction with Global Refinement

In this paper, we investigate the channel estimation problem for extremely large-scale multiple-input multiple-output (XL-MIMO) systems with a hybrid analog-digital architecture, implemented within a decentralized baseband processing (DBP) framework with a star topology. Existing centralized and fully decentralized channel estimation methods face limitations due to excessive computational complexity or degraded performance. To overcome these challenges, we propose a novel two-stage channel estimation scheme that integrates local sparse reconstruction with global fusion and refinement. Specifically, in the first stage, by exploiting the sparsity of channels in the angular-delay domain, the local reconstruction task is formulated as a sparse signal recovery problem. To solve it, we develop a graph neural networks-enhanced sparse Bayesian learning (SBL-GNNs) algorithm, which effectively captures dependencies among channel coefficients, significantly improving estimation accuracy. In the second stage, the local estimates from the local processing units (LPUs) are aligned into a global angular domain for fusion at the central processing unit (CPU). Based on the aggregated observations, the channel refinement is modeled as a Bayesian denoising problem. To efficiently solve it, we devise a variational message passing algorithm that incorporates a Markov chain-based hierarchical sparse prior, effectively leveraging both the sparsity and the correlations of the channels in the global angular-delay domain. Simulation results validate the effectiveness and superiority of the proposed SBL-GNNs algorithm over existing methods, demonstrating improved estimation performance and reduced computational complexity.

cs.IT↗

ACSNet: A Deep Neural Network for Compound GNSS Jamming Signal Classification

In the global navigation satellite system (GNSS), identifying not only single but also compound jamming signals is crucial for ensuring reliable navigation and positioning, particularly in future wireless communication scenarios such as the space-air-ground integrated network (SAGIN). However, conventional techniques often struggle with low recognition accuracy and high computational complexity, especially under low jamming-to-noise ratio (JNR) conditions. To overcome the challenge of accurately identifying compound jamming signals embedded within GNSS signals, we propose ACSNet, a novel convolutional neural network designed specifically for this purpose. Unlike traditional methods that tend to exhibit lower accuracy and higher computational demands, particularly in low JNR environments, ACSNet addresses these issues by integrating asymmetric convolution blocks, which enhance its sensitivity to subtle signal variations. Simulations demonstrate that ACSNet significantly improves accuracy in low JNR regions and shows robust resilience to power ratio (PR) variations, confirming its effectiveness and efficiency for practical GNSS interference management applications.

eess.SP↗

The Borel Ramsey properties for countable Borel equivalence relations

We define some natural notions of strong and weak Borel Ramsey properties for countable Borel equivalence relations and show that they hold for a countable Borel equivalence relation if and only if the equivalence relation is smooth. We also consider some variation of the notion for hyperfinite non-smooth Borel equivalence relations.

math.LO↗

Kähler-Einstein Bergman metrics on pseudoconvex domains of dimension two

We prove that a two dimensional pseudoconvex domain of finite type with a Kähler-Einstein Bergman metric is biholomorphic to the unit ball. This answers an old question of Yau for such domains. The proof relies on asymptotics of derivatives of the Bergman kernel along critically tangent paths approaching the boundary, where the order of tangency equals the type of the boundary point being approached.

math.CV↗

Local algebraicity and localization of the Bergman kernel on Stein spaces with finite type boundaries

On a two dimensional Stein space with isolated, normal singularities, smooth finite type boundary, and locally algebraic Bergman kernel, we establish an estimate on the type of the boundary in terms of the local algebraic degree of the Bergman kernel. As an application, we characterize two dimensional ball quotients as the only Stein spaces with smooth finite type boundary and locally rational Bergman kernel. A key ingredient in the proof of the degree estimate is a new localization result for the Bergman kernel of a pseudoconvex, finite type domain in a complex manifold.

math.CV↗