arXiv subjects

Ping Wang

Publications and source records attributed to Ping Wang.

At least 73 records · Page 4Linked to original sources

arXiv2025

GAPS: A Clinically Grounded, Automated Benchmark for Evaluating AI Clinicians

Current benchmarks for AI clinician systems, often based on multiple-choice exams or manual rubrics, fail to capture the depth, robustness, and safety required for real-world clinical practice. To address this, we introduce the GAPS framework, a multidimensional paradigm for evaluating Grounding (cognitive depth), Adequacy (answer completeness), Perturbation (robustness), and Safety. Critically, we developed a fully automated, guideline-anchored pipeline to construct a GAPS-aligned benchmark end-to-end, overcoming the scalability and subjectivity limitations of prior work. Our pipeline assembles an evidence neighborhood, creates dual graph and tree representations, and automatically generates questions across G-levels. Rubrics are synthesized by a DeepResearch agent that mimics GRADE-consistent, PICO-driven evidence review in a ReAct loop. Scoring is performed by an ensemble of large language model (LLM) judges. Validation confirmed our automated questions are high-quality and align with clinician judgment (90% agreement, Cohen's Kappa 0.77). Evaluating state-of-the-art models on the benchmark revealed key failure modes: performance degrades sharply with increased reasoning depth (G-axis), models struggle with answer completeness (A-axis), and they are highly vulnerable to adversarial perturbations (P-axis) as well as certain safety issues (S-axis). This automated, clinically-grounded approach provides a reproducible and scalable method for rigorously evaluating AI clinician systems and guiding their development toward safer, more reliable clinical practice. The benchmark dataset GAPS-NSCLC-preview and evaluation code are publicly available at https://huggingface.co/datasets/AQ-MedAI/GAPS-NSCLC-preview and https://github.com/AQ-MedAI/MedicalAiBenchEval.

cs.CL↗

arXiv2025

Head Stabilization for Wheeled Bipedal Robots via Force-Estimation-Based Admittance Control

Wheeled bipedal robots are emerging as flexible platforms for field exploration. However, head instability induced by uneven terrain can degrade the accuracy of onboard sensors or damage fragile payloads. Existing research primarily focuses on stabilizing the mobile platform but overlooks active stabilization of the head in the world frame, resulting in vertical oscillations that undermine overall stability. To address this challenge, we developed a model-based ground force estimation method for our 6-degree-of-freedom wheeled bipedal robot. Leveraging these force estimates, we implemented an admittance control algorithm to enhance terrain adaptability. Simulation experiments validated the real-time performance of the force estimator and the robot's robustness when traversing uneven terrain.

cs.RO↗

arXiv2025

Universal learning of nonlocal entropy via local correlations in non-equilibrium quantum states

Characterizing the nonlocal nature of quantum states is a central challenge in the practical application of large-scale quantum computation and simulation. Quantum mutual information (QMI), a fundamental nonlocal measure, plays a key role in quantifying entanglement and has become increasingly important in studying nonequilibrium quantum many-body phenomena, such as many-body localization and thermalization. However, experimental measurement of QMI remains extremely difficult, particularly for nonequilibrium states, which are more complex than ground states. In this Letter, we employ a multilayer perceptron (MLP) to establish a universal mapping between the QMI and local correlations only up to second order for nonequilibrium states generated by quenches in a one-dimensional disordered XXZ model. Our approach provides a practical method for experimentally extracting QMI, readily applicable in platforms such as superconducting qubits. Moreover, this work will establishes a general framework for reconstructing other nonlocal observables, including Fisher information and out-of-time-ordered correlators.

quant-ph↗

arXiv2025

GRB 240715A: Revealing Novel Intrinsic Mechanism by Different Individual Pulse

The Space-based multiband astronomical Variable Objects Monitor (SVOM), detected its first short gamma-ray burst, GRB 240715A, in-flight, which was jointly observed by Fermi. Based on observational data of SVOM/GRM and Fermi/GBM, we perform a comprehensive temporal and spectral analysis for individual pulse in the prompt emission of this burst, and novel characteristics are revealed. Firstly, opposite evolutions of spectral lag are found in the first and third pulse of this burst. Second, the large negative lag of the first pulse is an outlier in short GRB sample, especially when the pulse duration is considered. Spectral analysis shows that the negative lag of the first pulse is caused by the evolution of spectrum index, and is irrelevant to Epeak, which is inconsistent with the previous study. The intrinsic mechanism is probably attributed to electron cooling in the decaying magnetic field, which leads to the continuous hardening of the spectrum index and results in negative lag. Furthermore, spectral analysis also shows that the third pulse is more likely to be described by a quasi-thermal spectrum, indicating the existence of photospheric emission. It is difficult to explain how the synchrotron radiation appears before photospheric emission in a single GRB and some assumptions are discussed.

astro-ph.HE↗

arXiv2025

InternData-A1: Pioneering High-Fidelity Synthetic Data for Pre-training Generalist Policy

Recent works explore how real and synthetic data contribute to Vision-Language-Action (VLA) models' generalization. While current VLA models have shown the strong effectiveness of large-scale real-robot pre-training, synthetic data has not previously demonstrated comparable capability at scale. This paper provides the first evidence that synthetic data alone can match the performance of the strongest $π$-dataset in pre-training a VLA model, revealing the substantial value of large-scale simulation. The resulting model also exhibits surprisingly zero-shot sim-to-real transfer on several challenging tasks. Our synthetic dataset, InternData-A1, contains over 630k trajectories and 7,433 hours across 4 embodiments, 18 skills, 70 tasks, and 227 scenes, covering rigid, articulated, deformable, and fluid-object manipulation. It is generated through a highly autonomous, fully decoupled, and compositional simulation pipeline that enables long-horizon skill composition, flexible task assembly, and heterogeneous embodiments with minimal manual tuning. Using the same architecture as $π_0$, we pre-train a model entirely on InternData-A1 and find that it matches the official $π_0$ across 49 simulation tasks, 5 real-world tasks, and 4 long-horizon dexterous tasks. We release the dataset and will open-source the generation pipeline to broaden access to large-scale robotic data and to lower the barrier to scalable data creation for embodied AI research.

cs.RO↗

arXiv2025

Mutual Information Bounds in the Shuffle Model

The shuffle model enhances privacy by anonymizing users' reports through random permutation. This paper presents the first systematic study of the single-message shuffle model from an information-theoretic perspective. We analyze two regimes: the shuffle-only setting, where each user directly submits its message ($Y_i=X_i$), and the shuffle-DP setting, where each user first applies a local $\varepsilon_0$-differentially private mechanism before shuffling ($Y_i=\mathcal{R}(X_i)$). Let $\boldsymbol{Z} = (Y_{σ(i)})_i$ denote the shuffled sequence produced by a uniformly random permutation $σ$, and let $K = σ^{-1}(1)$ represent the position of user 1's message after shuffling. For the shuffle-only setting, we focus on a tractable yet expressive \emph{basic configuration}, where the target user's message follows $Y_1 \sim P$ and the remaining users' messages are i.i.d.\ samples from $Q$, i.e., $Y_2,\dots,Y_n \sim Q$. We derive asymptotic expressions for the mutual information quantities $I(Y_1;\boldsymbol{Z})$ and $I(K;\boldsymbol{Z})$ as $n \to \infty$, and demonstrate how this analytical framework naturally extends to settings with heterogeneous user distributions. For the shuffle-DP setting, we establish information-theoretic upper bounds on total information leakage. When each user applies an $\varepsilon_0$-DP mechanism, the overall leakage satisfies $I(K; \boldsymbol{Z}) \le 2\varepsilon_0$ and $I(X_1; \boldsymbol{Z}\mid (X_i)_{i=2}^n) \le (e^{\varepsilon_0}-1)/(2n) + O(n^{-3/2})$. These results bridge shuffle differential privacy and mutual-information-based privacy.

cs.IT↗

arXiv2025

A Method for Gamma-Ray Energy Spectrum Inversion and Correction

Accurate spectral analysis of high-energy astrophysical sources often relies on comparing observed data to incident spectral models convolved with the instrument response. However, for Gamma-Ray Bursts and other high-energy transient events observed at high count rates, significant distortions (e.g., pile-up, dead time, and large signal trailing) are introduced, complicating this analysis. We present a method framework to address the model dependence problem, especially to solve the problem of energy spectrum distortion caused by instrument signal pile-up due to high counting rate and high-rate effects, applicable to X-ray, gamma-ray, and particle detectors. Our approach combines physics-based Monte Carlo (MC) simulations with a model-independent spectral inversion technique. The MC simulations quantify instrumental effects and enable correction of the distorted spectrum. Subsequently, the inversion step reconstructs the incident spectrum using an inverse response matrix approach, conceptually equivalent to deconvolving the detector response. The inversion employs a Convolutional Neural Network, selected for its numerical stability and effective handling of complex detector responses. Validation using simulations across diverse input spectra demonstrates high fidelity. Specifically, for 27 different parameter sets of the brightest gamma-ray bursts, goodness-of-fit tests confirm the reconstructed spectra are in excellent statistical agreement with the input spectra, and residuals are typically within $\pm 2σ$. This method enables precise analysis of intense transients and other high-flux events, overcoming limitations imposed by instrumental effects in traditional analyses.

astro-ph.HE↗

arXiv2025

Chemical vapor deposition growth of continuous monolayer antiferromagnetic CrOCl films

The discovery of two-dimensional magnetic materials has provided an ideal platform for exploring physical phenomena in the two-dimensional limit. However, intrinsic two-dimensional antiferromagnetic materials have been rarely reported, limiting systematic studies of their electronic properties. The discovery of novel intrinsic two-dimensional antiferromagnets and the development of robust synthesis strategies, therefore, remain significant challenges. Here, we report the chemical vapor deposition synthesis of CrOCl monolayer films and nanosheets that exhibit excellent air stability. The CrOCl morphology is tunable, ranging from two-dimensional nanosheets to three-dimensional flower-like structures, with lateral sizes ranging from several microns to continuous monolayer films. Structural characterization confirms the materials composition and high crystalline quality. Furthermore, magnetic measurements, supported by theoretical calculations, reveal a Néel temperature for CrOCl of ~14 K. This work provides a reliable route for preparing two-dimensional antiferromagnetic materials.

cond-mat.mes-hall↗

arXiv2025

Decomposition-Based Optimal Bounds for Privacy Amplification via Shuffling

Shuffling has been shown to amplify differential privacy guarantees, enabling a more favorable privacy-utility trade-off. To characterize and compute this amplification, two fundamental analytical frameworks have been proposed: the \emph{privacy blanket} by Balle et al. (CRYPTO 2019) and the \emph{clone}--including both the standard and stronger variant--by Feldman et al. (FOCS 2021, SODA 2023). These frameworks share a common foundation: decomposing local randomizers into structured components for analysis. In this work, we introduce a unified analytical framework--the general clone paradigm--which subsumes all possible decompositions, with the clone and blanket decompositions arising as special cases. Within this framework, we identify the optimal decomposition, which is precisely the one used by the privacy blanket. Moreover, we develop a simple and efficient algorithm based on the Fast Fourier Transform (FFT) to compute optimal privacy amplification bounds. Experimental results show that our computed upper bounds nearly match the lower bounds, demonstrating the tightness of our method. Building on this method, we also derive optimal amplification bounds for both \emph{joint} and \emph{parallel} compositions of LDP mechanisms in the shuffle model.

cs.CR↗

arXiv2025

GlitchMiner: Mining Glitch Tokens in Large Language Models via Gradient-based Discrete Optimization

Glitch tokens, inputs that trigger unpredictable or anomalous behavior in Large Language Models (LLMs), pose significant challenges to model reliability and safety. Existing detection methods primarily rely on heuristic embedding patterns or statistical anomalies within internal representations, limiting their generalizability across different model architectures and potentially missing anomalies that deviate from observed patterns. We introduce GlitchMiner, an behavior-driven framework designed to identify glitch tokens by maximizing predictive entropy. Leveraging a gradient-guided local search strategy, GlitchMiner efficiently explores the discrete token space without relying on model-specific heuristics or large-batch sampling. Extensive experiments across ten LLMs from five major model families demonstrate that GlitchMiner consistently outperforms existing approaches in detection accuracy and query efficiency, providing a generalizable and scalable solution for effective glitch token discovery. Code is available at [https://github.com/wooozihu/GlitchMiner]

cs.AI↗

arXiv2025

UnCLe: Towards Scalable Dynamic Causal Discovery in Non-linear Temporal Systems

Uncovering cause-effect relationships from observational time series is fundamental to understanding complex systems. While many methods infer static causal graphs, real-world systems often exhibit dynamic causality-where relationships evolve over time. Accurately capturing these temporal dynamics requires time-resolved causal graphs. We propose UnCLe, a novel deep learning method for scalable dynamic causal discovery. UnCLe employs a pair of Uncoupler and Recoupler networks to disentangle input time series into semantic representations and learns inter-variable dependencies via auto-regressive Dependency Matrices. It estimates dynamic causal influences by analyzing datapoint-wise prediction errors induced by temporal perturbations. Extensive experiments demonstrate that UnCLe not only outperforms state-of-the-art baselines on static causal discovery benchmarks but, more importantly, exhibits a unique capability to accurately capture and represent evolving temporal causality in both synthetic and real-world dynamic systems (e.g., human motion). UnCLe offers a promising approach for revealing the underlying, time-varying mechanisms of complex phenomena.

cs.LG↗

arXiv2025

Bayesian Advantage of Re-Identification Attack in the Shuffle Model

The shuffle model, which anonymizes data by randomly permuting user messages, has been widely adopted in both cryptography and differential privacy. In this work, we present the first systematic study of the Bayesian advantage in re-identifying a user's message under the shuffle model. We begin with a basic setting: one sample is drawn from a distribution $P$, and $n - 1$ samples are drawn from a distribution $Q$, after which all $n$ samples are randomly shuffled. We define $β_n(P, Q)$ as the success probability of a Bayes-optimal adversary in identifying the sample from $P$, and define the additive and multiplicative Bayesian advantages as $\mathsf{Adv}_n^{+}(P, Q) = β_n(P,Q) - \frac{1}{n}$ and $\mathsf{Adv}_n^{\times}(P, Q) = n \cdot β_n(P,Q)$, respectively. We derive exact analytical expressions and asymptotic characterizations of $β_n(P, Q)$, along with evaluations in several representative scenarios. Furthermore, we establish (nearly) tight mutual bounds between the additive Bayesian advantage and the total variation distance. Finally, we extend our analysis beyond the basic setting and present, for the first time, an upper bound on the success probability of Bayesian attacks in shuffle differential privacy. Specifically, when the outputs of $n$ users -- each processed through an $\varepsilon$-differentially private local randomizer -- are shuffled, the probability that an attacker successfully re-identifies any target user's message is at most $e^{\varepsilon}/n$.

cs.CR↗

arXiv2025

Bringing Private Reads to Hyperledger Fabric via Private Information Retrieval

Permissioned blockchains ensure integrity and auditability of shared data but expose query parameters to peers during read operations, creating privacy risks for organizations querying sensitive records. This paper proposes a Private Information Retrieval (PIR) mechanism to enable private reads from Hyperledger Fabric's world state, allowing endorsing peers to process encrypted queries without learning which record is accessed. We implement and benchmark a PIR-enabled chaincode that performs ciphertext-plaintext (ct-pt) homomorphic multiplication directly within evaluate transactions, preserving Fabric's endorsement and audit semantics. The prototype achieves an average end-to-end latency of 113 ms and a peer-side execution time below 42 ms, with approximately 2 MB of peer network traffic per private read in development mode--reducible by half under in-process deployment. Storage profiling across three channel configurations shows near-linear growth: block size increases from 77 kilobytes to 294 kilobytes and world-state from 112 kilobytes to 332 kilobytes as the ring dimension scales from 8,192 to 32,768 coefficients. Parameter analysis further indicates that ring size and record length jointly constrain packing capacity, supporting up to 512 records of 64 bytes each under the largest configuration. These results confirm the practicality of PIR-based private reads in Fabric for smaller, sensitive datasets and highlight future directions to optimize performance and scalability.

cs.CR↗

arXiv2025

Design of a Turbo-based Deep Semantic Autoencoder for Marine Internet of Things

With the rapid growth of the global marine economy and flourishing maritime activities, the marine Internet of Things (IoT) is gaining unprecedented momentum. However, current marine equipment is deficient in data transmission efficiency and semantic comprehension. To address these issues, this paper proposes a novel End-to-End (E2E) coding scheme, namely the Turbo-based Deep Semantic Autoencoder (Turbo-DSA). The Turbo-DSA achieves joint source-channel coding at the semantic level through the E2E design of transmitter and receiver, while learning to adapt to environment changes. The semantic encoder and decoder are composed of transformer technology, which efficiently converts messages into semantic vectors. These vectors are dynamically adjusted during neural network training according to channel characteristics and background knowledge base. The Turbo structure further enhances the semantic vectors. Specifically, the channel encoder utilizes Turbo structure to separate semantic vectors, ensuring precise transmission of meaning, while the channel decoder employs Turbo iterative decoding to optimize the representation of semantic vectors. This deep integration of the transformer and Turbo structure is ensured by the design of the objective function, semantic extraction, and the entire training process. Compared with traditional Turbo coding techniques, the Turbo-DSA shows a faster convergence speed, thanks to its efficient processing of semantic vectors. Simulation results demonstrate that the Turbo-DSA surpasses existing benchmarks in key performance indicators, such as bilingual evaluation understudy scores and sentence similarity. This is particularly evident under low signal-to-noise ratio conditions, where it shows superior text semantic transmission efficiency and adaptability to variable marine channel environments.

cs.IT↗

arXiv2025

BREAKFAST: A Framework for general joint BA duty and follow-up guidance of multiple $γ$-ray monitors

With the growing number of gamma-ray monitors in operation, several research teams have adopted a strategy of joint operation and scientific duty to improve efficiency. A successful example is the GECAM-HXMT-SVOM (GHS) constellation collaboration, which sets a precedent for other gamma-ray monitor constellations. However, joint duty also presents challenges to Burst Advocates (BAs), including the increased number of triggers and, more importantly, the frequent switching between various systems due to incompatibilities among different missions, which complicates the situation. To address the current requirements of multi-wavelength and multi-messenger astronomy, we developed a customized framework for unified trigger processing within the GHS joint duty, named "BA's Rapid Evaluation and Analysis Kit for Formulating Alerts and Summary Tools" (BREAKFAST). This framework incorporates a series of automated, semi-automated, and manual pipelines designed to rapidly process triggers of prompt emissions in the gamma-ray band from different instruments, while maintaining flexible compatibility for future missions. The pursuit of BREAKFAST goes beyond merely providing trigger processing for BAs. BREAKFAST also aims to filtering high-value targets and guiding follow-up telescopes through rapid analysis and reporting, thus serving as an important bridge between prompt emission observations and afterglow observations. To this end, a suite of comprehensive analysis modules is included in BREAKFAST, particularly the specially designed module that predicts X-ray afterglow brightness based on prompt emission properties. The framework's effectiveness has already been demonstrated in recent observational campaigns, and it is expected to play a significant role in the discovery and observation of peculiar transients in the future.

astro-ph.IM↗

arXiv2025

Performance Analysis of End-to-End LEO Satellite-Aided Shore-to-Ship Communications: A Stochastic Geometry Approach

Low Earth orbit (LEO) satellite networks have shown strategic superiority in maritime communications, assisting in establishing signal transmissions from shore to ship through space-based links. Traditional performance modeling based on multiple circular orbits is challenging to characterize large-scale LEO satellite constellations, thus requiring a tractable approach to accurately evaluate the network performance. In this paper, we propose a theoretical framework for an LEO satellite-aided shore-to-ship communication network (LEO-SSCN), where LEO satellites are distributed as a binomial point process (BPP) on a specific spherical surface. The framework aims to obtain the end-to-end transmission performance by considering signal transmissions through either a marine link or a space link subject to Rician or Shadowed Rician fading, respectively. Due to the indeterminate position of the serving satellite, accurately modeling the distance from the serving satellite to the destination ship becomes intractable. To address this issue, we propose a distance approximation approach. Then, by approximation and incorporating a threshold-based communication scheme, we leverage stochastic geometry to derive analytical expressions of end-to-end transmission success probability and average transmission rate capacity. Extensive numerical results verify the accuracy of the analysis and demonstrate the effect of key parameters on the performance of LEO-SSCN.

eess.SP↗

arXiv2025

A Secure Affine Frequency Division Multiplexing System for Next-Generation Wireless Communications

Affine frequency division multiplexing (AFDM) has garnered significant attention due to its superior performance in high-mobility scenarios, coupled with multiple waveform parameters that provide greater degrees of freedom for system design. This paper introduces a novel secure affine frequency division multiplexing (SE-AFDM) system, which advances prior designs by dynamically varying an AFDM pre-chirp parameter to enhance physical-layer security. In the SE-AFDM system, the pre-chirp parameter is dynamically generated from a codebook controlled by a long-period pseudo-noise (LPPN) sequence. Instead of applying spreading in the data domain, our parameter-domain spreading approach provides additional security while maintaining reliability and high spectrum efficiency. We also propose a synchronization framework to solve the problem of reliably and rapidly synchronizing the time-varying parameter in fast time-varying channels. The theoretical derivations prove that unsynchronized eavesdroppers cannot eliminate the nonlinear impact of the time-varying parameter and further provide useful guidance for codebook design. Simulation results demonstrate the security advantages of the proposed SE-AFDM system in high-mobility scenarios, while our hardware prototype validates the effectiveness of the proposed synchronization framework.

eess.SP↗

arXiv2025

Unveil A Peculiar Light Curve Pattern of Magnetar Burst with GECAM observations of SGR J1935+2154

Magnetar X-ray Burst (MXB) is usually composed of a single pulse or multiple pulses with rapid rise and brief duration mostly observed in hard X-ray (soft gamma-ray) band. Previous work studied the temporal behavior of some magnetar bursts and employed the Fast Rise Exponential Decay (FRED) model to fit pulses of MXB. However, whether there is other kind of pulse shape has not been explored. In this study, we systematically examined light curve of MXBs from SGR J1935+2154 detected by GECAM between 2021 and 2022. We find that there are different light curve morphologies. Especially, we discover a peculiar and new pattern, Exponential Rise and Cut-Off Decay (ERCOD), which is significantly different from FRED and could be well described by a mathematical function we proposed. We find that MXBs with ERCOD shape are generally longer in duration, brighter in the peak flux, and harder in spectrum. We note that the ERCOD shape is not unique to SGR J1935+2154 but also present in other magnetars. This new light curve pattern may imply a special burst and radiation mechanism of magnetar.

astro-ph.HE↗