arXiv subjects

Dong Wang

Publications and source records attributed to Dong Wang.

At least 199 records · Page 11Linked to original sources

arXiv2025

Issue-Oriented Agent-Based Framework for Automated Review Comment Generation

Code review (CR) is a crucial practice for ensuring software quality. Various automated review comment generation techniques have been proposed to streamline the labor-intensive process. However, existing approaches heavily rely on a single model to identify various issues within the code, limiting the model's ability to handle the diverse, issue-specific nature of code changes and leading to non-informative comments, especially in complex scenarios such as bug fixes. To address these limitations, we propose RevAgent, a novel agent-based issue-oriented framework, decomposes the task into three stages: (1) Generation Stage, where five category-specific commentator agents analyze code changes from distinct issue perspectives and generate candidate comments; (2) Discrimination Stage, where a critic agent selects the most appropriate issue-comment pair; and (3) Training Stage, where all agents are fine-tuned on curated, category-specific data to enhance task specialization. Evaluation results show that RevAgent significantly outperforms state-of-the-art PLM- and LLM-based baselines, with improvements of 12.90\%, 10.87\%, 6.32\%, and 8.57\% on BLEU, ROUGE-L, METEOR, and SBERT, respectively. It also achieves relatively higher accuracy in issue-category identification, particularly for challenging scenarios. Human evaluations further validate the practicality of RevAgent in generating accurate, readable, and context-aware review comments. Moreover, RevAgent delivers a favorable trade-off between performance and efficiency.

cs.SE↗

arXiv2025

Biorthogonal polynomials related to quantum transport theory of disordered wires

We consider the Plancherel-Rotach type asymptotics of the biorthogonal polynomials associated to the biorthogonal ensemble with the joint probability density function \begin{equation*} \frac{1}{C} \prod_{1 \leq i < j \leq n} (λ_j -λ_i)(f(λ_j) - f(λ_i)) \prod^n_{j = 1} W^{(n)}_α(λ_j) dλ_j, \end{equation*} where \begin{align*} f(x) = {}& \sinh^2(\sqrt{x}), & W^{(n)}_α(x) = {}& x^α h(x) e^{-nV(x)}. \end{align*} In the special case that the potential function $V$ is linear, this biorthogonal ensemble arises in the quantum transport theory of disordered wires. We analyze the asymptotic problem via $2$-component vector-valued Riemann-Hilbert problems, and solve it under the one-cut regular with a hard edge condition. We use the asymptotics of biorthogonal polynomials to establish sine universality for the correlation kernel in the bulk, and provide a central limit theorem with a specific variance for holomorphic linear statistics. As an application of our theories, we establish the Ohm's law (1.12) and universal conductance fluctuation (1.13) for the disordered wire model, thereby rigorously confirming predictions from experimental physics [Washburn-Webb86].

math-ph↗

arXiv2025

Hybrid Latent Reasoning via Reinforcement Learning

Recent advances in large language models (LLMs) have introduced latent reasoning as a promising alternative to autoregressive reasoning. By performing internal computation with hidden states from previous steps, latent reasoning benefit from more informative features rather than sampling a discrete chain-of-thought (CoT) path. Yet latent reasoning approaches are often incompatible with LLMs, as their continuous paradigm conflicts with the discrete nature of autoregressive generation. Moreover, these methods rely on CoT traces for training and thus fail to exploit the inherent reasoning patterns of LLMs. In this work, we explore latent reasoning by leveraging the intrinsic capabilities of LLMs via reinforcement learning (RL). To this end, we introduce hybrid reasoning policy optimization (HRPO), an RL-based hybrid latent reasoning approach that (1) integrates prior hidden states into sampled tokens with a learnable gating mechanism, and (2) initializes training with predominantly token embeddings while progressively incorporating more hidden features. This design maintains LLMs' generative capabilities and incentivizes hybrid reasoning using both discrete and continuous representations. In addition, the hybrid HRPO introduces stochasticity into latent reasoning via token sampling, thereby enabling RL-based optimization without requiring CoT trajectories. Extensive evaluations across diverse benchmarks show that HRPO outperforms prior methods in both knowledge- and reasoning-intensive tasks. Furthermore, HRPO-trained LLMs remain interpretable and exhibit intriguing behaviors like cross-lingual patterns and shorter completion lengths, highlighting the potential of our RL-based approach and offer insights for future work in latent reasoning.

cs.CL↗

arXiv2025

Construction of Kondo Chains by Engineering Porphyrin π-Radicals on Au(111)

Quantum manipulation of molecular radical spins provides a crucial platform for exploring emergent phenomena in many-body systems. Here, we combine surface-confined synthesis with scanning tunneling microscopy(STM)tip-induced dehydrogenation to achieve atom-precise engineering of quasi-one-dimensional porphyrin-based Kondo chains (1-7 units) on Au(111). High-resolution STS measurements and low-energy effective modeling collectively demonstrate that π-radicals at each fused-porphyrin unit form Kondo singlets screened by conduction electrons. Adjacent singlets develop direct coherent coupling via quantum-state-overlap-enabled electron tunneling. Crucially, chiral symmetry in the effective model governs zero-mode distribution-present in odd-length chains yet absent in even-length chains-which dictates pronounced odd-even quantum effects in STS spectra of finite chains. Furthermore, the number of parallel porphyrin chains non-monotonically tunes the competition between the Kondo effect and spin exchange, showing opposing trends in strength and demonstrating that both wave-function overlap and the SOMO-LUMO gap collectively govern these interactions. This work simultaneously resolves the dimensional dependence of many-body correlations in confined quantum systems and pioneers approaches for quantum-critical manipulation in molecular spin architectures.

cond-mat.mes-hall↗

arXiv2025

Reasoning through Exploration: A Reinforcement Learning Framework for Robust Function Calling

The effective training of Large Language Models (LLMs) for function calling faces a critical challenge: balancing exploration of complex reasoning paths with stable policy optimization. Standard methods like Supervised Fine-Tuning (SFT) fail to instill robust reasoning, and traditional Reinforcement Learning (RL) struggles with inefficient exploration. We propose \textbf{EGPO}, a new RL framework built upon Group Relative Policy Optimization (GRPO), designed to address this challenge directly. The core of EGPO is an entropy-enhanced advantage function that integrates the entropy of the model's Chain-of-Thought (CoT) into the policy gradient computation. This encourages the generation of diverse reasoning strategies. To maintain optimization direction, the entropy bonus is carefully constrained by a clipping mechanism. Complemented by a strict, binary reward signal, EGPO effectively guides the model towards discovering structured and accurate tool invocation patterns. On the challenging Berkeley Function Calling Leaderboard (BFCL), a 4B-parameter model trained with EGPO sets a new state-of-the-art among models of comparable size, surpassing a range of strong competitors, including GPT-4o and Gemini-2.5.

cs.LG↗

arXiv2025

Trajectory Conditioned Cross-embodiment Skill Transfer

Learning manipulation skills from human demonstration videos presents a promising yet challenging problem, primarily due to the significant embodiment gap between human body and robot manipulators. Existing methods rely on paired datasets or hand-crafted rewards, which limit scalability and generalization. We propose TrajSkill, a framework for Trajectory Conditioned Cross-embodiment Skill Transfer, enabling robots to acquire manipulation skills directly from human demonstration videos. Our key insight is to represent human motions as sparse optical flow trajectories, which serve as embodiment-agnostic motion cues by removing morphological variations while preserving essential dynamics. Conditioned on these trajectories together with visual and textual inputs, TrajSkill jointly synthesizes temporally consistent robot manipulation videos and translates them into executable actions, thereby achieving cross-embodiment skill transfer. Extensive experiments are conducted, and the results on simulation data (MetaWorld) show that TrajSkill reduces FVD by 39.6\% and KVD by 36.6\% compared with the state-of-the-art, and improves cross-embodiment success rate by up to 16.7\%. Real-robot experiments in kitchen manipulation tasks further validate the effectiveness of our approach, demonstrating practical human-to-robot skill transfer across embodiments.

cs.RO↗

arXiv2025

FastUMI-100K: Advancing Data-driven Robotic Manipulation with a Large-scale UMI-style Dataset

Data-driven robotic manipulation learning depends on large-scale, high-quality expert demonstration datasets. However, existing datasets, which primarily rely on human teleoperated robot collection, are limited in terms of scalability, trajectory smoothness, and applicability across different robotic embodiments in real-world environments. In this paper, we present FastUMI-100K, a large-scale UMI-style multimodal demonstration dataset, designed to overcome these limitations and meet the growing complexity of real-world manipulation tasks. Collected by FastUMI, a novel robotic system featuring a modular, hardware-decoupled mechanical design and an integrated lightweight tracking system, FastUMI-100K offers a more scalable, flexible, and adaptable solution to fulfill the diverse requirements of real-world robot demonstration data. Specifically, FastUMI-100K contains over 100K+ demonstration trajectories collected across representative household environments, covering 54 tasks and hundreds of object types. Our dataset integrates multimodal streams, including end-effector states, multi-view wrist-mounted fisheye images and textual annotations. Each trajectory has a length ranging from 120 to 500 frames. Experimental results demonstrate that FastUMI-100K enables high policy success rates across various baseline algorithms, confirming its robustness, adaptability, and real-world applicability for solving complex, dynamic manipulation challenges. The source code and dataset will be released in this link https://github.com/MrKeee/FastUMI-100K.

cs.RO↗

arXiv2025

AerialVG: A Challenging Benchmark for Aerial Visual Grounding by Exploring Positional Relations

Visual grounding (VG) aims to localize target objects in an image based on natural language descriptions. In this paper, we propose AerialVG, a new task focusing on visual grounding from aerial views. Compared to traditional VG, AerialVG poses new challenges, \emph{e.g.}, appearance-based grounding is insufficient to distinguish among multiple visually similar objects, and positional relations should be emphasized. Besides, existing VG models struggle when applied to aerial imagery, where high-resolution images cause significant difficulties. To address these challenges, we introduce the first AerialVG dataset, consisting of 5K real-world aerial images, 50K manually annotated descriptions, and 103K objects. Particularly, each annotation in AerialVG dataset contains multiple target objects annotated with relative spatial relations, requiring models to perform comprehensive spatial reasoning. Furthermore, we propose an innovative model especially for the AerialVG task, where a Hierarchical Cross-Attention is devised to focus on target regions, and a Relation-Aware Grounding module is designed to infer positional relations. Experimental results validate the effectiveness of our dataset and method, highlighting the importance of spatial reasoning in aerial visual grounding. The code and dataset will be released.

cs.CV↗

arXiv2025

AgentTypo: Adaptive Typographic Prompt Injection Attacks against Black-box Multimodal Agents

Multimodal agents built on large vision-language models (LVLMs) are increasingly deployed in open-world settings but remain highly vulnerable to prompt injection, especially through visual inputs. We introduce AgentTypo, a black-box red-teaming framework that mounts adaptive typographic prompt injection by embedding optimized text into webpage images. Our automatic typographic prompt injection (ATPI) algorithm maximizes prompt reconstruction by substituting captioners while minimizing human detectability via a stealth loss, with a Tree-structured Parzen Estimator guiding black-box optimization over text placement, size, and color. To further enhance attack strength, we develop AgentTypo-pro, a multi-LLM system that iteratively refines injection prompts using evaluation feedback and retrieves successful past examples for continual learning. Effective prompts are abstracted into generalizable strategies and stored in a strategy repository, enabling progressive knowledge accumulation and reuse in future attacks. Experiments on the VWA-Adv benchmark across Classifieds, Shopping, and Reddit scenarios show that AgentTypo significantly outperforms the latest image-based attacks such as AgentAttack. On GPT-4o agents, our image-only attack raises the success rate from 0.23 to 0.45, with consistent results across GPT-4V, GPT-4o-mini, Gemini 1.5 Pro, and Claude 3 Opus. In image+text settings, AgentTypo achieves 0.68 ASR, also outperforming the latest baselines. Our findings reveal that AgentTypo poses a practical and potent threat to multimodal agents and highlight the urgent need for effective defense.

cs.CR↗

arXiv2025

Clarifying Semantics of In-Context Examples for Unit Test Generation

Recent advances in large language models (LLMs) have enabled promising performance in unit test generation through in-context learning (ICL). However, the quality of in-context examples significantly influences the effectiveness of generated tests-poorly structured or semantically unclear test examples often lead to suboptimal outputs. In this paper, we propose CLAST, a novel technique that systematically refines unit tests to improve their semantic clarity, thereby enhancing their utility as in-context examples. The approach decomposes complex tests into logically clearer ones and improves semantic clarity through a combination of program analysis and LLM-based rewriting. We evaluated CLAST on four open-source and three industrial projects. The results demonstrate that CLAST largely outperforms UTgen, the state-of-the-art refinement technique, in both preserving test effectiveness and enhancing semantic clarity. Specifically, CLAST fully retains the original effectiveness of unit tests, while UTgen reduces compilation success rate (CSR), pass rate (PR), test coverage (Cov), and mutation score (MS) by an average of 12.90%, 35.82%, 4.65%, and 5.07%, respectively. Over 85.33% of participants in our user study preferred the semantic clarity of CLAST-refined tests. Notably, incorporating CLAST-refined tests as examples effectively improves ICL-based unit test generation approaches such as RAGGen and TELPA, resulting in an average increase of 25.97% in CSR, 28.22% in PR, and 45.99% in Cov for generated tests, compared to incorporating UTgen-refined tests. The insights from the follow-up user study not only reinforce CLAST's potential impact in software testing practice but also illuminate avenues for future research.

cs.SE↗

arXiv2025

Particle-scale origin of quadrupolar non-affine displacement fields in granular solids

In this work, we identify the local structural defects that control the non-affine displacement fields in jammed disk packings subjected to athermal, quasistatic (AQS) simple shear. While complex non-affine displacement fields typically occur during simple shear, isolated effective quadrupoles are also observed and their probability increases with increasing pressure. We show that the emergence of an isolated effective quadrupole requires the breaking of an interparticle contact that is aligned with low-frequency, spatially extended vibrational modes. Since the Eshelby inhomogeneity problem gives rise to quadrupolar displacement fields in continuum materials, we reformulate and implement Eshelby's equivalent inclusion method (EIM) for jammed disk packings. Using EIM, we show that we can reconstruct the non-affine displacement fields for jammed disk packings in response to applied shear as a sum of discrete Eshelby-like defects that are caused by mismatches in the local stiffnesses of triangles formed from Delaunay triangulation of the disk centers.

cond-mat.soft↗

arXiv2025

A Chain-of-thought Reasoning Breast Ultrasound Dataset Covering All Histopathology Categories

Breast ultrasound (BUS) is an essential tool for diagnosing breast lesions, with millions of examinations per year. However, publicly available high-quality BUS benchmarks for AI development are limited in data scale and annotation richness. In this work, we present BUS-CoT, a BUS dataset for chain-of-thought (CoT) reasoning analysis, which contains 11,439 images of 10,019 lesions from 4,838 patients and covers all 99 histopathology types. To facilitate research on incentivizing CoT reasoning, we construct the reasoning processes based on observation, feature, diagnosis and pathology labels, annotated and verified by experienced experts. Moreover, by covering lesions of all histopathology types, we aim to facilitate robust AI systems in rare cases, which can be error-prone in clinical practice.

eess.IV↗

arXiv2025

What Makes You Unique? Attribute Prompt Composition for Object Re-Identification

Object Re-IDentification (ReID) aims to recognize individuals across non-overlapping camera views. While recent advances have achieved remarkable progress, most existing models are constrained to either single-domain or cross-domain scenarios, limiting their real-world applicability. Single-domain models tend to overfit to domain-specific features, whereas cross-domain models often rely on diverse normalization strategies that may inadvertently suppress identity-specific discriminative cues. To address these limitations, we propose an Attribute Prompt Composition (APC) framework, which exploits textual semantics to jointly enhance discrimination and generalization. Specifically, we design an Attribute Prompt Generator (APG) consisting of a Semantic Attribute Dictionary (SAD) and a Prompt Composition Module (PCM). SAD is an over-complete attribute dictionary to provide rich semantic descriptions, while PCM adaptively composes relevant attributes from SAD to generate discriminative attribute-aware features. In addition, motivated by the strong generalization ability of Vision-Language Models (VLM), we propose a Fast-Slow Training Strategy (FSTS) to balance ReID-specific discrimination and generalizable representation learning. Specifically, FSTS adopts a Fast Update Stream (FUS) to rapidly acquire ReID-specific discriminative knowledge and a Slow Update Stream (SUS) to retain the generalizable knowledge inherited from the pre-trained VLM. Through a mutual interaction, the framework effectively focuses on ReID-relevant features while mitigating overfitting. Extensive experiments on both conventional and Domain Generalized (DG) ReID datasets demonstrate that our framework surpasses state-of-the-art methods, exhibiting superior performances in terms of both discrimination and generalization. The source code is available at https://github.com/AWangYQ/APC.

cs.CV↗

arXiv2025

A Mutual Learning Method for Salient Object Detection with intertwined Multi-Supervision--Revised

Though deep learning techniques have made great progress in salient object detection recently, the predicted saliency maps still suffer from incomplete predictions due to the internal complexity of objects and inaccurate boundaries caused by strides in convolution and pooling operations. To alleviate these issues, we propose to train saliency detection networks by exploiting the supervision from not only salient object detection, but also foreground contour detection and edge detection. First, we leverage salient object detection and foreground contour detection tasks in an intertwined manner to generate saliency maps with uniform highlight. Second, the foreground contour and edge detection tasks guide each other simultaneously, thereby leading to precise foreground contour prediction and reducing the local noises for edge prediction. In addition, we develop a novel mutual learning module (MLM) which serves as the building block of our method. Each MLM consists of multiple network branches trained in a mutual learning manner, which improves the performance by a large margin. Extensive experiments on seven challenging datasets demonstrate that the proposed method has delivered state-of-the-art results in both salient object detection and edge detection.

cs.CV↗

arXiv2025

ConCISE: Confidence-guided Compression in Step-by-step Efficient Reasoning

Large Reasoning Models (LRMs) perform strongly in complex reasoning tasks via Chain-of-Thought (CoT) prompting, but often suffer from verbose outputs, increasing computational overhead. Existing fine-tuning-based compression methods either operate post-hoc pruning, risking disruption to reasoning coherence, or rely on sampling-based selection, which fails to remove redundant content thoroughly. To address these limitations, this work begins by framing two key patterns of redundant reflection in LRMs--Confidence Deficit, wherein the model reflects on correct intermediate steps, and Termination Delay, where reflection continues after a verified, confident answer--through a confidence-guided perspective. Based on this, we introduce ConCISE (Confidence-guided Compression In Step-by-step Efficient Reasoning), a framework designed to generate concise reasoning chains, integrating Confidence Injection to boost reasoning confidence, and Early Stopping to terminate reasoning when confidence is sufficient. Extensive experiments demonstrate that compared to baseline methods, fine-tuning LRMs on ConCISE-generated data yields a better balance between compression and task performance, reducing length by up to approximately 50% under SimPO, while maintaining high task accuracy.

cs.LG↗

arXiv2025

Gradient-Free Adversarial Purification with Diffusion Models

Adversarial training and adversarial purification are two widely used defense strategies for enhancing model robustness against adversarial attacks. However, adversarial training requires costly retraining, while adversarial purification often suffers from low efficiency. More critically, existing defenses are primarily designed under the perturbation-based adversarial threat model, which is ineffective against recently introduced unrestricted adversarial attacks. In this paper, we propose an effective and efficient defense framework that counters both perturbation-based and unrestricted adversarial attacks. Our approach is motivated by the observation that adversarial examples typically lie near the decision boundary and are highly sensitive to pixel-level perturbations. To address this, we introduce adversarial anti-aliasing, a preprocessing technique that mitigates adversarial noise by reducing the magnitude of pixel-level perturbations. In addition, we propose adversarial super-resolution, which leverages prior knowledge from clean datasets to benignly restore high-quality images from adversarially degraded ones. Unlike image synthesis methods that generate entirely new images, adversarial super-resolution focuses on image restoration, making it more suitable for purification. Importantly, both techniques require no additional training and are computationally efficient since they do not rely on gradient computations. To further improve robustness across diverse datasets, we introduce a contrastive learning-based adversarial deblurring fine-tuning method. By incorporating adversarial priors during fine-tuning on the target dataset, this method enhances purification effectiveness without the need to retrain diffusion models.

cs.CV↗

arXiv2025

Large-field CO(1-0) observations toward the Galactic historical supernova remnants: shocked molecular clouds toward the Crab Nebula

Using the PMO 13.7m telescope, we present large-field and high-sensitivity CO(1-0) line observations toward the Crab Nebula, in order to better understand the interstellar gas environment of this well-known historical supernova remnant. The CO observations show molecular clouds toward the Crab Nebula at a velocity range from about 0 to 16 km/s. After checking the CO spectra, we find shocked signatures in the clouds extending at a velocity of roughly [5, 11] km/s. These shocked molecular clouds, with an angular distance of about 0.4-0.5 degree toward the Crab Nebula, are located at the shell of a bubble discovered in the GALFA-HI (and HI4PI) images at the same velocity range. The dimension of the bubble is roughly 2.3$\times$2.6 degree and the expansion velocity is about 5 km/s. The kinetic energy referred from the shocked molecular clouds (roughly 3.5$\times$10$^{51}$ erg), together with the HI bubble, support the picture that the Crab Nebula belongs to a typical core-collapse supernova remnant. Nevertheless, due to the large uncertainty in the distance measurement, further observations are needed to verify the physical association between the shocked molecular clouds and the Crab Nebula.

astro-ph.GA↗

arXiv2025

Power-Measurement-Based Channel Estimation for Beyond Diagonal RIS

Beyond diagonal reconfigurable intelligent surface (BD-RIS), with its enhanced degrees of freedom compared to conventional RIS, has demonstrated notable potential for enhancing wireless communication performance. However, a key challenge in employing BD-RIS lies in accurately acquiring its channel state information (CSI) with both the base station (BS) and users. Existing BD-RIS channel estimation methods rely mainly on dedicated pilot signals, which increase system overhead and may be incompatible with current communication protocols. To overcome these limitations, this letter proposes a new single-layer neural network (NN)-enabled channel estimation method utilizing only the easily accessible received power measurements at user terminals. In particular, we show that the received signal power can be expressed in a form similar to a single-layer NN, where the weights represent the BD-RIS's CSI. This structure enables the recovery of CSI using the backward propagation, based on power measurements collected under varying training reflection coefficients. Numerical results show that our proposed method can achieve a small normalized mean square error (NMSE), particularly when the number of training reflections is large.

eess.SP↗