Search arXiv⌕ Search

arXiv subjects

Ping Zhang

Publications and source records attributed to Ping Zhang.

At least 163 records · Page 9Linked to original sources

SPD-CFL: Stepwise Parameter Dropout for Efficient Continual Federated Learning

Federated Learning (FL) is a collaborative machine learning paradigm for training models on local sensitive data with privacy protection. Pre-trained transformer-based models have emerged as useful foundation models (FMs) to be fine-tuned for a wide range of downstream tasks. However, large-scale pre-trained models make it challenging for traditional FL due to high communication overhead in the resource-constrained IoT. This has inspired the field of parameter-efficient fine-tuning (PEFT) research. Existing PEFT methods attempt to optimize model performance at the given dropout level. Such an approach places the burden on human users to find a dropout rate that provides a satisfactory level of performance through trial-and-error, which is time consuming and resource intensive. To address this limitation, we propose the Step-wise Parameter Dropout for Continual Federated Learning (SPD-CFL) approach. Instead of pre-defining a desired dropout rate, it allows users to specify the target level of performance and then attempts to find the most suitable dropout rate for the given FL model. Specifically, on the server side, SPD-CFL drops trainable parameters in a stepwise manner to improve communication efficiency by reducing the rank of low-rank adaptation (LoRA). The sensitivity-based gradient consistency (SGC) measure is designed to facilitate the adaptive adjustment of parameter dropout. In addition, SPD-CFL introduces continual learning (CL) on the client side to mitigate performance degradation due to the inconsistent optima with distinct parameter dropout rates under heterogeneous FL. Extensive experiments on the public benchmark dataset CIFAR-10 and a real-world medical Face dataset demonstrate significant superiority of SPD-CFL over state-of-the-art methods. Compared to the best-performing baseline, it achieves a 2.07% higher test AUC while reducing communication overhead by 29.53%.

cs.LG↗

Nonmagnetic ground state of marcasite FeTe$_{2}$: The competition between crystal field splitting and on-site Coulomb repulsion

The magnetic ground states in crystalline systems are significant for both fundamental condensed matter physics and practical materials engineering. Marcasite FeTe$_{2}$, characterized as a small-gap semiconductor, exhibits anomalous magnetic behaviors in low-temperature experiments. In this study, first-principles density functional theory calculations combined with scanning tunneling microscopy/spectroscopy are employed to investigate the magnetic ground state of marcasite FeTe$_{2}$. It is revealed that the competition between crystal field splitting and on-site Coulomb repulsion plays the key role in the formation of localized magnetic moments in FeTe$_{2}$. The ground state of FeTe$_{2}$ bulk is confirmed to be nonmagnetic, while the magnetic responses of FeTe$_{2}$ observed at low temperature are suggested to be related to the magnetic Fe atoms on the crystal surfaces. Our work proposes a straightforward competing mechanism for determining ground-state magnetism of various localized-moment crystalline systems.

cond-mat.str-el↗

A Novel Indicator for Quantifying and Minimizing Information Utility Loss of Robot Teams

The timely exchange of information among robots within a team is vital, but it can be constrained by limited wireless capacity. The inability to deliver information promptly can result in estimation errors that impact collaborative efforts among robots. In this paper, we propose a new metric termed Loss of Information Utility (LoIU) to quantify the freshness and utility of information critical for cooperation. The metric enables robots to prioritize information transmissions within bandwidth constraints. We also propose the estimation of LoIU using belief distributions and accordingly optimize both transmission schedule and resource allocation strategy for device-to-device transmissions to minimize the time-average LoIU within a robot team. A semi-decentralized Multi-Agent Deep Deterministic Policy Gradient framework is developed, where each robot functions as an actor responsible for scheduling transmissions among its collaborators while a central critic periodically evaluates and refines the actors in response to mobility and interference. Simulations validate the effectiveness of our approach, demonstrating an enhancement of information freshness and utility by 98%, compared to alternative methods.

cs.DC↗

Convergence-Privacy-Fairness Trade-Off in Personalized Federated Learning

Personalized federated learning (PFL), e.g., the renowned Ditto, strikes a balance between personalization and generalization by conducting federated learning (FL) to guide personalized learning (PL). While FL is unaffected by personalized model training, in Ditto, PL depends on the outcome of the FL. However, the clients' concern about their privacy and consequent perturbation of their local models can affect the convergence and (performance) fairness of PL. This paper presents PFL, called DP-Ditto, which is a non-trivial extension of Ditto under the protection of differential privacy (DP), and analyzes the trade-off among its privacy guarantee, model convergence, and performance distribution fairness. We also analyze the convergence upper bound of the personalized models under DP-Ditto and derive the optimal number of global aggregations given a privacy budget. Further, we analyze the performance fairness of the personalized models, and reveal the feasibility of optimizing DP-Ditto jointly for convergence and fairness. Experiments validate our analysis and demonstrate that DP-Ditto can surpass the DP-perturbed versions of the state-of-the-art PFL models, such as FedAMP, pFedMe, APPLE, and FedALA, by over 32.71% in fairness and 9.66% in accuracy.

cs.LG↗

SatHealth: A Multimodal Public Health Dataset with Satellite-based Environmental Factors

Living environments play a vital role in the prevalence and progression of diseases, and understanding their impact on patient's health status becomes increasingly crucial for developing AI models. However, due to the lack of long-term and fine-grained spatial and temporal data in public and population health studies, most existing studies fail to incorporate environmental data, limiting the models' performance and real-world application. To address this shortage, we developed SatHealth, a novel dataset combining multimodal spatiotemporal data, including environmental data, satellite images, all-disease prevalences estimated from medical claims, and social determinants of health (SDoH) indicators. We conducted experiments under two use cases with SatHealth: regional public health modeling and personal disease risk prediction. Experimental results show that living environmental information can significantly improve AI models' performance and temporal-spatial generalizability on various tasks. Finally, we deploy a web-based application to provide an exploration tool for SatHealth and one-click access to both our data and regional environmental embedding to facilitate plug-and-play utilization. SatHealth is now published with data in Ohio, and we will keep updating SatHealth to cover the other parts of the US. With the web application and published code pipeline, our work provides valuable angles and resources to include environmental data in healthcare research and establishes a foundational framework for future research in environmental health informatics.

cs.LG↗

Toward Low-Altitude Airspace Management and UAV Operations: Requirements, Architecture and Enabling Technologies

The low-altitude economy (LAE) is rapidly advancing toward intelligence, connectivity, and coordination, bringing new challenges in dynamic airspace management, unmanned aerial vehicle (UAV) operation, and security management. Existing systems remain fragmented and lack effective coordination. To bridge these gaps, we propose UTICN (Ubiquitous and Trusted Intelligent Cellular-native Network) for LAE, a unified cellular-native architecture that integrates multi-domain sensing, high-precision positioning, intelligent aircraft-to-everything communication, dynamic airspace management, and UAV operational services. UTICN introduces key technologies such as integrated sensing and communication (ISAC), passive and active positioning, intelligent machine communication, swarm coordination, and control-data decoupled management frameworks. We demonstrate UTICN's feasibility through two use cases, i.e., a city-level LAE management platform and a multi-frequency collaborative ISAC system. This work provides a fundamental reference for building a unified operational foundation and airspace management architecture for the LAE.

eess.SY↗

On the refined analyticity radius of 3-D generalized Navier-Stokes equations

We analyze the instantaneous growth of analyticity radius for three dimensional generalized Navier-Stokes equations. For the subcritical $H^γ(\mathbb R^3)$ case with $γ>\frac12,$ we prove that there exists a positive time $t_0$ so that for any $t\in]0, t_0]$, the radius of analyticity of the solution $u$ satisfies the pointwise-in-time lower bound $${\mathrm{rad}}(u)(t)\ge \sqrt{(2γ-1)t\bigl(|\ln t|+\ln|\ln t|+K_t\bigr)},$$ where $K_t \to \infty$ as $t\to 0^+$. This in particular gives a nontrivial improvement of the previous result by Herbst and Skibsted in \cite{HS} for the case $γ\in ]1/2,3/2[$ and also settles the decade-long open question in \cite{HS}, namely, whether or not $\liminf_{t\to 0^+}\frac {\mathrm{ rad}(u)(t)}{\sqrt{t|\ln t|}}\ge \sqrt{2γ-1}$ for all $γ\ge \frac32$. For the critical case $H^{\frac 12}(\mathbb R^3)$, we prove that there exists $t_1>0$ so that for any $t\in ]0, t_1],$ ${\mathrm {rad}}(u)(t)\ge λ(t)\sqrt{t}$ with $λ(t)$ satisfying $\lim_{t\to 0^+}λ(t)=\infty.$

math.AP↗

High-Speed Ultra-Energy-Efficient Memristor-Based Massive MIMO SIC Detector Circuit with Hybrid Analog-Digital Computing Architecture

The emerging memristor crossbar array based computing circuits exhibit computing speeds and energy efficiency far surpassing those of traditional digital processors. This type of circuits can complete high-dimensional matrix operations in an extremely short time through analog computing, making it naturally applicable to linear detection and maximum likelihood detection in massive multiple-input multiple-output (MIMO) systems. However, the challenge of employing memristor crossbar arrays to efficiently implement other nonlinear detection algorithms, such as the successive interference cancellation (SIC) algorithm, remains unresolved. In this paper we propose a memristor-based circuit design for massive MIMO SIC detector. The proposed circuit comprises several judiciously designed analog matrix computing modules and hybrid analog-digital slicers, which enables the proposed circuit to perform the SIC algorithm with a hybrid analog-digital computing architecture. We show that the computing speed and the computational energy-efficiency of the proposed detector circuit are 43 times faster and 110 times higher, respectively, than those of a traditional 8-core digital signal processor (DSP), and also advantageous over the benchmark high-performance field programmable gate array (FPGA) and graphics processing unit (GPU).

eess.SP↗

Channel-adaptive Cross-modal Generative Semantic Communication for Point Cloud Transmission

With the rapid development of autonomous driving and extended reality, efficient transmission of point clouds (PCs) has become increasingly important. In this context, we propose a novel channel-adaptive cross-modal generative semantic communication (SemCom) for PC transmission, called GenSeC-PC. GenSeC-PC employs a semantic encoder that fuses images and point clouds, where images serve as non-transmitted side information. Meanwhile, the decoder is built upon the backbone of PointDif. Such a cross-modal design not only ensures high compression efficiency but also delivers superior reconstruction performance compared to PointDif. Moreover, to ensure robust transmission and reduce system complexity, we design a streamlined and asymmetric channel-adaptive joint semantic-channel coding architecture, where only the encoder needs the feedback of average signal-to-noise ratio (SNR) and available bandwidth. In addition, rectified denoising diffusion implicit models is employed to accelerate the decoding process to the millisecond level, enabling real-time PC communication. Unlike existing methods, GenSeC-PC leverages generative priors to ensure reliable reconstruction even from noisy or incomplete source PCs. More importantly, it supports fully analog transmission, improving compression efficiency by eliminating the need for error-free side information transmission common in prior SemCom approaches. Simulation results confirm the effectiveness of cross-modal semantic extraction and dual-metric guided fine-tuning, highlighting the framework's robustness across diverse conditions, including low SNR, bandwidth limitations, varying numbers of 2D images, and previously unseen objects.

cs.CV↗

Enhancing Convergence, Privacy and Fairness for Wireless Personalized Federated Learning: Quantization-Assisted Min-Max Fair Scheduling

Personalized federated learning (PFL) offers a solution to balancing personalization and generalization by conducting federated learning (FL) to guide personalized learning (PL). Little attention has been given to wireless PFL (WPFL), where privacy concerns arise. Performance fairness of PL models is another challenge resulting from communication bottlenecks in WPFL. This paper exploits quantization errors to enhance the privacy of WPFL and proposes a novel quantization-assisted Gaussian differential privacy (DP) mechanism. We analyze the convergence upper bounds of individual PL models by considering the impact of the mechanism (i.e., quantization errors and Gaussian DP noises) and imperfect communication channels on the FL of WPFL. By minimizing the maximum of the bounds, we design an optimal transmission scheduling strategy that yields min-max fairness for WPFL with OFDMA interfaces. This is achieved by revealing the nested structure of this problem to decouple it into subproblems solved sequentially for the client selection, channel allocation, and power control, and for the learning rates and PL-FL weighting coefficients. Experiments validate our analysis and demonstrate that our approach substantially outperforms alternative scheduling strategies by 87.08%, 16.21%, and 38.37% in accuracy, the maximum test loss of participating clients, and fairness (Jain's index), respectively.

cs.DC↗

A stableness of resistance model for nonresponse adjustment with callback data

Nonresponse arises frequently in surveys and follow-ups are routinely made to increase the response rate. In order to monitor the follow-up process, callback data have been used in social sciences and survey studies for decades. In modern surveys, the availability of callback data is increasing because the response rate is decreasing and follow-ups are essential to collect maximum information. Although callback data are helpful to reduce the bias in surveys, such data have not been widely used in statistical analysis until recently. We propose a stableness of resistance assumption for nonresponse adjustment with callback data. We establish the identification and the semiparametric efficiency theory under this assumption, and propose a suite of semiparametric estimation methods including doubly robust estimators, which generalize existing parametric approaches for callback data analysis. We apply the approach to a Consumer Expenditure Survey dataset. The results suggest an association between nonresponse and high housing expenditures.

stat.ME↗

Synonymous Variational Inference for Perceptual Image Compression

Recent contributions of semantic information theory reveal the set-element relationship between semantic and syntactic information, represented as synonymous relationships. In this paper, we propose a synonymous variational inference (SVI) method based on this synonymity viewpoint to re-analyze the perceptual image compression problem. It takes perceptual similarity as a typical synonymous criterion to build an ideal synonymous set (Synset), and approximate the posterior of its latent synonymous representation with a parametric density by minimizing a partial semantic KL divergence. This analysis theoretically proves that the optimization direction of perception image compression follows a triple tradeoff that can cover the existing rate-distortion-perception schemes. Additionally, we introduce synonymous image compression (SIC), a new image compression scheme that corresponds to the analytical process of SVI, and implement a progressive SIC codec to fully leverage the model's capabilities. Experimental results demonstrate comparable rate-distortion-perception performance using a single progressive SIC codec, thus verifying the effectiveness of our proposed analysis method.

cs.IT↗

ICDM: Interference Cancellation Diffusion Models for Wireless Semantic Communications

Diffusion models (DMs) have recently achieved significant success in wireless communications systems due to their denoising capabilities. The broadcast nature of wireless signals makes them susceptible not only to Gaussian noise, but also to unaware interference. This raises the question of whether DMs can effectively mitigate interference in wireless semantic communication systems. In this paper, we model the interference cancellation problem as a maximum a posteriori (MAP) problem over the joint posterior probability of the signal and interference, and theoretically prove that the solution provides excellent estimates for the signal and interference. To solve this problem, we develop an interference cancellation diffusion model (ICDM), which decomposes the joint posterior into independent prior probabilities of the signal and interference, along with the channel transition probablity. The log-gradients of these distributions at each time step are learned separately by DMs and accurately estimated through deriving. ICDM further integrates these gradients with advanced numerical iteration method, achieving accurate and rapid interference cancellation. Extensive experiments demonstrate that ICDM significantly reduces the mean square error (MSE) and enhances perceptual quality compared to schemes without ICDM. For example, on the CelebA dataset under the Rayleigh fading channel with a signal-to-noise ratio (SNR) of $20$ dB and signal to interference plus noise ratio (SINR) of 0 dB, ICDM reduces the MSE by 4.54 dB and improves the learned perceptual image patch similarity (LPIPS) by 2.47 dB.

cs.IT↗

SANNet: A Semantic-Aware Agentic AI Networking Framework for Multi-Agent Cross-Layer Coordination

Agentic AI networking (AgentNet) is a novel AI-native networking paradigm that relies on a large number of specialized AI agents to collaborate and coordinate for autonomous decision-making, dynamic environmental adaptation, and complex goal achievement. It has the potential to facilitate real-time network management alongside capabilities for self-configuration, self-optimization, and self-adaptation across diverse and complex networking environments, laying the foundation for fully autonomous networking systems in the future. Despite its promise, AgentNet is still in the early stage of development, and there still lacks an effective networking framework to support automatic goal discovery and multi-agent self-orchestration and task assignment. This paper proposes SANNet, a novel semantic-aware agentic AI networking architecture that can infer the semantic goal of the user and automatically assign agents associated with different layers of a mobile system to fulfill the inferred goal. Motivated by the fact that one of the major challenges in AgentNet is that different agents may have different and even conflicting objectives when collaborating for certain goals, we introduce a dynamic weighting-based conflict-resolving mechanism to address this issue. We prove that SANNet can provide theoretical guarantee in both conflict-resolving and model generalization performance for multi-agent collaboration in dynamic environment. We develop a hardware prototype of SANNet based on the open RAN and 5GS core platform. Our experimental results show that SANNet can significantly improve the performance of multi-agent networking systems, even when agents with conflicting objectives are selected to collaborate for the same goal.

cs.AI↗

Understanding the Lyα Emission Observed by the Solar Disk Imager Aboard the Advanced Space-based Solar Observatory

The H I Lyman-alpha (Ly$α$) emission, with a wavelength of 1216 Å, is the brightest solar ultraviolet (UV) line. However, comprehensive observations of the Ly$α$ emission line across the full solar disk remain limited. As part of the ASO-S mission, the Solar Disk Imager (SDI) has successfully captured full-disk images in the Ly$α$ band. Gaussian fitting of SDI's spectral response function (SRF) yields a full width at half maximum (FWHM) of approximately 85 Å, which is significantly broader than the distance of Si III line at 1206 Å and the Ly$α$ line. Thus, the emission contribution of Si III to the SDI Ly$α$ passband needs to be considered. For flares, in practice, we calculated the integrated intensity ratio $I$(Si III)/$I$(Ly$α$) by analyzing spectral observations from the SOLSTICE instrument. It yields values between 1.7% and 14.6%. Empirically, the ratio is proportional to the SXR flux. Further analysis of spectral data from the SUMER instrument reveals that the ratio $I$(Si III)/$I$(Ly$α$) is approximately 0.5% for prominences, 0.7%--0.9% for the inner disk, and 1.4%--1.9% close to the limb. These findings suggest that $I$(Si III)/$I$(Ly$α$) is minimal for prominences and the inner disk, and the varying ratios across regions align with the center-to-limb variation of the Si III and Ly$α$ lines. Additionally, we compared Ly$α$ image intensity with 304 Å, 1600 Å, and 1700 Å observations from AIA, as well as H$α$ from CHASE, in multiple regions (a prominence region, two active regions, and a quiet region). A relatively higher correlation of about 85% is found between Ly$α$ and 304 Å in active regions, whereas in the quiet region and prominence, their correlation coefficients are about 55%.

astro-ph.SR↗

Modeling and Performance Analysis of IoT-over-LEO Satellite Systems under Realistic Operational Constraints: A Stochastic Geometry Approach

Current theoretical studies on IoT-over-LEO satellite systems often rely on unrealistic assumptions, such as infinite terrestrial areas and omnidirectional satellite coverage, leaving significant gaps in theoretical analysis for more realistic operational constraints. These constraints involve finite terrestrial area, limited satellite coverage, Earth curvature effect, integral uplink and downlink analysis, and link-dependent interference. To address these gaps, this paper proposes a novel stochastic geometry based model to rigorously analyze the performance of IoT-over-LEO satellite systems. By adopting a binomial point process (BPP) instead of the conventional Poisson point process (PPP), our model accurately characterizes the geographical distribution of a fixed number of IoT devices in a finite terrestrial region. This modeling framework enables the derivation of distance distribution functions for both the links from the terrestrial IoT devices to the satellites (T-S) and from the satellites to the Earth station (S-ES), while also accounting for limited satellite coverage and Earth curvature effects. To realistically represent channel conditions, the Nakagami fading model is employed for the T-S links to characterize diverse small-scale fading environments, while the shadowed-Rician fading model is used for the S-ES links to capture the combined effects of shadowing and dominant line-of-sight paths. Furthermore, the analysis incorporates uplink and downlink interference, ensuring a comprehensive evaluation of system performance. The accuracy and effectiveness of our theoretical framework are validated through extensive Monte Carlo simulations. These results provide insights into key performance metrics, such as coverage probability and average ergodic rate, for both individual links and the overall system.

cs.NI↗

Learnable Residual-Based Latent Denoising in Semantic Communication

A latent denoising semantic communication (SemCom) framework is proposed for robust image transmission over noisy channels. By incorporating a learnable latent denoiser into the receiver, the received signals are preprocessed to effectively remove the channel noise and recover the semantic information, thereby enhancing the quality of the decoded images. Specifically, a latent denoising mapping is established by an iterative residual learning approach to improve the denoising efficiency while ensuring stable performance. Moreover, channel signal-to-noise ratio (SNR) is utilized to estimate and predict the latent similarity score (SS) for conditional denoising, where the number of denoising steps is adapted based on the predicted SS sequence, further reducing the communication latency. Finally, simulations demonstrate that the proposed framework can effectively and efficiently remove the channel noise at various levels and reconstruct visual-appealing images.

cs.LG↗

Nonlinear Evolution Toward the Linear Diffusive Profile in the Presence of Couette Flow

In this paper, we investigate the long-time behavior of solutions to the two-dimensional Navier-Stokes equations with initial data evolving under the influence of the planar Couette flow. We focus on general perturbations, which may be large and of low regularity, including singular configurations such as point vortices, and show that the vorticity asymptotically approaches a constant multiple of the fundamental solution of the corresponding linearized vorticity equation after a long-time evolution determined by the relative Reynolds number.

math.AP↗