arXiv subjects

Dong Wang

Publications and source records attributed to Dong Wang.

At least 73 records · Page 4Linked to original sources

arXiv2026

Dynamical redistribution of quantum resources in tree-level Bhabha scattering

The fundamental interactions governed by quantum electrodynamics (QED) are intrinsically rich in quantum resources, yet how these resources dynamically redistribute during relativistic scattering is still not fully understood. In this work, we systematically investigate the tree-level Bhabha scattering process (e^- e^+ \rightarrow e^- e^+) within the framework of quantum resource theory, revealing how QED kinematics and Feynman amplitudes strictly dictate resource redistribution. Specifically, we demonstrate a strict anti-correlation between entropic uncertainty and dynamically generated entanglement across diverse initial states. We find that mass-induced single-helicity-flip transitions cause a pronounced geometric symmetry breaking in the non-relativistic regime, whereas the restoration of chiral symmetry in the ultra-relativistic limit ensures strict symmetry about the backward scattering angle. Furthermore, we analytically establish a rigorous equivalence between local wave-particle duality and global bipartite quantum coherence. Finally, evaluating the trade-off between local duality and Bell nonlocality, we show that in the ultra-relativistic limit, transverse scattering of basic factorized states equalizes the s- and t-channel amplitudes to optimize non-local correlations. However, pre-existing local coherence inevitably disrupts this delicate kinematic balance, significantly suppressing the Bell parameter and preventing the maximal violation of local realism. Therefore, we believe the present results provide deeper understanding of the fundamental quantum nature of QED processes.

quant-ph↗

arXiv2026

A weighted quantile filter based framework for interface optimal design problems

We present a robust and efficient numerical framework based on a median filter scheme for solving a broad class of interface optimal design problems, from image segmentation to topology optimization. A key innovation of our work is the extension of the binary scheme into a level-set scheme via a weighted quantile interpretation. Unlike traditional binary iterative convolution-thresholding method (ICTM), this continuous weighted quantile filter scheme effectively overcomes the pinning effect caused by spatial discretization, achieving interface evolution even with small time steps. We also provide a rigorous theoretical analysis, proving the unconditional energy stability of the iterative scheme. Furthermore, we prove that for a wide class of data fidelity terms, the convex relaxation inherently enforces a binary solution, justifying the effectiveness of the method without explicit penalization. Numerical experiments on the Chan--Vese model, the local intensity fitting (LIF) model, and topology optimization in Stokes flow demonstrate that the proposed efficient continuous framework effectively eliminates the pinning effect, guarantees unconditional energy stability, and accurately converges to binary solutions.

math.NA↗

arXiv2026

Structured generalized sliced Wasserstein distance for keV X-ray polarization analysis with Gas Pixel Detector

Because of the special angular distribution of excited electrons by the photoelectric effect, the Gas Pixel Detector (GPD) is effective in measuring keV X-ray polarization of astrophysical events (e.g. gamma-ray bursts), by capturing ionization tracks of excited electrons as polarized images. Traditionally, the emission angles of photoelectrons are extracted from polarized images first, and statistics are then performed on these angles to infer the polarization direction and intensity. However, observation with the wide field of view requires the incident angle of X-rays not directly attainable through the traditional analysis process. In this paper, we propose using the generalized sliced Wasserstein (GSW) distance, projected by neural networks with random weights, as a completely data-driven approach to analyze X-ray polarization based on two-dimensional polarized images. We find the structures of the randomized neural networks matter when focusing on different aspects of the polarized images, and take advantage of the discrimination abilities by different neural network structures. The proposed method, named the structured GSW distance, successfully distinguishes polarized images with different configurations of incident angles and polarization directions. Furthermore, we build a simplified statistical model based on the von Mises distribution and the circular Wasserstein distance and compare the model against the proposed method, showing their high consistency. The computational method reported in this paper may benefit GPD-based polarimetry in astroparticle experiments and also pattern analysis on raw data from pixel detectors.

physics.data-an↗

arXiv2026

Eigenvector distribution of random matrices under critical finite-rank deformations

We investigate the eigenvector distribution at the soft edge for Gaussian random matrices with finite-rank deformations, in the critical regime of BBP transition. For finite-rank deformations of the GOE and GUE with critical spikes, we find that the squared overlap between a leading eigenvector and a spike, rescaled by $N^{1/3}$, converges weakly to the negative reciprocal of the derivative of an Airy-Green function evaluated at the corresponding soft-edge root. For the rank-one critically spiked Gaussian $β$-ensemble, $β>0$, we obtain an analogous result involving an Airy-Green function. In both cases, the Airy-Green functions are generalizations of the one introduced by Bykhovskaya--Gorin--Sodin \cite{Bykhovskaya-Gorin-Sodin25}. The proofs are both based on an eigenvector--eigenvalue identity and a resolvent-differentiation mechanism.

math.PR↗

arXiv2026

Uncertainty-Aware Variational Reward Factorization via Probabilistic Preference Bases for LLM Personalization

Reward factorization personalizes large language models (LLMs) by decomposing rewards into shared basis functions and user-specific weights. Yet, existing methods estimate user weights from scarce data in isolation and as deterministic points, leading to inaccurate and unreliable inference. We introduce Variational Reward Factorization (VRF), an uncertainty-aware framework that represents each user's preferences as a variational distribution in a shared preference space. VRF infers user distributions via a variational encoder, derives weights through Wasserstein distance matching with shared probabilistic bases, and downweights uncertain estimates through a variance-attenuated loss. On three benchmarks, VRF outperforms all baselines across seen and unseen users, few-shot scenarios, and varying uncertainty levels, with gains extending to downstream alignment. Our code is available at https://github.com/Gyu-Seok-Lee/VRF_COLM26.

cs.CL↗

arXiv2026

AnyTrack: Unifying Visual Object Tracking with Any Modalities

Visual object tracking aims to continuously locate specific targets within sequential frames, evolving from single-modal methods to multi-modal ones. However, existing multi-modal trackers are typically designed for fixed modality combinations, requiring separate models for different inputs. This leads to a poor adaptability to missing or imperfect modalities, and limited generalization. To address these issues, we propose a novel unified framework called AnyTrack for object tracking with any modalities. Specifically, we design a Modality-aware Interaction Module (MIM) to facilitate dynamic interaction across diverse modalities. This module bridges modality discrepancies and aggregates temporal cues to maintain spatio-temporal consistency during cross-modal interaction. Furthermore, we introduce a Context Understanding Module (CUM) to establish spatial correspondence between visual features and target locations via global-local prompts. This module employs target-aware context modeling to enhance foreground-background discrimination for precise localization. Finally, to support the training and evaluation under diverse modalities, we extend existing multi-modal object tracking benchmarks by incorporating grayscale images, language descriptions, and audio clips. Extensive experiments with both complete and missing modality settings demonstrate that our AnyTrack achieves state-of-the-art performance, validating its effectiveness and flexibility. The source code is available at https://github.com/IdolLab/AnyTrack.

cs.CV↗

arXiv2026

Agent-Based Test Assertion Generation via Diverse Perspective Aggregation

Test assertions are critical elements of unit tests, serving as checkpoints to validate expected behavior and ensure software correctness. Numerous techniques have been proposed to automate assertion generation, with recent progress notably driven by large language models (LLMs). Despite the promise, existing approaches such as ChatAssert suffer from modest accuracy, heavy reliance on oversampling, and vulnerability to model randomness due to one-shot prompting. To address these limitations, we propose AssertMate, a novel agent-based assertion generation framework that enhances the quality and reliability of LLM-generated assertions through three key components: (1) actual value construction that identifies assertion targets via static analysis and type-aware heuristics; (2) multi-perspective expected value prediction using code generation, retrieval-augmented generation (RAG), and chain-of-thought (CoT) reasoning agents; and (3) an LLM-as-a-Judge collaboration mechanism to select the most appropriate assertion. Evaluation on the Defects4J benchmark demonstrates that AssertMate significantly outperforms state-of-the-art techniques in compilation success and pass rates, along with substantially higher bug detection capabilities. Integration with EvoSuite further validates AssertMate's practicality, yielding superior mutation coverage and kill counts. Ablation studies reveal that each of the three components makes a significant and complementary contribution to the overall performance. This work affirms the great potential of aggregating diverse perspectives to enhance the effectiveness of LLM-based assertion generation.

cs.SE↗

arXiv2026

Reinforcement-Learned Electric-Field Sensing with Asymmetrically Blockaded Rydberg Arrays

We present a reinforcement learning-optimized Rydberg electrometer based on the asymmetric blockade effect and achieve high-sensitivity electric field sensing in Rydberg arrays. Microwave dressing induces asymmetric blockade to suppress interactions between target atoms, while keeping the coupling between the central control atom and target atoms field-tunable near Förster resonance. The field-regulated blockade radius affects the detectable atomic population signals, thereby enabling electric field sensing via state-selective readout. In planar atomic arrays, classical Fisher information exhibits near-quadratic scaling with atom number and approaches the Heisenberg limit. Reinforcement learning-designed composite pulses greatly enhance quantum Fisher information by up to one order of magnitude compared with single $π$ pulses. We further establish a compact six-atom spherical configuration for vector electrometry, in which field orientation is extracted from calibrated axial populations, and weak bias fields eliminate dipole-dipole-induced sign and magic-angle ambiguities. Numerical tests against Rabi frequency deviation, positional error, residual inter-target coupling and projection noise demonstrate the reliability of this scheme. This work provides an experimentally viable approach to realize high-precision three-dimensional Rydberg electric field sensing.

quant-ph↗

arXiv2026

Transducer leakage error suppression using invariant-based shortcut

We present a method for suppressing transducer leakage errors in spin-superconducting hybrid quantum systems with the theory of optimal invariant-based shortcut. By mediated virtual photons as a transducer to exchange the energy between the spin qubit and a transmon qubit, the fidelity of the population of the final state features a broad range above 99\% under the influence of leakage error. The leakage probability from computational subspace to non-computational subspace can be effectively suppressed at a lowest value with $0.01$. Based on the optimized pulse control designed by the invariant-based inverse engineering, the high-fidelity quantum iSWAP gate operations and entanglement state preparation within the computational subspace are achieved. {Compared to the traditional $π$ pulse, derivative removal by adiabatic gate, counter-diabatic shortcut schemes, and limited-memory Broyden-Fletcher-Goldfarb-Shanno gradient ascent pulse engineering, the optimized shortcut scheme can still achieve a high fidelity with 99\% in the presence of decoherence and control error.} When taking into account the possibility of leakage errors in actual situations, our solution can still largely resist the influence of control errors. The results provides a feasible path for precisely manipulating the quantum state of hybrid quantum systems.

quant-ph↗

arXiv2026

Deep Learning-Based Estimation of Ground Reaction Forces in Parkinsonian Gait Using an Optimized Set of IMU Data

Accurate gait analysis in Parkinson's disease (PD) typically relies on laboratory-based systems to capture biomechanical data, such as ground reaction forces (GRFs). Estimating GRFs using inertial measurement units (IMUs) provides a feasible alternative. However, this approach remains challenging in pathological gait like PD due to its high variability and complexity. Moreover, existing monitoring approaches often require multiple body-mounted sensors, which limit practicality and reduce patient compliance. To date, no study has investigated the application of deep learning approaches to address this challenge. This study proposes, for the first time, a deep learning framework to estimate bilateral vertical GRFs (vGRFs) in PD using an optimized set of wearable IMUs. A hybrid CNN-BiLSTM model was trained separately on data from 61 PD patients and 65 healthy controls (HC) using 13 IMUs. The model achieved high intra-subject accuracy ($R^2$ = 0.98) and strong inter-subject generalization ($R^2$ = 0.93 for HC, $R^2$ = 0.91 for PD). Sensor configuration was found to significantly influence estimation accuracy, with optimal sensor placement varying between PD patients and HC. For PD patients, estimation accuracy dropped markedly when reducing to a single IMU. The optimal configuration for PD used four IMUs. We identified a minimal setup with only two IMUs still enabled robust estimation. This compact setup offers a practical and scalable solution. Overall, the proposed approach supports the development of wearable vGRF-based gait analysis systems for Parkinsonian gait and potentially other pathological conditions, enabling accessible clinical assessments, remote monitoring, and personalized rehabilitation.

cs.LG↗

arXiv2026

Evaluating Fuzz Testing for Reinforcement Learning Agents

Reinforcement Learning (RL) agents are increasingly deployed in safety-critical domains such as robotics, autonomous driving, and drone control, where unexpected behaviors may lead to severe real-world consequences. Fuzz testing has recently emerged as a promising method for exploring the vast state spaces of RL agents and exposing crashes. Although numerous RL fuzzing methods have been proposed, existing studies often differ in evaluation settings, baselines, and metrics, making it difficult to draw reliable conclusions about their relative effectiveness and practical usefulness. To address this gap, we present the first comprehensive empirical study that systematically evaluates RL fuzzing methods from four complementary perspectives: effectiveness, diversity, efficiency, and practical utility. We benchmark five state-of-the-art methods alongside random testing under unified configurations across three environments of increasing complexity (MountainCar, BipedalWalker, and CARLA), and further assess the downstream usefulness of detected crashes for agent robustness improvement and safety monitoring. Our results reveal several key insights. For instance,throughput-oriented methods like MDPFuzz demonstrate superior effectiveness and efficiency in crash discovery, while methods explicitly designed to encourage exploration like SeqDivFuzz excel at uncovering diverse crash behaviors. We also show that fuzzing-generated crashes can meaningfully improve agent robustness and enable accurate safety monitoring with strong cross-method generalization. Beyond these empirical findings, we distill actionable guidance for both researchers and practitioners, highlighting the benefits of combining complementary fuzzing strategies and adopting multi-level diversity analysis to achieve more comprehensive and practical RL testing.

cs.LG↗

arXiv2026

A generalized matrix-valued Allen--Cahn model and its numerical solution

This paper introduces a generalized matrix-valued Allen--Cahn model, where the unknown matrix-valued field belongs to $\mathbb{R}^{m_1\times m_2}$ with dimension $m_1\geq m_2$. By taking different values of $m_1$ and $m_2$, this model covers the classical scalar-valued, vector-valued, and square-matrix-valued Allen--Cahn equations. At the continuous level, the proposed model is proven to admit a unique solution satisfying the maximum bound principle (MBP) and the energy dissipation law. At the discrete level, a class of arbitrarily high-order exponential time differencing Runge-Kutta (ETDRK) schemes is investigated that preserve the MBP unconditionally. Moreover, we prove that the first- and second-order ETDRK schemes satisfy the discrete energy dissipation unconditionally, while third- and higher-order schemes preserve the discrete energy dissipation under suitable time-step constraints. The proof of sharp convergence order in time is provided. Numerical experiments are carried out to confirm our theoretical results.

math.NA↗

arXiv2026

Maximal Fisher Budget Forces Blind Directions in Bipartite Collective SU(d) Metrology

For pure two-qudit probes used in a single fixed setting to estimate a common SU(d) transformation, maximal total Fisher sensitivity and full local identifiability are mutually exclusive. We derive exact identities that determine the trace of the quantum Fisher information matrix from two measurable probe properties: exchange symmetry and collective polarization. Every maximizer is exchange symmetric and maximally entangled. Its Fisher matrix has equal sensitivity in every visible direction, while $d(d-1)/2$ generator directions are blind. More generally, weak compatibility, defined by vanishing mean generator commutators, forces at least $\lfloor d/2\rfloor$ blind directions for every pure bipartite probe. A probe-defined antiunitary invariant classifies the complete Fisher spectrum at maximal entanglement, and approaches to the optimum that preserve exchange symmetry have a divergent Holevo cost. The bipartite obstruction is sharp in particle number: for $N\geq 3$, generalized GHZ probes can satisfy weak compatibility, attain the corresponding $N$-partite Fisher trace bound, and retain full local identifiability. Hence, Fisher sensitivity, weak compatibility, identifiability, and attainable precision are distinct resources in quantum metrology with noncommuting generators.

quant-ph↗

arXiv2026

Context Matters: Improving the Practical Reliability of LLM-Based Unit Test Generation

Automated unit test generation has recently benefited from advances in large language models (LLMs), yet our industrial deployments reveal a persistent gap between promising research results and practical usability. In real-world projects with complex frameworks and cross-file dependencies, LLM-generated tests frequently fail to compile, require costly manual repair, or provide unstable coverage improvements. This paper reports our experience in designing, deploying, and evaluating CATGen, a context-aware workflow for LLM-based unit test generation, informed by repeated industrial failures and refinements. Rather than relying on LLMs to infer incomplete project context, we found that compilation robustness critically depends on making project-level dependencies explicit, stabilizing test class scaffolding, and replacing iterative LLM-based repair with lightweight static analysis. These experience-driven insights shaped CATGen's multi-stage design, which combines structured context retrieval, deterministic test skeleton construction, and program analysis-based post-processing. We evaluate CATGen on real-world complex focal methods from proprietary industrial projects and additionally on the Defects4J benchmark to assess generalizability. Across both settings, CATGen substantially improves compilation success and structural coverage while significantly reducing generation time and token consumption compared to existing LLM-based approaches. Our results demonstrate that reliable LLM-based unit test generation in practice depends less on prompt engineering alone and more on systematic engineering support grounded in real-world development constraints.

cs.SE↗

arXiv2026

Dr. Zero: Self-Evolving Search Agents without Training Data

As high-quality data becomes increasingly difficult to obtain, self-evolution without curated training data has emerged as a promising paradigm. This approach allows large language models (LLMs) to autonomously generate and solve complex problems, thereby improving their reasoning capabilities. However, multi-turn search agents struggle in this setting due to limited question diversity and the substantial compute required for multi-step reasoning and tool use. In this work, we introduce Dr. Zero, a framework that enables search agents to effectively self-evolve without human-annotated training data, relying solely on an external search engine as their knowledge environment. In particular, we design a self-evolution feedback loop where a proposer generates structurally diverse questions to train a solver initialized from the same base model. As the solver evolves, it incentivizes the proposer to produce increasingly difficult yet solvable tasks, thus establishing an automated curriculum to refine both agents. To enhance training efficiency, we also introduce hop-grouped relative policy optimization (HRPO). This method clusters structurally similar questions to construct group-level baselines, effectively minimizing the sampling overhead in evaluating each query's individual difficulty and solvability. Consequently, HRPO significantly reduces the compute requirements for proposer training and reward estimation without compromising performance or stability. Extensive experimental results demonstrate that Dr. Zero matches or surpasses fully supervised search agents on several question answering benchmarks, showing that strong agentic search and evidence-grounded reasoning can emerge solely through self-evolution.

cs.AI↗

arXiv2026

Topology-Aware Tokenization for Generative Recommendation

Generative recommendation reformulates sequential recommendation as an autoregressive generation task, yet a critical issue in this paradigm remains overlooked: topology distortion in item tokenization. In particular, we observe that the intrinsic adjacency relationships of items in the pretrained semantic embedding space are significantly disrupted after quantization. This topology distortion misleads the model's perception of item similarity, ultimately bottlenecking the accuracy of generative recommendations. To address this issue, we propose Topology-Aware Tokenization (TopoTok), an item tokenization framework that preserves item relational structure throughout the quantization hierarchy. Different from the prior monolithic supervision in tokenization, TopoTok introduces a multi-level distillation scheme to progressively recover the topology from coarse to fine granularity: 1) Inter-Group Distillation to capture global cluster-wise relations; 2) Intra-Group Distillation to refine local structures within semantic clusters; and 3) Inter-Item Distillation to enforce fine-grained alignment at the individual item level. Extensive experiments on three benchmark datasets demonstrate that TopoTok effectively alleviates topology distortion and consistently outperforms state-of-the-art tokenizers, achieving significant performance gains of up to 9.42% in Recall@5.

cs.IR↗

arXiv2026

KernelDiag: Agent-Based Root Cause Diagnosis for Kernel Crashes

The Linux kernel is one of the most complex software systems, where automated fuzzing continuously exposes thousands of crashes, yet root-cause diagnosis remains a manual and time-consuming bottleneck. Existing LLM-based root cause analysis (RCA) techniques, effective for distributed systems, do not readily generalize to kernel debugging due to sparse low-level artifacts, heterogeneous diagnostic evidence (e.g., syscalls, logs, and crash reports), and complex non-linear fault propagation that demands fine-grained method-level reasoning. To address these challenges, we propose KernelDiag, an agent-based framework for kernel root-cause diagnosis via structured causal reasoning. KernelDiag first aligns heterogeneous diagnostic artifacts through log-to-code mapping, and then employs artifact-specialized agents to iteratively reason over source-level program semantics and crash-specific kernel configurations. The inferred causal dependencies are incrementally organized into structured Evidence Graphs, enabling accurate faulty-method localization and causal explanations. We evaluate KernelDiag on the real-world KGYM benchmark. KernelDiag consistently outperforms state-of-the-art localization approaches at both file and method levels, achieving significant improvements in Top@k accuracy, including up to 4x and 2x gains in challenging settings without explicit hints. Furthermore, both human and LLM-assisted evaluations show that KernelDiag generates accurate, coherent, and actionable diagnostic explanations. Overall, this work lays the foundation for automated kernel root-cause diagnosis by bridging low-level diagnostic evidence with source-level causal reasoning.

cs.SE↗

arXiv2026

Global well-posedness of strong solutions to a model for the morning glory cloud

In this paper, we investigate the global well-posedness of strong solution to a model recently derived by Constantin-Johnson \cite{CaJo} which describes the nonlinear wave propagation in the troposphere, especially for the morning glory cloud. Assuming that the initial velocity $v_0\in H^1$ and the thermodynamic forcing term $K\in L^2(0,T;L^2)$, we show that there exists a unique global strong solution to the initial boundary value problem of this system. Similar result was only known before for sufficiently small initial data in the existing literature.

math.AP↗