arXiv subjects

Ping Wang

Publications and source records attributed to Ping Wang.

At least 109 records · Page 6Linked to original sources

arXiv2025

Proximal Algorithm Unrolling: Flexible and Efficient Reconstruction Networks for Single-Pixel Imaging

Deep-unrolling and plug-and-play (PnP) approaches have become the de-facto standard solvers for single-pixel imaging (SPI) inverse problem. PnP approaches, a class of iterative algorithms where regularization is implicitly performed by an off-the-shelf deep denoiser, are flexible for varying compression ratios (CRs) but are limited in reconstruction accuracy and speed. Conversely, unrolling approaches, a class of multi-stage neural networks where a truncated iterative optimization process is transformed into an end-to-end trainable network, typically achieve better accuracy with faster inference but require fine-tuning or even retraining when CR changes. In this paper, we address the challenge of integrating the strengths of both classes of solvers. To this end, we design an efficient deep image restorer (DIR) for the unrolling of HQS (half quadratic splitting) and ADMM (alternating direction method of multipliers). More importantly, a general proximal trajectory (PT) loss function is proposed to train HQS/ADMM-unrolling networks such that learned DIR approximates the proximal operator of an ideal explicit restoration regularizer. Extensive experiments demonstrate that, the resulting proximal unrolling networks can not only flexibly handle varying CRs with a single model like PnP algorithms, but also outperform previous CR-specific unrolling networks in both reconstruction accuracy and speed. Source codes and models are available at https://github.com/pwangcs/ProxUnroll.

eess.IV↗

arXiv2025

Robust and digital hyper-polarization protocol of nuclear spins via magic sequential sequence

Hyper-polarization of nuclear spins is crucial for advancing nuclear magnetic resonance (NMR) and quantum information technologies, as nuclear spins typically exhibit extremely low polarization at room temperature due to their small gyro-magnetic ratios. A promising approach to achieving high nuclear spin polarization is transferring the polarization of electron to nuclear spin. The nitrogen-vacancy (NV) center in diamond has emerged as a highly effective medium for this purpose, and various hyper-polarization protocols have been developed. Among these, the pulsed polarization (PulsePol) method has been extensively studied due to its robustness against static energy shifts of the electron spin. In this study, we introduce a sequential polarization protocol and identify a series of magic and digital sequences for hyper-polarizing nuclear spins. Notably, we demonstrate that some of these magic sequences exhibit significantly greater robustness compared to the PulsePol protocol in the presence of finite half $π$ pulse duration of the protocol. This enhanced robustness positions our protocol as a more suitable candidate for hyper-polarizing nuclear spins species with large gyromagnetic ratios and also ensures better compatibility with high-efficiency readout techniques at high magnetic fields. Additionally, the generality of our protocol allows for its direct application to other solid-state quantum systems beyond the NV center.

quant-ph↗

arXiv2025

Pitch Angle Measurement Method based on Detector Counts Distribution. -I. Basic conception

As an X-ray and gamma-ray all-sky monitor aiming for high energy astrophysical transients, Gravitational-wave high-energy Electromagnetic Counterpart All-sky Monitor (GECAM) has also made a series of observational discoveries on burst events of gamma-rays and particles in the low Earth orbit. Pitch angle is one of the key parameters of charged particles traveling around geomagnetic field. However, the usage of the GECAM-style instruments to measure the pitch angle of charged particles is still lacking. Here we propose a novel method for GECAM and similar instruments to measure the pitch angle of charged particles based on detector counts distribution. The basic conception of this method and simulation studies are described. With this method, the pitch angle of a peculiar electron precipitation event detected by GECAM-C is derived to be about 90$^\circ$, demonstrating the feasibility of our method. We note that the application of this method on GECAM-style instruments may open a new window for studying space particle events, such as Terrestrial Electron Beams (TEBs) and Lightning-induced Electron Precipitations (LEPs).

astro-ph.IM↗

arXiv2025

GECAM Discovery of Peculiar Oscillating Particle Precipitation Events

Charged particle precipitation typically manifests as a gradual increase and decrease of flux observed by space detectors. Cases with rapidly flux variation are very rare. Periodic events are even more extraordinary. These oscillating particle precipitation (OPP) events are usually attributed to the bounce motion of electrons, which are induced by lightning. Owing to the observation limitations, there has been debate regarding whether these oscillations originate from temporal flux evolution or spatial structure evolution. Here we report three peculiar charged particle precipitation events detected by GECAM during a geomagnetic storm on March 21, 2024, with two exhibiting significant periodicity. These events were observed around the same region during three consecutive orbits. Through comprehensive temporal and spectral analyses, we revealed that one of the OPP events exhibited a transition in spectral lag of mini-pulses, shifting from "softer-earlier" to "softer-later" while showing no significant time evolution in overall frequency characteristics. And there is no association found between these two OPP events and lightning activity. Several possible scenarios are discussed to explain these charged particles with a life time of more than 3.5 hours, but the nature of these three events remains an enigma. We suggest that these GECAM-detected OPP events may represent a new type of particle precipitation event or a peculiar Lightning-induced Electron Precipitations (LEPs).

astro-ph.HE↗

arXiv2025

Random walks with resetting on hypergraph

Hypergraph has been selected as a powerful candidate for characterizing higher-order networks and has received increasing attention in recent years. In this article, we study random walks with resetting on hypergraph by utilizing spectral theory. Specifically, we derive exact expressions for some fundamental yet key parameters, including occupation probability, stationary distribution, and mean first passage time, all of which are expressed in terms of the eigenvalues and eigenvectors of the transition matrix. Furthermore, we provide a general condition for determining the optimal reset probability and a sufficient condition for its existence. In addition, we build up a close relationship between random walks with resetting on hypergraph and simple random walks. Concretely, the eigenvalues and eigenvectors of the former can be precisely represented by those of the latter. More importantly, when considering random walks, we abandon the traditional approach of converting hypergraph into a graph and propose a research framework that preserves the intrinsic structure of hypergraph itself, which is based on assigning proper weights to neighboring nodes. Through extensive experiments, we show that the new framework produces distinct and more reliable results than the traditional approach in node ranking. Finally, we explore the impact of the resetting mechanism on cover time, providing a potential solution for optimizing search efficiency.

cs.SI↗

arXiv2025

Faster MoE LLM Inference for Extremely Large Models

Sparse Mixture of Experts (MoE) large language models (LLMs) are gradually becoming the mainstream approach for ultra-large-scale models. Existing optimization efforts for MoE models have focused primarily on coarse-grained MoE architectures. With the emergence of DeepSeek Models, fine-grained MoE models are gaining popularity, yet research on them remains limited. Therefore, we want to discuss the efficiency dynamic under different service loads. Additionally, fine-grained models allow deployers to reduce the number of routed experts, both activated counts and total counts, raising the question of how this reduction affects the trade-off between MoE efficiency and performance. Our findings indicate that while deploying MoE models presents greater challenges, it also offers significant optimization opportunities. Reducing the number of activated experts can lead to substantial efficiency improvements in certain scenarios, with only minor performance degradation. Reducing the total number of experts provides limited efficiency gains but results in severe performance degradation. Our method can increase throughput by at least 10\% without any performance degradation. Overall, we conclude that MoE inference optimization remains an area with substantial potential for exploration and improvement.

cs.CL↗

arXiv2025

Whispers of Data: Unveiling Label Distributions in Federated Learning Through Virtual Client Simulation

Federated Learning enables collaborative training of a global model across multiple geographically dispersed clients without the need for data sharing. However, it is susceptible to inference attacks, particularly label inference attacks. Existing studies on label distribution inference exhibits sensitive to the specific settings of the victim client and typically underperforms under defensive strategies. In this study, we propose a novel label distribution inference attack that is stable and adaptable to various scenarios. Specifically, we estimate the size of the victim client's dataset and construct several virtual clients tailored to the victim client. We then quantify the temporal generalization of each class label for the virtual clients and utilize the variation in temporal generalization to train an inference model that predicts the label distribution proportions of the victim client. We validate our approach on multiple datasets, including MNIST, Fashion-MNIST, FER2013, and AG-News. The results demonstrate the superiority of our method compared to state-of-the-art techniques. Furthermore, our attack remains effective even under differential privacy defense mechanisms, underscoring its potential for real-world applications.

cs.LG↗

arXiv2025

An Information-theoretic Security Analysis of Honeyword

Honeyword is a representative "honey" technique that employs decoy objects to mislead adversaries and protect the real ones. To assess the security of a Honeyword system, two metrics--flatness and success-number--have been proposed and evaluated using various simulated attackers. Existing evaluations typically apply statistical learning methods to distinguish real passwords from decoys on real-world datasets. However, such evaluations may overestimate the system's security, as more effective distinguishing attacks could potentially exist. In this paper, we aim to analyze the security of Honeyword systems under the strongest theoretical attack, rather than relying on specific, expert-crafted attacks evaluated in prior experimental studies. We first derive mathematical expressions for the flatness and success-number under the strongest attack. We conduct analyses and computations for several typical scenarios, and determine the security of honeyword generation methods using a uniform distribution and the List model as examples. We further evaluate the security of existing honeyword generation methods based on password probability models (PPMs), which depends on the sample size used for training. We investigate, for the first time, the sample complexity of several representative PPMs, introducing two novel polynomial-time approximation schemes for computing the total variation between PCFG models and between higher-order Markov models. Our experimental results show that for small-scale password distributions, sample sizes on the order of millions--often tens of millions--are required to reduce the total variation below 0.1. A surprising result is that we establish an equivalence between flatness and total variation, thus bridging the theoretical study of Honeyword systems with classical information theory. Finally, we discuss the practical implications of our findings.

cs.CR↗

arXiv2025

Task as Context Prompting for Accurate Medical Symptom Coding Using Large Language Models

Accurate medical symptom coding from unstructured clinical text, such as vaccine safety reports, is a critical task with applications in pharmacovigilance and safety monitoring. Symptom coding, as tailored in this study, involves identifying and linking nuanced symptom mentions to standardized vocabularies like MedDRA, differentiating it from broader medical coding tasks. Traditional approaches to this task, which treat symptom extraction and linking as independent workflows, often fail to handle the variability and complexity of clinical narratives, especially for rare cases. Recent advancements in Large Language Models (LLMs) offer new opportunities but face challenges in achieving consistent performance. To address these issues, we propose Task as Context (TACO) Prompting, a novel framework that unifies extraction and linking tasks by embedding task-specific context into LLM prompts. Our study also introduces SYMPCODER, a human-annotated dataset derived from Vaccine Adverse Event Reporting System (VAERS) reports, and a two-stage evaluation framework to comprehensively assess both symptom linking and mention fidelity. Our comprehensive evaluation of multiple LLMs, including Llama2-chat, Jackalope-7b, GPT-3.5 Turbo, GPT-4 Turbo, and GPT-4o, demonstrates TACO's effectiveness in improving flexibility and accuracy for tailored tasks like symptom coding, paving the way for more specific coding tasks and advancing clinical text processing methodologies.

cs.CL↗

arXiv2025

Deep Learning Advancements in Anomaly Detection: A Comprehensive Survey

The rapid expansion of data from diverse sources has made anomaly detection (AD) increasingly essential for identifying unexpected observations that may signal system failures, security breaches, or fraud. As datasets become more complex and high-dimensional, traditional detection methods struggle to effectively capture intricate patterns. Advances in deep learning have made AD methods more powerful and adaptable, improving their ability to handle high-dimensional and unstructured data. This survey provides a comprehensive review of over 180 recent studies, focusing on deep learning-based AD techniques. We categorize and analyze these methods into reconstruction-based and prediction-based approaches, highlighting their effectiveness in modeling complex data distributions. Additionally, we explore the integration of traditional and deep learning methods, highlighting how hybrid approaches combine the interpretability of traditional techniques with the flexibility of deep learning to enhance detection accuracy and model transparency. Finally, we identify open issues and propose future research directions to advance the field of AD. This review bridges gaps in existing literature and serves as a valuable resource for researchers and practitioners seeking to enhance AD techniques using deep learning.

cs.LG↗

arXiv2025

Fair Federated Medical Image Classification Against Quality Shift via Inter-Client Progressive State Matching

Despite the potential of federated learning in medical applications, inconsistent imaging quality across institutions-stemming from lower-quality data from a minority of clients-biases federated models toward more common high-quality images. This raises significant fairness concerns. Existing fair federated learning methods have demonstrated some effectiveness in solving this problem by aligning a single 0th- or 1st-order state of convergence (e.g., training loss or sharpness). However, we argue in this work that fairness based on such a single state is still not an adequate surrogate for fairness during testing, as these single metrics fail to fully capture the convergence characteristics, making them suboptimal for guiding fair learning. To address this limitation, we develop a generalized framework. Specifically, we propose assessing convergence using multiple states, defined as sharpness or perturbed loss computed at varying search distances. Building on this comprehensive assessment, we propose promoting fairness for these states across clients to achieve our ultimate fairness objective. This is accomplished through the proposed method, FedISM+. In FedISM+, the search distance evolves over time, progressively focusing on different states. We then incorporate two components in local training and global aggregation to ensure cross-client fairness for each state. This gradually makes convergence equitable for all states, thereby improving fairness during testing. Our empirical evaluations, performed on the well-known RSNA ICH and ISIC 2019 datasets, demonstrate the superiority of FedISM+ over existing state-of-the-art methods for fair federated learning. The code is available at https://github.com/wnn2000/FFL4MIA.

eess.IV↗

arXiv2025

The GECAM Ground Search System for Gamma-ray Transients

In the era of time-domain, multi-messenger astronomy, the detection of transient events on the high-energy electromagnetic sky has become more important than ever. The Gravitational wave high-energy Electromagnetic Counterpart All-sky Monitor (GECAM) is a dedicated mission to monitor gamma-ray transients, launched in December, 2020. A real-time on-board trigger and location software, using the traditional signal-to-noise ratio (SNR) method for blind search, is constrained to relatively bright signals due to the limitations in on-board computing resources and the need for real-time search. In this work, we developed a ground-based pipeline for GECAM to search for various transients, especially for weak bursts missed by on-board software. This pipeline includes both automatic and manual mode, offering options for blind search and targeted search. The targeted search is specifically designed to search for interesting weak bursts, such as gravitational wave-associated gamma-ray bursts (GRBs). From the ground search of the data in the first year, GECAM has been triggered by 54 GRBs and other transients, including soft gamma-ray repeaters, X-ray binaries, solar flares, terrestrial gamma-ray flashes. We report the properties of each type of triggers,such as trigger time and light curves. With this search pipeline and assuming a soft Band spectrum, the GRB detection sensitivity of GECAM is increased to about 1.1E-08 erg cm-2 s-1 (10 keV - 1000 keV, burst duration of 20 s). These results demonstrate that the GECAM ground search system (both blind search and targeted search) is a versatile pipeline to recover true astrophysical signals which were too weak to be found in the on-board search.

astro-ph.HE↗

arXiv2025

Modeling Multi-modal Cross-interaction for Multi-label Few-shot Image Classification Based on Local Feature Selection

The aim of multi-label few-shot image classification (ML-FSIC) is to assign semantic labels to images, in settings where only a small number of training examples are available for each label. A key feature of the multi-label setting is that an image often has several labels, which typically refer to objects appearing in different regions of the image. When estimating label prototypes, in a metric-based setting, it is thus important to determine which regions are relevant for which labels, but the limited amount of training data and the noisy nature of local features make this highly challenging. As a solution, we propose a strategy in which label prototypes are gradually refined. First, we initialize the prototypes using word embeddings, which allows us to leverage prior knowledge about the meaning of the labels. Second, taking advantage of these initial prototypes, we then use a Loss Change Measurement (LCM) strategy to select the local features from the training images (i.e. the support set) that are most likely to be representative of a given label. Third, we construct the final prototype of the label by aggregating these representative local features using a multi-modal cross-interaction mechanism, which again relies on the initial word embedding-based prototypes. Experiments on COCO, PASCAL VOC, NUS-WIDE, and iMaterialist show that our model substantially improves the current state-of-the-art.

cs.CV↗

arXiv2025

Label Drop for Multi-Aspect Relation Modeling in Universal Information Extraction

Universal Information Extraction (UIE) has garnered significant attention due to its ability to address model explosion problems effectively. Extractive UIE can achieve strong performance using a relatively small model, making it widely adopted. Extractive UIEs generally rely on task instructions for different tasks, including single-target instructions and multiple-target instructions. Single-target instruction UIE enables the extraction of only one type of relation at a time, limiting its ability to model correlations between relations and thus restricting its capability to extract complex relations. While multiple-target instruction UIE allows for the extraction of multiple relations simultaneously, the inclusion of irrelevant relations introduces decision complexity and impacts extraction accuracy. Therefore, for multi-relation extraction, we propose LDNet, which incorporates multi-aspect relation modeling and a label drop mechanism. By assigning different relations to different levels for understanding and decision-making, we reduce decision confusion. Additionally, the label drop mechanism effectively mitigates the impact of irrelevant relations. Experiments show that LDNet outperforms or achieves competitive performance with state-of-the-art systems on 9 tasks, 33 datasets, in both single-modal and multi-modal, few-shot and zero-shot settings.\footnote{https://github.com/Lu-Yang666/LDNet}

cs.CL↗

arXiv2025

NOTA: Multimodal Music Notation Understanding for Visual Large Language Model

Symbolic music is represented in two distinct forms: two-dimensional, visually intuitive score images, and one-dimensional, standardized text annotation sequences. While large language models have shown extraordinary potential in music, current research has primarily focused on unimodal symbol sequence text. Existing general-domain visual language models still lack the ability of music notation understanding. Recognizing this gap, we propose NOTA, the first large-scale comprehensive multimodal music notation dataset. It consists of 1,019,237 records, from 3 regions of the world, and contains 3 tasks. Based on the dataset, we trained NotaGPT, a music notation visual large language model. Specifically, we involve a pre-alignment training phase for cross-modal alignment between the musical notes depicted in music score images and their textual representation in ABC notation. Subsequent training phases focus on foundational music information extraction, followed by training on music notation analysis. Experimental results demonstrate that our NotaGPT-7B achieves significant improvement on music understanding, showcasing the effectiveness of NOTA and the training pipeline. Our datasets are open-sourced at https://huggingface.co/datasets/MYTH-Lab/NOTA-dataset.

cs.CV↗

arXiv2025

Fluid Antenna Enabled Over-the-Air Federated Learning: Joint Optimization of Positioning, Beamforming, and User Selection

Over-the-air (OTA) federated learning (FL) effectively utilizes communication bandwidth, yet it is vulnerable to errors during analog aggregation. While removing users with unfavorable channel conditions can mitigate these errors, it also reduces the available local training data for FL, which in turn hinders the convergence rate of the training process. To tackle this issue, we propose using fluid antenna (FA) techniques to enhance the degrees of freedom within the channel space, ultimately boosting the convergence speed of FL training. Moreover, we develop a novel approach that effectively coordinates uplink receiver beamforming, user selection, and FA positioning to optimize the convergence rate of OTA FL training in dynamic wireless environments. We address this challenging stochastic optimization by reformulating it as a mixed-integer programming problem by utilizing the training loss upper bound. We then introduce a penalty dual decomposition (PDD) method to solve the mixed-integer mixed programming problem. Experimental results indicate that incorporating FA techniques significantly accelerates the training convergence of FL and greatly surpasses conventional methods.

eess.SP↗

arXiv2025

Latent Diffusion Model-Enabled Low-Latency Semantic Communication in the Presence of Semantic Ambiguities and Wireless Channel Noises

Deep learning (DL)-based Semantic Communications (SemCom) is becoming critical to maximize overall efficiency of communication networks. Nevertheless, SemCom is sensitive to wireless channel uncertainties, source outliers, and suffer from poor generalization bottlenecks. To address the mentioned challenges, this paper develops a latent diffusion model-enabled SemCom system with three key contributions, i.e., i) to handle potential outliers in the source data, semantic errors obtained by projected gradient descent based on the vulnerabilities of DL models, are utilized to update the parameters and obtain an outlier-robust encoder, ii) a lightweight single-layer latent space transformation adapter completes one-shot learning at the transmitter and is placed before the decoder at the receiver, enabling adaptation for out-of-distribution data and enhancing human-perceptual quality, and iii) an end-to-end consistency distillation (EECD) strategy is used to distill the diffusion models trained in latent space, enabling deterministic single or few-step low-latency denoising in various noisy channels while maintaining high semantic quality. Extensive numerical experiments across different datasets demonstrate the superiority of the proposed SemCom system, consistently proving its robustness to outliers, the capability to transmit data with unknown distributions, and the ability to perform real-time channel denoising tasks while preserving high human perceptual quality, outperforming the existing denoising approaches in semantic metrics such as multi-scale structural similarity index measure (MS-SSIM) and learned perceptual image path similarity (LPIPS).

cs.LG↗

arXiv2025

CVaR-Based Variational Quantum Optimization for User Association in Handoff-Aware Vehicular Networks

Efficient resource allocation is essential for optimizing various tasks in wireless networks, which are usually formulated as generalized assignment problems (GAP). GAP, as a generalized version of the linear sum assignment problem, involves both equality and inequality constraints that add computational challenges. In this work, we present a novel Conditional Value at Risk (CVaR)-based Variational Quantum Eigensolver (VQE) framework to address GAP in vehicular networks (VNets). Our approach leverages a hybrid quantum-classical structure, integrating a tailored cost function that balances both objective and constraint-specific penalties to improve solution quality and stability. Using the CVaR-VQE model, we handle the GAP efficiently by focusing optimization on the lower tail of the solution space, enhancing both convergence and resilience on noisy intermediate-scale quantum (NISQ) devices. We apply this framework to a user-association problem in VNets, where our method achieves 23.5% improvement compared to the deep neural network (DNN) approach.

cs.LG↗