Xinrong Hu

dblp:02/1690 · DBLP profile ↗
← Back
12ranked-venue papers in the field
1as first author
12since 2021 · last 2025
—ORCID · conflict

Domains — venue-derived; a paper can count in several

Data Mining & Knowledge Discovery · 4 (1 first)Information Retrieval & Web Search · 3Big Data, Cloud & Distributed Data Systems · 3Database Systems & Data Management · 1Other / Interdisciplinary · 1
YearPublicationVenuePosition
2025 Every Lie Has a Grain of Truth: Disentangling Deception from Authentic Content for Fake News Detection
Junping Liu, Zhenhao Hu, Xinrong Hu, Wangli Yang, Wanqing Li 0009, Jie Yang 0009, Yi Guo 0001
IEEE Big Data3
2025 Impact-Aware Retrieval Defense: Mitigating Word Substitution Ranking Attacks for Enhanced Stability
Junping Liu, Xinrong Hu, Wangli Yang, Wanqing Li 0009, Jie Yang 0009, Wenbin Zhang 0002, Yi Guo 0001
IEEE Big Data3
2025 Negative-Free Graph Contrastive Learning for Recommendation
abstract
Graph Contrastive Learning (GCL) emerges as a powerful approach in recommendation systems, leveraging graph structures to learn effective representations. However, existing contrastive sampling strategies often introduce unintended biases, most notably, the misclassification of genuine positive samples as negatives, which undermines representation quality and overall recommendation performance. Accordingly, this paper revisits the conventional contrastive sampling and introduces Negative-Free Sampling for Graph Contrastive Learning (NFS). NFS adopts a two-stage sampling strategy that selectively identifies and utilizes only positive instances during training. By removing reliance on negative samples, it effectively mitigates misclassification bias and improves the semantic alignment between related representations. In addition, a comprehensive theoretical analysis is also provided to establish the robustness of NFS against representation collapse. Experimental results on three benchmarks demonstrate that NFS consistently outperforms or performs state-of-the-art methods, achieving up to a 14.2% relative improvement across evaluated datasets. In addition, a detailed ablation study is also provided to examine how exclusively leveraging positive samples contributes to the efficiency of GCL. The results further demonstrate the plug-and-play nature of the proposed method and its resilience to noisy data.
Junping Liu, Mingchao Yu, Xinrong Hu, Jie Yang 0009, Yi Guo 0001, Wanqing Li 0001, Wenbin Zhang 0002
ICDM3
2025 STCGen: Sketch-based Text-to-Clothing Image Generation with Contour and Style Consistency
abstract
In modern fashion design field, it is a mainstream practice to generate clothing images by combining sketch and text. However, the image quality generated by existing multimodal methods combining sketches and text descriptions is suboptimal, as the clothing in the generated image often lacks contour accuracy and stylistic coherence. In this paper, we present STCGen, an advanced multimodal framework that uses both sketches and text to generate clothing images with improved contours and more consistent style. First, we introduce the sketch prior embedding module, which processes sketches to extract key structural features and ensure the consistency of contours, thereby enhancing image details. Second, we propose a cross space attention mechanism to address the issue of text information loss and ensure stylistic consistency, thereby enhancing overall image coherence. Finally, we propose a network simplification scheme to reduce complexity without compromising the quality of resulting images. Experimental results demonstrate that our method excels in generating high-fidelity clothing images.
Chunxia Xiao, Ruhan He, Jia Chen 0012, Mingfu Xiong, Tao Peng 0006, Xinrong Hu
MMAsia9
2025 sMOOD: subManifold Based Out-of-Distribution Detection
Wangli Yang, Xinrong Hu
PAKDD (1)2
2024 SCAD: Subspace Clustering based Adversarial Detector
abstract
Adversarial examples pose significant challenges for Natural Language Processing (NLP) model robustness, often causing notable performance degradation. While various detection methods have been proposed with the aim of differentiating clean and adversarial inputs, they often require fine-tuning with ample data, which is problematic for low-resource scenarios. To alleviate this issue, a Subspace Clustering based Adversarial Detector (termed SCAD) is proposed in this paper, leveraging a union of subspaces to model the clean data distribution. Specifically, SCAD estimates feature distribution across semantic subspaces, assigning unseen examples to the nearest one for effective discrimination. The construction of semantic subspaces does not require many observations and hence ideal for the low-resource setting.
Xinrong Hu, Wushuan Chen, Jie Yang 0009, Yi Guo 0001, Xun Yao, Bangchao Wang, Junping Liu
WSDM1
2024 COTER: Conditional Optimal Transport meets Table Retrieval
abstract
Ad hoc table retrieval refers to the task of performing semantic matching between given queries and candidate tables. In recent years, the approach to addressing this retrieval task has undergone significant shifts, transitioning from utilizing hand-crafted features to leveraging the power of Pre-trained Language Models (PLMs). However, key challenges arise when candidate tables contain shared items, and/or queries may refer to only a subset of table items rather than the entire one. Existing models often struggle to distinguish the most informative items and fail to accurately identify the relevant items required to match with the query.
Xun Yao, Xinrong Hu, Jie Yang 0009, Yi Guo 0001, Daniel (Dianliang) Zhu
WSDM3
2023 Improving Adversarially Robust Sequential Recommendation through Generalizable Perturbations
abstract
Sequential recommendation is of great importance for a variety of purposes, such as application engineering, resource optimization, and marketing. Yet, existing sequence-based recommendation models are susceptible to adversarial attacks, which aim to perturb input sequences and mislead trained models, resulting in incorrect predictions. Defense methods are accordingly adopted to enhance model robustness. Nevertheless, these methods encounter challenges, such as error propagation (from the model output to generate adversarial samples), the high system complexity, and the difficulty of maintaining the model generalizability. To bridge this gap, this paper introduces a simple yet effective adversarial defense algorithm, termed Perturbation-Driven Sequential Recommendation (PDSR). In the training process, PDSR leverages a simple perturbation-generation module to create adversarial samples, eliminating the need for gradient estimation, thus streamlining the process. Additionally, it also incorporates a robust encoder designed to increase tolerance towards representation variations by ensuring alignment between original and perturbed representations, thereby boosting model generalizability. Comprehensive experiments are conducted based on a combination of five benchmark datasets, two attack methods, and four sequential recommendation models. When compared to four state-of-the-art defense baselines, PDSR demonstrates notable improvements in defense performance.
Xun Yao, Ruyi He, Xinrong Hu, Jie Yang 0009, Yi Guo 0001, Zijian Huang 0012
IEEE Big Data3
2023 MIRS: [MASK] Insertion Based Retrieval Stabilizer for Query Variations
Junping Liu, Mingkang Gong, Xinrong Hu, Jie Yang 0009, Yi Guo 0001
DEXA (1)3
2023 Towards Robust Token Embeddings for Extractive Question Answering
Xun Yao, Junlong Ma, Xinrong Hu, Jie Yang 0009, Yi Guo 0001, Junping Liu
WISE3
2023 CREAM: Named Entity Recognition with Concise query and REgion-Aware Minimization
Xun Yao, Xinrong Hu, Jie Yang 0009, Yi Guo 0001
WISE3
2022 UF-VTON: Toward User-Friendly Virtual Try-On Network
abstract
Image-based virtual try-on aims to transfer a clothes onto a person while preserving both person's and cloth's attributes. However, the existing methods to realize this task require a target clothes, which cannot be obtained in most cases. To address this issue, we propose a novel user-friendly virtual try-on network (UF-VTON), which only requires a person image and an image of another person wearing a target clothes to generate a result of the person wearing the target clothes. Specifically, we adopt a knowledge distillation scheme to construct a new triple dataset for supervised learning, propose a new three-step pipeline (coarse synthesis, clothing alignment, and refinement synthesis) for try-on task, and utilize an end-to-end training strategy to further refine the results. In particular, we design a new synthesis network that includes both CNN blocks and swin-transformer blocks to capture global and local information and generate highly-realistic try-on images. Qualitative and quantitative experiments show that our method achieves the state-of-the-art virtual try-on performance.
Tao Peng 0006, Ruhan He, Xinrong Hu, Junping Liu, Minghua Jiang
ICMR4