Qiongxu Ma

Qiongxu Ma

Auto-generated profile, based on publicly available information

Qiongxu Ma

MYbank, Ant Group, Beijing, China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
23 March 2023 in ACM Transactions on Information Systems
Verified
Journal Article
Open access
XGXiaobo Guo
Xiaobo Guo
SLShaoshuai Li
Shaoshuai Li
NGNaicheng Guo
Naicheng Guo
JCJiangxia Cao
Jiangxia Cao
XLXiaolei Liu
Xiaolei Liu
YZYunan Zhao
Yunan Zhao
Data sparsity has been a long-standing issue for accurate and trustworthy recommendation systems (RS). To alleviate the problem, many researchers pay much attention to cross-domain recommendation (CDR), which aims at transferring rich knowledge from related source domains to enhance the recommendation performance of sparse target domain. To reach the knowledge transferring purpose, recent CDR works always focus on designing different pairwise directed or undirected information transferring strategies between source and target domains. However, such pairwise transferring idea is difficult to adapt to multi-target CDR scenarios directly, e.g., transferring knowledge between multiple domains and improving their performance simultaneously, as such strategies may lead the following issues: (1) When the number of domains increases, the number of transferring modules will grow exponentially, which causes heavy computation complexity. (2) A single pairwise transferring module could only capture the relevant information of two domains, but ignores the correlated information of other domains, which may limit the transferring effectiveness. (3) When a sparse domain serves as the source domain during the pairwise transferring, it would easily leads the negative transfer problem, and the untrustworthy information may hurt the target domain recommendation performance. In this article, we consider the key challenge of the multi-target CDR task: How to identify the most valuable trustworthy information over multiple domains and transfer such information efficiently to avoid the negative transfer problem? To fulfill the above challenge, we propose a novel end-to-end model termed as DR-MTCDR , standing for D isentangled R epresentations learning for M ulti- T arget CDR . DR-MTCDR aims at transferring the trustworthy domain-shared information across domains, which has the two major advantages in both efficiency and effectiveness: (1) For efficiency, DR-MTCDR utilizes a unified module on all domains to capture disentangled domain-shared information and domain-specific information, which could support all domain recommendation and be insensitive to the number of domains. (2) For effectiveness, based on the disentangled domain-shared and domain-specific information, DR-MTCDR has the capability to lead positive effect and make trustworthy recommendation for each domain. Empirical evaluations on datasets from both public datasets and real-world large-scale financial datasets have shown that the proposed framework outperforms other state-of-the-art baselines.

13 May 2024
Verified
Conference Paper
Open access
WXWujiang Xu
Wujiang Xu
QWQitian Wu
Qitian Wu
RWRunzhong Wang
Runzhong Wang
MHMingming Ha
Mingming Ha
QMQiongxu Ma
Qiongxu Ma
Junchi YanJunchi Yan
Junchi Yan
Cross-Domain Sequential Recommendation (CDSR) methods aim to tackle the data sparsity and cold-start problems present in Single-Domain Sequential Recommendation (SDSR). Existing CDSR works design their elaborate structures relying on overlapping users to propagate the cross-domain information. However, current CDSR methods make closed-world assumptions, assuming fully overlapping users across multiple domains and that the data distribution remains unchanged from the training environment to the test environment. As a result, these methods typically result in lower performance on online real-world platforms due to the data distribution shifts. To address these challenges under open-world assumptions, we design an Adaptive Multi-Interest Debiasing framework for cross-domain sequential recommendation (AMID), which consists of a multi-interest information module (MIM) and a doubly robust estimator (DRE). Our framework is adaptive for open-world environments and can improve the model of most off-the-shelf single-domain sequential backbone models for CDSR. Our MIM establishes interest groups that consider both overlapping and non-overlapping users, allowing us to effectively explore user intent and explicit interest. To alleviate biases across multiple domains, we developed the DRE for the CDSR methods. We also provide a theoretical analysis that demonstrates the superiority of our proposed estimator in terms of bias and tail bound, compared to the IPS estimator used in previous work. To promote related research in the community under open-world assumptions, we collected an industry financial CDSR dataset from Alipay, called "MYbank-CDR". Extensive offline experiments on four industry CDSR scenarios including the Amazon and MYbank-CDR datasets demonstrate the remarkable performance of our proposed approach. Additionally, we conducted a standard A/B test on Alipay, a large-scale financial platform with over one billion users, to validate the effectiveness of our model under open-world assumptions. Code and dataset are available at https://github.com/WujiangXu/AMID.

7 February 2023 in ACM Transactions on Information Systems
Verified
Journal Article
Open access
NGNaicheng Guo
Naicheng Guo
XLXiaolei Liu
Xiaolei Liu
SLShaoshuai Li
Shaoshuai Li
QMQiongxu Ma
Qiongxu Ma
KGKaixin Gao
Kaixin Gao
XGXiaobo Guo
Xiaobo Guo
Sequential recommendation (SR) learns users’ preferences by capturing the sequential patterns from users’ behaviors evolution. As discussed in many works, user–item interactions of SR generally present the intrinsic power-law distribution, which can be ascended to hierarchy-like structures. Previous methods usually handle such hierarchical information by making user–item sectionalization empirically under Euclidean space, which may cause distortion of user–item representation in real online scenarios. In this article, we propose a Poincaré-based heterogeneous graph neural network named Poincaré Heterogeneous Graph Neural Networks for Sequential Recommendation (PHGR) to model the sequential pattern information as well as hierarchical information contained in the data of SR scenarios simultaneously. Specifically, for the purpose of explicitly capturing the hierarchical information, we first construct a weighted user–item heterogeneous graph by aliening all the user–item interactions to improve the perception domain of each user from a global view. Then the output of the global representation would be used to complement the local directed item–item homogeneous graph convolution. By defining a novel hyperbolic inner product operator, the global and local graph representation learning are directly conducted in Poincaré ball instead of commonly used projection operation between Poincaré ball and Euclidean space, which could alleviate the cumulative error issue of general bidirectional translation process. Moreover, for the purpose of explicitly capturing the sequential dependency information, we design two types of temporal attention operations under Poincaré ball space. Empirical evaluations on datasets from the public and financial industry show that PHGR outperforms several comparison methods.

29 August 2023 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
NGNaicheng Guo
Naicheng Guo
XLXiaolei Liu
Xiaolei Liu
SLShaoshuai Li
Shaoshuai Li
MHMingming Ha
Mingming Ha
QMQiongxu Ma
Qiongxu Ma
XGXiaobo Guo
Xiaobo Guo
Session-based recommendation (SBR) learns users' preferences by capturing the short-term and sequential patterns from the evolution of user behaviors. Among the studies in the SBR field, graph-based approaches are a relatively powerful technique, which generally extract item information by message aggregation under Euclidean space. However, such methods cannot effectively extract the hierarchical information contained among consecutive items in a session, which is critical to represent users' preferences. In this paper, we present a hyperbolic contrastive graph recommender (HCGR), a principled session-based recommendation framework involving Lorentz hyperbolic space to efficiently capture the coherence and hierarchical representations of the items. Within this framework, an adaptive hyperbolic attention computation is designed to aggregate the graph message of each user's preference in a session-based behavior sequence. In addition, a contrastive ranking loss with the hyperbolic distance is used to separate the positive and negative items. Compared with the Euclidean distance, the advantage of the hyperbolic distance in the contrastive ranking loss is analyzed. The results of extensive experiments on four real-world datasets demonstrate that HCGR consistently outperforms state-of-the-art baselines by 0.43 $\%$ -14.44 $\%$ in terms of $HitRate$ , $NDCG$ and $MRR$ .

14 September 2023
Verified
Conference Paper
Open access
XTXuewen Tao
Xuewen Tao
MHMingming Ha
Mingming Ha
QMQiongxu Ma
Qiongxu Ma
HCHongwei Cheng
Hongwei Cheng
WLWenfang Lin
Wenfang Lin
BHBing Han
Bing Han
In online recommendation, financial service, etc., the most common application of multi-task learning (MTL) is the multi-step conversion estimations. A core property of the multi-step conversion is the sequential dependence among tasks. However, most existing works focus far more on the specific post-view click-through rate (CTR) and post-click conversion rate (CVR) estimations, which neglect the generalization of sequential dependence multi-task learning (SDMTL). Additionally, the performance of the SDMTL framework is also deteriorated by the interference derived from implicitly conflict information passing between adjacent tasks. In this paper, a systematic learning paradigm of the SDMTL problem is established for the first time, which can transform the SDMTL problem into a general MTL problem with constraints and be applicable to more general multi-step conversion scenarios with stronger task dependence. Also, the distribution dependence relationship between adjacent task spaces is illustrated from a theoretical point of view. On the other hand, an SDMTL architecture, named Task Aware Feature Extraction (TAFE), is developed to enable dynamic task representation learning from a sample-wise view. TAFE selectively reconstructs the implicit shared information corresponding to each sample case and performs explicit task-specific extraction under dependence constraints. Extensive experiments on offline public and real-world industrial datasets, and online A/B implementations demonstrate the effectiveness and applicability of proposed theoretical and implementation frameworks.