arXiv subjects

Yuan Fu

Publications and source records attributed to Yuan Fu.

5 recordsLinked to original sources

arXiv2026

DCGL: Dual-Channel Graph Learning with Large Language Models for Knowledge-Aware Recommendation

Knowledge Graphs (KGs) have proven highly effective for recommendation systems by capturing latent item relationships, while recent integration of Large Language Models (LLMs) has further enhanced semantic understanding and addressed knowledge sparsity issues. Nevertheless, current KG-and-LLM-based methods still face three main limitations: 1) inadequate modeling of implicit semantic relationships beyond explicit KG links; 2) suboptimal single-channel fusion of ID and LLM embeddings, which often leads to signal interference and blurred representations; and 3) insufficient consideration of user-item interaction frequency variations in recommendation strategies. To address these challenges, we propose the Dual-Channel Graph Learning (DCGL) framework, featuring three key innovations: 1) a dual-channel architecture that structurally decouples rich semantic information from user behavioral patterns, preventing early interference; 2) a multi-level contrastive learning mechanism that enhances robustness against KG noise through intra-view contrasts and bridges semantic gaps between channels via inter-view alignment; and 3) a dynamic fusion mechanism that adaptively balances semantic generalization and behavioral specificity based on interaction frequency, resolving the cascading limitation. Extensive experiments on four real-world datasets show that DCGL consistently outperforms state-of-the-art methods, yielding substantial improvements in sparse scenarios while maintaining precision for active users. Our code is available at https://github.com/XinchiZou/DCGL.

cs.IR↗

arXiv2026

Time-Interval-Aware Disentangled Expert Modeling for Next-Basket Recommendation

Next-basket recommendation (NBR) is a type of recommendation that aims to predict a set of items a user will purchase based on their historical transaction basket sequences. It is governed by a dynamic interplay between two distinct user intents: habitual repurchase, which involves repeating past behaviors, and exploratory interest, which involves discovering new items. However, existing NBR methods generally suffer from two limitations: (1) they often entangle these conflicting motives within a single representation, causing habits to overshadow discovery, and (2) they rely on discrete sequential modeling that ignores continuous-time intervals and item-specific periodicities. In this paper, we propose a novel solution named Time-Interval Disentangled Experts (TIDE) to address these challenges. TIDE incorporates a Hawkes-enhanced Fourier Time Encoding to capture item-specific temporal periodicities and dynamic decay. To decouple user intentions, TIDE utilizes a dual-expert architecture that integrates a Habit Expert for recurring needs and a Pattern-Guided Exploration Expert for discovery. Combined with an item-aware gating mechanism, TIDE adaptively balances repurchase and exploration. Extensive experiments on four diverse real-world datasets demonstrate that TIDE consistently outperforms representative state-of-the-art NBR methods.

cs.IR↗

arXiv2025

A Geometric Multigrid-Accelerated Compact Gas-Kinetic Scheme for Fast Convergence in High-Speed Flows on GPUs

Implicit methods and GPU parallelization are two distinct yet powerful strategies for accelerating high-order CFD algorithms. However, few studies have successfully integrated both approaches within high-speed flow solvers. The core challenge lies in preserving the robustness of implicit algorithms in the presence of strong discontinuities, while simultaneously enabling massive thread parallelism under the constraints of limited GPU memory. To address this, we propose a GPU-optimized, geometric multigrid-accelerated, high-order compact gas kinetic scheme (CGKS) that incorporates three key innovations: (1) a multi-color lower-upper symmetric Gauss-Seidel scheme that eliminates thread conflicts and preserves memory efficiency, serving as an implicit smoother on coarse grids; (2) a discontinuity-adaptive relaxation technique and a multigrid prolongation process, based on a discontinuous feedback factor, which dynamically stabilize shock regions without compromising convergence in smooth zones; and (3) a three-layer V-cycle geometric parallel multigrid strategy specifically tailored for unstructured meshes. Extensive tests on multi-dimensional subsonic to hypersonic flows demonstrate that our GPU-based high-performance solver achieves one to two orders of magnitude faster convergence compared to previous explicit solvers. More importantly, it preserves the shock-capturing robustness of the explicit CGKS and exhibits strong scalability on GPU architectures. This work presents a unified framework that synergistically leverages implicit acceleration and GPU optimization for high-speed flow simulations, effectively overcoming traditional trade-offs between parallelism, memory constraints, and numerical stability in high-order methods.

math.NA↗

arXiv2024

Fast Estimation of Relative Transformation Based on Fusion of Odometry and UWB Ranging Data

In this paper, we investigate the problem of estimating the 4-DOF (three-dimensional position and orientation) robot-robot relative frame transformation using odometers and distance measurements between robots. Firstly, we apply a two-step estimation method based on maximum likelihood estimation. Specifically, a good initial value is obtained through unconstrained least squares and projection, followed by a more accurate estimate achieved through one-step Gauss-Newton iteration. Additionally, the optimal installation positions of Ultra-Wideband (UWB) are provided, and the minimum operating time under different quantities of UWB devices is determined. Simulation demonstrates that the two-step approach offers faster computation with guaranteed accuracy while effectively addressing the relative transformation estimation problem within limited space constraints. Furthermore, this method can be applied to real-time relative transformation estimation when a specific number of UWB devices are installed.

cs.RO↗

arXiv2018

An Adaptive Population Size Differential Evolution with Novel Mutation Strategy for Constrained Optimization

Differential evolution (DE) has competitive performance on constrained optimization problems (COPs), which targets at searching for global optimal solution without violating the constraints. Generally, researchers pay more attention on avoiding violating the constraints than better objective function value. To achieve the aim of searching the feasible solutions accurately, an adaptive population size method and an adaptive mutation strategy are proposed in the paper. The adaptive population method is similar to a state switch which controls the exploring state and exploiting state according to the situation of feasible solution search. The novel mutation strategy is designed to enhance the effect of status switch based on adaptive population size, which is useful to reduce the constraint violations. Moreover, a mechanism based on multipopulation competition and a more precise method of constraint control are adopted in the proposed algorithm. The proposed differential evolution algorithm, APDE-NS, is evaluated on the benchmark problems from CEC2017 constrained real parameter optimization. The experimental results show the effectiveness of the proposed method is competitive compared to other state-of-the-art algorithms.

cs.NE↗