arXiv subjects

Guoqing Wang

Publications and source records attributed to Guoqing Wang.

At least 91 records · Page 5Linked to original sources

arXiv2025

SemCORE: A Semantic-Enhanced Generative Cross-Modal Retrieval Framework with MLLMs

Cross-modal retrieval (CMR) is a fundamental task in multimedia research, focused on retrieving semantically relevant targets across different modalities. While traditional CMR methods match text and image via embedding-based similarity calculations, recent advancements in pre-trained generative models have established generative retrieval as a promising alternative. This paradigm assigns each target a unique identifier and leverages a generative model to directly predict identifiers corresponding to input queries without explicit indexing. Despite its great potential, current generative CMR approaches still face semantic information insufficiency in both identifier construction and generation processes. To address these limitations, we propose a novel unified Semantic-enhanced generative Cross-mOdal REtrieval framework (SemCORE), designed to unleash the semantic understanding capabilities in generative cross-modal retrieval task. Specifically, we first construct a Structured natural language IDentifier (SID) that effectively aligns target identifiers with generative models optimized for natural language comprehension and generation. Furthermore, we introduce a Generative Semantic Verification (GSV) strategy enabling fine-grained target discrimination. Additionally, to the best of our knowledge, SemCORE is the first framework to simultaneously consider both text-to-image and image-to-text retrieval tasks within generative cross-modal retrieval. Extensive experiments demonstrate that our framework outperforms state-of-the-art generative cross-modal retrieval methods. Notably, SemCORE achieves substantial improvements across benchmark datasets, with an average increase of 8.65 points in Recall@1 for text-to-image retrieval.

cs.IR↗

arXiv2025

Quantum sensing with arbitrary frequency resolution via correlation measurements

Achieving high-frequency spectral resolution with quantum sensors, while crucial in fields ranging from physical to biological sciences, is challenging due to their finite coherence time. Here, we introduce a novel protocol that achieves this goal by measuring phase correlations of AC magnetic fields using ensembles of NV centers. Our method extends the sensing dynamic range to frequencies higher than the system's Rabi frequency while achieving arbitrary frequency resolution, limited only by the target field coherence time. Moreover, our approach operates more robustly with respect to the magnetic field's amplitude. Thanks to this robustness, our protocol allows the application of more $π$-pulses in pulse sequences such as CPMG, enabling the decoupling of a broader range of frequency noise. The higher harmonics generated in this process continue to act as a part of the signal, ultimately improving the frequency resolution. This method paves the way for achieving arbitrary frequency resolution with improved performances, making it highly versatile for quantum sensing applications across diverse scientific fields.

quant-ph↗

arXiv2025

Ultra-Low Complexity On-Orbit Compression for Remote Sensing Imagery via Block Modulated Imaging

The growing field of remote sensing faces a challenge: the ever-increasing size and volume of imagery data are exceeding the storage and transmission capabilities of satellite platforms. Efficient compression of remote sensing imagery is a critical solution to alleviate these burdens on satellites. However, existing compression methods are often too computationally expensive for satellites. With the continued advancement of compressed sensing theory, single-pixel imaging emerges as a powerful tool that brings new possibilities for on-orbit image compression. However, it still suffers from prolonged imaging times and the inability to perform high-resolution imaging, hindering its practical application. This paper advances the study of compressed sensing in remote sensing image compression, proposing Block Modulated Imaging (BMI). By requiring only a single exposure, BMI significantly enhances imaging acquisition speeds. Additionally, BMI obviates the need for digital micromirror devices and surpasses limitations in image resolution. Furthermore, we propose a novel decoding network specifically designed to reconstruct images compressed under the BMI framework. Leveraging the gated 3D convolutions and promoting efficient information flow across stages through a Two-Way Cross-Attention module, our decoding network exhibits demonstrably superior reconstruction performance. Extensive experiments conducted on multiple renowned remote sensing datasets unequivocally demonstrate the efficacy of our proposed method. To further validate its practical applicability, we developed and tested a prototype of the BMI-based camera, which has shown promising potential for on-orbit image compression. The code is available at https://github.com/Johnathan218/BMNet.

eess.IV↗

arXiv2025

DSPFusion: Image Fusion via Degradation and Semantic Dual-Prior Guidance

Existing fusion methods are tailored for high-quality images but struggle with degraded images captured under harsh circumstances, thus limiting the practical potential of image fusion. This work presents a \textbf{D}egradation and \textbf{S}emantic \textbf{P}rior dual-guided framework for degraded image \textbf{Fusion} (\textbf{DSPFusion}), utilizing degradation priors and high-quality scene semantic priors restored via diffusion models to guide both information recovery and fusion in a unified model. In specific, it first individually extracts modality-specific degradation priors, while jointly capturing comprehensive low-quality semantic priors. Subsequently, a diffusion model is developed to iteratively restore high-quality semantic priors in a compact latent space, enabling our method to be over $20 \times$ faster than mainstream diffusion model-based image fusion schemes. Finally, the degradation priors and high-quality semantic priors are employed to guide information enhancement and aggregation via the dual-prior guidance and prior-guided fusion modules. Extensive experiments demonstrate that DSPFusion mitigates most typical degradations while integrating complementary context with minimal computational cost, greatly broadening the application scope of image fusion.

cs.CV↗

arXiv2025

Iterative Predictor-Critic Code Decoding for Real-World Image Dehazing

We propose a novel Iterative Predictor-Critic Code Decoding framework for real-world image dehazing, abbreviated as IPC-Dehaze, which leverages the high-quality codebook prior encapsulated in a pre-trained VQGAN. Apart from previous codebook-based methods that rely on one-shot decoding, our method utilizes high-quality codes obtained in the previous iteration to guide the prediction of the Code-Predictor in the subsequent iteration, improving code prediction accuracy and ensuring stable dehazing performance. Our idea stems from the observations that 1) the degradation of hazy images varies with haze density and scene depth, and 2) clear regions play crucial cues in restoring dense haze regions. However, it is non-trivial to progressively refine the obtained codes in subsequent iterations, owing to the difficulty in determining which codes should be retained or replaced at each iteration. Another key insight of our study is to propose Code-Critic to capture interrelations among codes. The Code-Critic is used to evaluate code correlations and then resample a set of codes with the highest mask scores, i.e., a higher score indicates that the code is more likely to be rejected, which helps retain more accurate codes and predict difficult ones. Extensive experiments demonstrate the superiority of our method over state-of-the-art methods in real-world dehazing.

cs.CV↗

arXiv2025

Prompt Alchemy: Automatic Prompt Refinement for Enhancing Code Generation

Code generation has emerged as a key task to automate software development by converting high-level descriptions into executable code. Large language models (LLMs) excel at this but depend heavily on input prompt quality.Manual prompt engineering can be time-consuming and inconsistent, limiting LLM effectiveness. This paper introduces Prochemy, an innovative method for automatically refining prompts to boost code generation. Prochemy overcomes manual prompt limitations by automating optimization, ensuring consistency during inference, and supporting multi-agent systems.It iteratively refines prompts based on model performance, using an optimized final prompt for improved consistency across tasks. We tested Prochemy on natural language-based code generation and translation tasks using three LLM series. Results indicate Prochemy enhances existing methods, improving performance by 5.0% for GPT-3.5-Turbo and 1.9% for GPT-4o over zero-shot baselines on HumanEval. In state-of-the-art LDB, Prochemy + LDB surpasses standalone methods by 1.2-1.8%. For code translation, Prochemy boosts GPT-4o's Java-to-Python (AVATAR) performance from 74.5 to 84.1 (+12.9%) and Python-to-Java from 66.8 to 78.2 (+17.1%). Moreover, Prochemy maintains strong performance when integrated with the o1-mini model, validating its efficacy in code tasks. Designed as plug-and-play, Prochemy optimizes prompts with minimal human input, bridging the gap between simple prompts and complex frameworks.

cs.SE↗

arXiv2025

On Bass' conjecture of the small Davenport constant

Let $G$ be a finite group. The small Davenport constant $\mathsf d(G)$ of $G$ is the maximal integer $\ell$ such that there is a sequence of length $\ell$ over $G$ which has no nonempty product-one subsequence. In 2007, Bass conjectured that $\mathsf d(G_{m,n})=m+n-2$, where $G_{m,n}=\langle x, y| x^m=y^n=1, x^{-1}yx=y^s\rangle$, and $s$ has order $m$ modulo $n$. In this paper, we confirm the conjecture for any group $G_{m,n}$ with additional conditions that $s$ has order $m$ modulo $q$, for every prime divisor $q$ of $n$. Moreover, we solve the associated inverse problem characterizing the structure of any product-one free sequence with extremal length $\mathsf d(G_{m,n})$. Our results generalize some obtained theorems on this problem.

math.CO↗

arXiv2025

Q-SNNs: Quantized Spiking Neural Networks

Brain-inspired Spiking Neural Networks (SNNs) leverage sparse spikes to represent information and process them in an asynchronous event-driven manner, offering an energy-efficient paradigm for the next generation of machine intelligence. However, the current focus within the SNN community prioritizes accuracy optimization through the development of large-scale models, limiting their viability in resource-constrained and low-power edge devices. To address this challenge, we introduce a lightweight and hardware-friendly Quantized SNN (Q-SNN) that applies quantization to both synaptic weights and membrane potentials. By significantly compressing these two key elements, the proposed Q-SNNs substantially reduce both memory usage and computational complexity. Moreover, to prevent the performance degradation caused by this compression, we present a new Weight-Spike Dual Regulation (WS-DR) method inspired by information entropy theory. Experimental evaluations on various datasets, including static and neuromorphic, demonstrate that our Q-SNNs outperform existing methods in terms of both model size and accuracy. These state-of-the-art results in efficiency and efficacy suggest that the proposed method can significantly improve edge intelligent computing.

cs.CV↗

arXiv2025

Structure-Aware Human Body Reshaping with Adaptive Affinity-Graph Network

Given a source portrait, the automatic human body reshaping task aims at editing it to an aesthetic body shape. As the technology has been widely used in media, several methods have been proposed mainly focusing on generating optical flow to warp the body shape. However, those previous works only consider the local transformation of different body parts (arms, torso, and legs), ignoring the global affinity, and limiting the capacity to ensure consistency and quality across the entire body. In this paper, we propose a novel Adaptive Affinity-Graph Network (AAGN), which extracts the global affinity between different body parts to enhance the quality of the generated optical flow. Specifically, our AAGN primarily introduces the following designs: (1) we propose an Adaptive Affinity-Graph (AAG) Block that leverages the characteristic of a fully connected graph. AAG represents different body parts as nodes in an adaptive fully connected graph and captures all the affinities between nodes to obtain a global affinity map. The design could better improve the consistency between body parts. (2) Besides, for high-frequency details are crucial for photo aesthetics, a Body Shape Discriminator (BSD) is designed to extract information from both high-frequency and spatial domain. Particularly, an SRM filter is utilized to extract high-frequency details, which are combined with spatial features as input to the BSD. With this design, BSD guides the Flow Generator (FG) to pay attention to various fine details rather than rigid pixel-level fitting. Extensive experiments conducted on the BR-5K dataset demonstrate that our framework significantly enhances the aesthetic appeal of reshaped photos, surpassing all previous work to achieve state-of-the-art in all evaluation metrics.

cs.CV↗

arXiv2025

Disentangled Modeling of Preferences and Social Influence for Group Recommendation

The group recommendation (GR) aims to suggest items for a group of users in social networks. Existing work typically considers individual preferences as the sole factor in aggregating group preferences. Actually, social influence is also an important factor in modeling users' contributions to the final group decision. However, existing methods either neglect the social influence of individual members or bundle preferences and social influence together as a unified representation. As a result, these models emphasize the preferences of the majority within the group rather than the actual interaction items, which we refer to as the preference bias issue in GR. Moreover, the self-supervised learning (SSL) strategies they designed to address the issue of group data sparsity fail to account for users' contextual social weights when regulating group representations, leading to suboptimal results. To tackle these issues, we propose a novel model based on Disentangled Modeling of Preferences and Social Influence for Group Recommendation (DisRec). Concretely, we first design a user-level disentangling network to disentangle the preferences and social influence of group members with separate embedding propagation schemes based on (hyper)graph convolution networks. We then introduce a socialbased contrastive learning strategy, selectively excluding user nodes based on their social importance to enhance group representations and alleviate the group-level data sparsity issue. The experimental results demonstrate that our model significantly outperforms state-of-the-art methods on two realworld datasets.

cs.IR↗

arXiv2025

Automatically Learning a Precise Measurement for Fault Diagnosis Capability of Test Cases

Prevalent Fault Localization (FL) techniques rely on tests to localize buggy program elements. Tests could be treated as fuel to further boost FL by providing more debugging information. Therefore, it is highly valuable to measure the Fault Diagnosis Capability (FDC) of a test for diagnosing faults, so as to select or generate tests to better help FL. To this end, researchers have proposed many FDC metrics, which serve as the selection criterion in FL-oriented test selection or the fitness function in FL-oriented test generation. Existing FDC metrics can be classified into result-agnostic and result-aware metrics depending on whether they take test results (i.e., passing or failing) as input. Although result-aware metrics perform better in test selection, they have restricted applications due to the input of test results, e.g., they cannot be applied to guide test generation. Moreover, all the existing FDC metrics are designed based on some predefined heuristics and have achieved limited FL performance due to their inaccuracy. To address these issues, in this paper, we reconsider result-agnostic metrics, and propose a novel result-agnostic metric RLFDC which predicts FDC values of tests through reinforcement learning. In particular, we treat FL results as reward signals, and train an FDC prediction model with the direct FL feedback to automatically learn a more accurate measurement rather than design one based on predefined heuristics. Finally, we evaluate the proposed RLFDC on Defects4J by applying the studied metrics to test selection and generation. According to the experimental results, the proposed RLFDC outperforms all the result-agnostic metrics in both test selection and generation.

cs.SE↗

arXiv2024

Quantum Frequency Mixing using an N-$V$ Diamond Microscope

Wide-field magnetic microscopy using nitrogen-vacancy (NV) centers in diamond can yield high-quality magnetic images of DC and AC magnetic fields. The unique combination of micron-scale spatial resolution of scalar or vector fields at room temperature and parallel camera readout make this an appealing technique for applications in biology, geology, condensed-matter physics, and electronics. However, while NV magnetic microscopy has achieved great success in these areas, historically the accessible frequency range has been limited. In this paper, we overcome this limitation by implementing the recently developed technique of quantum frequency mixing. With this approach, we generate wide-field magnetic images of test structures driven by alternating currents up to 70 MHz, well outside the reach of DC and Rabi magnetometry methods. With further improvements, this approach could find utility in hyperspectral imaging for electronics power spectrum analysis, electronics diagnostics and troubleshooting, and quantum computing hardware validation.

physics.ins-det↗

arXiv2024

Non-Hermitian Spin-Spin Interaction Mediated by Chiral Phonons

Non-Hermiticity and chirality are two fundamental properties known to give rise to various intriguing phenomena. However, the interplay between these properties has been rarely explored. In this work, we bridge this gap by introducing an off-diagonal non-Hermitian spin-spin interaction mediated by chiral phonons. This interaction arises from the spin-selectivity due to the locking between phonon momentum and angular momentum in chiral materials. The resulting non-Hermitian interaction mediated by the vacuum field of chiral phonons can reach the kHz range for electron spins and can be further enhanced by externally driven mechanical waves, potentially leading to observable effects in the quantum regime. Moreover, the long-range nature of phonon-mediated interactions enables the realization of the long-desired non-Hermitian interaction among multiple spins. The effect proposed in this work may have wide-ranging applications in cascaded quantum systems, non-Hermitian many-body physics, and non-Hermitian cooling.

quant-ph↗

arXiv2024

Cavity-enabled real-time observation of individual atomic collisions

Using the strong dispersive coupling to a high-cooperativity cavity, we demonstrate fast and non-destructive number-resolved detection of atoms in optical tweezers. We observe individual atom-atom collisions, quantum state jumps, and atom loss events with a time resolution of $100\ μ$s through continuous measurement of cavity transmission. Using adaptive feedback control in combination with the non-destructive measurements, we further prepare a single atom with $92(2)\%$ probability.

quant-ph↗

arXiv2024

Physics-Informed Neural Networks with Complementary Soft and Hard Constraints for Solving Complex Boundary Navier-Stokes Equations

Soft- and hard-constrained Physics Informed Neural Networks (PINNs) have achieved great success in solving partial differential equations (PDEs). However, these methods still face great challenges when solving the Navier-Stokes equations (NSEs) with complex boundary conditions. To address these challenges, this paper introduces a novel complementary scheme combining soft and hard constraint PINN methods. The soft-constrained part is thus formulated to obtain the preliminary results with a lighter training burden, upon which refined results are then achieved using a more sophisticated hard-constrained mechanism with a primary network and a distance metric network. Specifically, the soft-constrained part focuses on boundary points, while the primary network emphasizes inner domain points, primarily through PDE loss. Additionally, the novel distance metric network is proposed to predict the power function of the distance from a point to the boundaries, which serves as the weighting factor for the first two components. This approach ensures accurate predictions for both boundary and inner domain areas. The effectiveness of the proposed method on the NSEs problem with complex boundary conditions is demonstrated by solving a 2D cylinder wake problem and a 2D blocked cavity flow with a segmented inlet problem, achieving significantly higher accuracy compared to traditional soft- and hard-constrained PINN approaches. Given PINN's inherent advantages in solving the inverse and the large-scale problems, which are challenging for traditional computational fluid dynamics (CFD) methods, this approach holds promise for the inverse design of required flow fields by specifically-designed boundary conditions and the reconstruction of large-scale flow fields by adding a limited number of training input points. The code for our approach will be made publicly available.

physics.flu-dyn↗

arXiv2024

Do Advanced Language Models Eliminate the Need for Prompt Engineering in Software Engineering?

Large Language Models (LLMs) have significantly advanced software engineering (SE) tasks, with prompt engineering techniques enhancing their performance in code-related areas. However, the rapid development of foundational LLMs such as the non-reasoning model GPT-4o and the reasoning model o1 raises questions about the continued effectiveness of these prompt engineering techniques. This paper presents an extensive empirical study that reevaluates various prompt engineering techniques within the context of these advanced LLMs. Focusing on three representative SE tasks, i.e., code generation, code translation, and code summarization, we assess whether prompt engineering techniques still yield improvements with advanced models, the actual effectiveness of reasoning models compared to non-reasoning models, and whether the benefits of using these advanced models justify their increased costs. Our findings reveal that prompt engineering techniques developed for earlier LLMs may provide diminished benefits or even hinder performance when applied to advanced models. In reasoning LLMs, the ability of sophisticated built-in reasoning reduces the impact of complex prompts, sometimes making simple zero-shot prompting more effective. Furthermore, while reasoning models outperform non-reasoning models in tasks requiring complex reasoning, they offer minimal advantages in tasks that do not need reasoning and may incur unnecessary costs. Based on our study, we provide practical guidance for practitioners on selecting appropriate prompt engineering techniques and foundational LLMs, considering factors such as task requirements, operational costs, and environmental impact. Our work contributes to a deeper understanding of effectively harnessing advanced LLMs in SE tasks, informing future research and application development.

cs.SE↗

arXiv2024

The universal zero-sum invariant and weighted zero-sum for infinite abelian groups

Let $G$ be an abelian group, and let $\mathcal F (G)$ be the free commutative monoid with basis $G$. For $Ω\subset \mathcal F (G)$, define the universal zero-sum invariant ${\mathsf d}_Ω(G)$ to be the smallest integer $\ell$ such that every sequence $T$ over $G$ of length $\ell$ has a subsequence in $Ω$. The invariant ${\mathsf d}_Ω(G)$ unifies many classical zero-sum invariants. Let $\mathcal B (G)$ be the submonoid of $\mathcal F (G)$ consisting of all zero-sum sequences over $G$, and let $\mathcal A (G)$ be the set consisting of all minimal zero-sum sequences over $G$. In this paper, we show that except for a few special classes of groups, there always exists a proper subset $Ω$ of $\mathcal A (G)$ such that ${\mathsf d}_Ω(G)={\rm D}(G)$. Furthermore, in the setting of finite cyclic groups, we discuss the distributions of all minimal sets by determining their intersections. By connecting the universal zero-sum invariant with weights, we make a study of zero-sum problems in the setting of {\sl infinite} abelian groups. The universal zero-sum invariant ${\mathsf d}_{Ω; Ψ}(G)$ with weights set $Ψ$ of homomorphisms of groups is introduced for all abelian groups. The weighted Davenport constant ${\rm D}_Ψ(G)$ (being an special form of the universal invariant with weights) is also investigated for infinite abelian groups. Among other results, we obtain the necessary and sufficient conditions such that ${\rm D}_Ψ(G)<\infty$ in terms of the weights set $Ψ$ when $|Ψ|$ is finite. In doing this, by using the Neumann Theorem on Cover Theory for groups we establish a connection between the existence of a finite cover of an abelian group $G$ by cosets of some given subgroups of $G$, and the finiteness of weighted Davenport constant.

math.CO↗

arXiv2024

Goal-Reaching Policy Learning from Non-Expert Observations via Effective Subgoal Guidance

In this work, we address the challenging problem of long-horizon goal-reaching policy learning from non-expert, action-free observation data. Unlike fully labeled expert data, our data is more accessible and avoids the costly process of action labeling. Additionally, compared to online learning, which often involves aimless exploration, our data provides useful guidance for more efficient exploration. To achieve our goal, we propose a novel subgoal guidance learning strategy. The motivation behind this strategy is that long-horizon goals offer limited guidance for efficient exploration and accurate state transition. We develop a diffusion strategy-based high-level policy to generate reasonable subgoals as waypoints, preferring states that more easily lead to the final goal. Additionally, we learn state-goal value functions to encourage efficient subgoal reaching. These two components naturally integrate into the off-policy actor-critic framework, enabling efficient goal attainment through informative exploration. We evaluate our method on complex robotic navigation and manipulation tasks, demonstrating a significant performance advantage over existing methods. Our ablation study further shows that our method is robust to observation data with various corruptions.

cs.LG↗