Search arXiv⌕ Search

arXiv subjects

Siyang Xu

Publications and source records attributed to Siyang Xu.

3 recordsLinked to original sources

Anatomy of a Decision: Uncertainty-aware Hierarchical Intent Learning via Flow Matching for Multimodal Recommendation

Modeling the underlying user intent is crucial for recommendation, but existing methods struggle with the inherent uncertainty and the dynamic, hierarchical nature of user interests. Current approaches often rely on clustering or prototype learning to discover a static set of intents. However, they face two critical challenges: (1) they overlook the uncertainty inherent in multimodal features; and (2) they assume a static and flat intent structure, failing to adapt to a user's varying decision certainty. To address these limitations, we propose UHIFlow, an Uncertainty-aware Hierarchical Intent learning framework via Flow matching. First, our Cross-modal Uncertainty Synergistic Modeling (CUSM) module leverages conditional flow matching to quantify uncertainty from visual and textual modalities and synergistically align them. Subsequently, the Uncertainty-guided Hierarchical Intent Generation (UHIG) module uses this quantified uncertainty to dynamically construct a personalized intent hierarchy, generating coarse-grained intents for uncertain users and fine-grained ones for users with clear preferences. Extensive experiments on three real-world datasets demonstrate that UHIFlow significantly outperforms state-of-the-art baselines.

cs.IR↗

KScaNN: Scalable Approximate Nearest Neighbor Search on Kunpeng

Approximate Nearest Neighbor Search (ANNS) is a cornerstone algorithm for information retrieval, recommendation systems, and machine learning applications. While x86-based architectures have historically dominated this domain, the increasing adoption of ARM-based servers in industry presents a critical need for ANNS solutions optimized on ARM architectures. A naive port of existing x86 ANNS algorithms to ARM platforms results in a substantial performance deficit, failing to leverage the unique capabilities of the underlying hardware. To address this challenge, we introduce KScaNN, a novel ANNS algorithm co-designed for the Kunpeng 920 ARM architecture. KScaNN embodies a holistic approach that synergizes sophisticated, data aware algorithmic refinements with carefully-designed hardware specific optimizations. Its core contributions include: 1) novel algorithmic techniques, including a hybrid intra-cluster search strategy and an improved PQ residual calculation method, which optimize the search process at a higher level; 2) an ML-driven adaptive search module that provides adaptive, per-query tuning of search parameters, eliminating the inefficiencies of static configurations; and 3) highly-optimized SIMD kernels for ARM that maximize hardware utilization for the critical distance computation workloads. The experimental results demonstrate that KScaNN not only closes the performance gap but establishes a new standard, achieving up to a 1.63x speedup over the fastest x86-based solution. This work provides a definitive blueprint for achieving leadership-class performance for vector search on modern ARM architectures and underscores

cs.IR↗

R3-REC: Reasoning-Driven Recommendation via Retrieval-Augmented LLMs over Multi-Granular Interest Signals

This paper addresses two persistent challenges in sequential recommendation: (i) evidence insufficiency-cold-start sparsity together with noisy, length-varying item texts; and (ii) opaque modeling of dynamic, multi-faceted intents across long/short horizons. We propose R3-REC (Reasoning-Retrieval-Recommendation), a prompt-centric, retrieval-augmented framework that unifies Multi-level User Intent Reasoning, Item Semantic Extraction, Long-Short Interest Polarity Mining, Similar User Collaborative Enhancement, and Reasoning-based Interest Matching and Scoring. Across ML-1M, Games, and Bundle, R3-REC consistently surpasses strong neural and LLM baselines, yielding improvements up to +10.2% (HR@1) and +6.4% (HR@5) with manageable end-to-end latency. Ablations corroborate complementary gains of all modules.

cs.IR↗