Jiayan Guo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Jiayan Guo has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Yan Zhang
Peking University, Beijing, China
5 shared publications - Chaozhuo Li
Microsoft Research Asia, Beijing, China
2 shared publications - Dongmei Zhang
Microsoft Research Asia, Beijing, China
2 shared publications - Haohan Wang
School of Information Sciences University of Illinois Urbana-Champaign Illinois USA
2 shared publications - Jae Boum Kim
Hong Kong University of Science and Technology, Hong Kong, Hong Kong
2 shared publications - Lun Du
Ant Research, Beijing, China
2 shared publications
Latest Publications
- Open Access
- 18 August 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Intelligent Systems and Technology
- Vol. 16 (5) , 1-26
Advancing Session-Based Recommendations with Atten-Mixer+: Dynamic and Adaptive Multi-Level Intent Mining
Session-Based Recommendation (SBR) systems, traditionally reliant on complex Graph Neural Networks (GNNs), often face challenges with marginal performance improvements despite increased model complexity. In this article, we dissect the classical GNN-based SBR models and empirically find that the sophisticated GNN propagations might be redundant, given the readout module plays a significant role in GNN-based models. Based on this observation, we introduce Atten-Mixer+, an advanced iteration of our previously developed Multi-Level Attention Mixture Network (Atten-Mixer). Atten-Mixer+ forgoes GNN propagation in favor of a dynamic and adaptive readout process, tailored to the unique characteristics of each session. Different from the vanilla version, Atten-Mixer+ features the Adaptive Intent Scaler (AIS) layer, which dynamically determines the depth of multi-level user intent analysis and a soft allocation approach for generating user intent queries across entire user interaction sequences. This innovative design allows Atten-Mixer+ to capture a nuanced and comprehensive understanding of user behaviors, overcoming the limitations of fixed-length analysis. Empirical evaluations on benchmark datasets highlight Atten-Mixer+’s superior efficiency and effectiveness, marking a significant step forward in the predictive accuracy of SBR systems.
- 18 August 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Intelligent Systems and Technology
- Vol. 16 (5) , 1-26
Open AccessAdvancing Session-Based Recommendations with Atten-Mixer+: Dynamic and Adaptive Multi-Level Intent Mining
Session-Based Recommendation (SBR) systems, traditionally reliant on complex Graph Neural Networks (GNNs), often face challenges with marginal performance improvements despite increased model complexity. In this article, we dissect the classical GNN-based SBR models and empirically find that the sophisticated GNN propagations might be redundant, given the readout module plays a significant role in GNN-based models. Based on this observation, we introduce Atten-Mixer+, an advanced iteration of our previously developed Multi-Level Attention Mixture Network (Atten-Mixer). Atten-Mixer+ forgoes GNN propagation in favor of a dynamic and adaptive readout process, tailored to the unique characteristics of each session. Different from the vanilla version, Atten-Mixer+ features the Adaptive Intent Scaler (AIS) layer, which dynamically determines the depth of multi-level user intent analysis and a soft allocation approach for generating user intent queries across entire user interaction sequences. This innovative design allows Atten-Mixer+ to capture a nuanced and comprehensive understanding of user behaviors, overcoming the limitations of fixed-length analysis. Empirical evaluations on benchmark datasets highlight Atten-Mixer+’s superior efficiency and effectiveness, marking a significant step forward in the predictive accuracy of SBR systems.
- Open Access
- 21 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 19 (6) , 1-23
Subgraph Federated Learning with Information Bottleneck Constrained Generative Learning
Federated Learning (FL) is a groundbreaking approach that enables multiple clients to jointly train deep learning models by pooling their data, while addressing privacy and bandwidth issues that prevent direct data sharing. This approach is particularly suitable for building strong and widely applicable graph models, given the increasing amounts of graph data stored across different locations. However, FL for subgraph models faces significant challenges, such as the diversity of data and the risk of attacks, which can affect the strength and reliability of these models. In response to these challenges, our research delves into the complexities of FL for subgraphs from an information theory perspective. We identify a major issue that affects the performance of graph models: the bias in the optimization goal of the commonly used FedAVG training method. To address this, we propose InfoFedGNN, an innovative FL framework for subgraphs that is based on the Information Bottleneck principle. InfoFedGNN is designed to overcome the problem of Non-Independent and Identically Distributed (non-i.i.d.) data in FL and to significantly improve its defense against security threats. Our thorough evaluation of InfoFedGNN on five public datasets, with both uniform and diverse data distributions, highlights its improved defense capabilities and better training outcomes. These results confirm the effectiveness of InfoFedGNN in enhancing the security and efficiency of FL, demonstrating its potential to push forward the development of federated graph models.
- 21 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 19 (6) , 1-23
Open AccessSubgraph Federated Learning with Information Bottleneck Constrained Generative Learning
Federated Learning (FL) is a groundbreaking approach that enables multiple clients to jointly train deep learning models by pooling their data, while addressing privacy and bandwidth issues that prevent direct data sharing. This approach is particularly suitable for building strong and widely applicable graph models, given the increasing amounts of graph data stored across different locations. However, FL for subgraph models faces significant challenges, such as the diversity of data and the risk of attacks, which can affect the strength and reliability of these models. In response to these challenges, our research delves into the complexities of FL for subgraphs from an information theory perspective. We identify a major issue that affects the performance of graph models: the bias in the optimization goal of the commonly used FedAVG training method. To address this, we propose InfoFedGNN, an innovative FL framework for subgraphs that is based on the Information Bottleneck principle. InfoFedGNN is designed to overcome the problem of Non-Independent and Identically Distributed (non-i.i.d.) data in FL and to significantly improve its defense against security threats. Our thorough evaluation of InfoFedGNN on five public datasets, with both uniform and diverse data distributions, highlights its improved defense capabilities and better training outcomes. These results confirm the effectiveness of InfoFedGNN in enhancing the security and efficiency of FL, demonstrating its potential to push forward the development of federated graph models.
- Open Access
- 24 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 5038-5049
Generative Auto-bidding via Conditional Diffusion Modeling
Auto-bidding plays a crucial role in facilitating online advertising by automatically providing bids for advertisers. Reinforcement learning (RL) has gained popularity for auto-bidding. However, most current RL auto-bidding methods are modeled through the Markovian Decision Process (MDP), which assumes the Markovian state transition. This assumption restricts the ability to perform in long horizon scenarios and makes the model unstable when dealing with highly random online advertising environments. To tackle this issue, this paper introduces AI-Generated Bidding (AIGB), a novel paradigm for auto-bidding through generative modeling. In this paradigm, we propose DiffBid, a conditional diffusion modeling approach for bid generation. DiffBid directly models the correlation between the return and the entire trajectory, effectively avoiding error propagation across time steps in long horizons. Additionally, DiffBid offers a versatile approach for generating trajectories that maximize given targets while adhering to specific constraints. Extensive experiments conducted on the real-world dataset and online A/B test on Alibaba advertising platform demonstrate the effectiveness of DiffBid, achieving 2.81% increase in GMV and 3.36% increase in ROI.
- 24 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 5038-5049
Open AccessGenerative Auto-bidding via Conditional Diffusion Modeling
Auto-bidding plays a crucial role in facilitating online advertising by automatically providing bids for advertisers. Reinforcement learning (RL) has gained popularity for auto-bidding. However, most current RL auto-bidding methods are modeled through the Markovian Decision Process (MDP), which assumes the Markovian state transition. This assumption restricts the ability to perform in long horizon scenarios and makes the model unstable when dealing with highly random online advertising environments. To tackle this issue, this paper introduces AI-Generated Bidding (AIGB), a novel paradigm for auto-bidding through generative modeling. In this paradigm, we propose DiffBid, a conditional diffusion modeling approach for bid generation. DiffBid directly models the correlation between the return and the entire trajectory, effectively avoiding error propagation across time steps in long horizons. Additionally, DiffBid offers a versatile approach for generating trajectories that maximize given targets while adhering to specific constraints. Extensive experiments conducted on the real-world dataset and online A/B test on Alibaba advertising platform demonstrate the effectiveness of DiffBid, achieving 2.81% increase in GMV and 3.36% increase in ROI.
- Open Access
- 4 August 2023
- Published by Association for Computing Machinery (ACM)
- p. 602-613
On Manipulating Signals of User-Item Graph: A Jacobi Polynomial-based Graph Collaborative Filtering
- 4 August 2023
- Published by Association for Computing Machinery (ACM)
- p. 602-613
Open AccessOn Manipulating Signals of User-Item Graph: A Jacobi Polynomial-based Graph Collaborative Filtering
- Open Access
- 30 April 2023
- Published by Association for Computing Machinery (ACM)
- p. 511-522
Homophily-oriented Heterogeneous Graph Rewiring
With the rapid development of the World Wide Web (WWW), heterogeneous graphs (HG) have explosive growth. Recently, heterogeneous graph neural network (HGNN) has shown great potential in learning on HG. Current studies of HGNN mainly focus on some HGs with strong homophily properties (nodes connected by meta-path tend to have the same labels), while few discussions are made in those that are less homophilous. Recently, there have been many works on homogeneous graphs with heterophily. However, due to heterogeneity, it is non-trivial to extend their approach to deal with HGs with heterophily. In this work, based on empirical observations, we propose a meta-path-induced metric to measure the homophily degree of a HG. We also find that current HGNNs may have degenerated performance when handling HGs with less homophilous properties. Thus it is essential to increase the generalization ability of HGNNs on non-homophilous HGs. To this end, we propose HDHGR, a homophily-oriented deep heterogeneous graph rewiring approach that modifies the HG structure to increase the performance of HGNN. We theoretically verify HDHGR. In addition, experiments on real-world HGs demonstrate the effectiveness of HDHGR, which brings at most more than 10% relative gain.
- 30 April 2023
- Published by Association for Computing Machinery (ACM)
- p. 511-522
Open AccessHomophily-oriented Heterogeneous Graph Rewiring
With the rapid development of the World Wide Web (WWW), heterogeneous graphs (HG) have explosive growth. Recently, heterogeneous graph neural network (HGNN) has shown great potential in learning on HG. Current studies of HGNN mainly focus on some HGs with strong homophily properties (nodes connected by meta-path tend to have the same labels), while few discussions are made in those that are less homophilous. Recently, there have been many works on homogeneous graphs with heterophily. However, due to heterogeneity, it is non-trivial to extend their approach to deal with HGs with heterophily. In this work, based on empirical observations, we propose a meta-path-induced metric to measure the homophily degree of a HG. We also find that current HGNNs may have degenerated performance when handling HGs with less homophilous properties. Thus it is essential to increase the generalization ability of HGNNs on non-homophilous HGs. To this end, we propose HDHGR, a homophily-oriented deep heterogeneous graph rewiring approach that modifies the HG structure to increase the performance of HGNN. We theoretically verify HDHGR. In addition, experiments on real-world HGs demonstrate the effectiveness of HDHGR, which brings at most more than 10% relative gain.
- Top Cited PapersOpen Access
- 27 February 2023
- Published by Association for Computing Machinery (ACM)
- p. 168-176
Efficiently Leveraging Multi-level User Intent for Session-based Recommendation via Atten-Mixer Network
Session-based recommendation (SBR) aims to predict the user's next action based on short and dynamic sessions. Recently, there has been an increasing interest in utilizing various elaborately designed graph neural networks (GNNs) to capture the pair-wise relationships among items, seemingly suggesting the design of more complicated models is the panacea for improving the empirical performance. However, these models achieve relatively marginal improvements with exponential growth in model complexity. In this paper, we dissect the classical GNN-based SBR models and empirically find that some sophisticated GNN propagations are redundant, given the readout module plays a significant role in GNN-based models. Based on this observation, we intuitively propose to remove the GNN propagation part, while the readout module will take on more responsibility in the model reasoning process. To this end, we propose the Multi-Level Attention Mixture Network (Atten-Mixer), which leverages both concept-view and instance-view readouts to achieve multi-level reasoning over item transitions. As simply enumerating all possible high-level concepts is infeasible for large real-world recommender systems, we further incorporate SBR-related inductive biases, i.e., local invariance and inherent priority to prune the search space. Experiments on three benchmarks demonstrate the effectiveness and efficiency of our proposal. We also have already launched the proposed techniques to a large-scale e-commercial online service since April 2021, with significant improvements of top-tier business metrics demonstrated in the online experiments on live traffic.
- 27 February 2023
- Published by Association for Computing Machinery (ACM)
- p. 168-176
Top Cited PapersOpen AccessEfficiently Leveraging Multi-level User Intent for Session-based Recommendation via Atten-Mixer Network
Session-based recommendation (SBR) aims to predict the user's next action based on short and dynamic sessions. Recently, there has been an increasing interest in utilizing various elaborately designed graph neural networks (GNNs) to capture the pair-wise relationships among items, seemingly suggesting the design of more complicated models is the panacea for improving the empirical performance. However, these models achieve relatively marginal improvements with exponential growth in model complexity. In this paper, we dissect the classical GNN-based SBR models and empirically find that some sophisticated GNN propagations are redundant, given the readout module plays a significant role in GNN-based models. Based on this observation, we intuitively propose to remove the GNN propagation part, while the readout module will take on more responsibility in the model reasoning process. To this end, we propose the Multi-Level Attention Mixture Network (Atten-Mixer), which leverages both concept-view and instance-view readouts to achieve multi-level reasoning over item transitions. As simply enumerating all possible high-level concepts is infeasible for large real-world recommender systems, we further incorporate SBR-related inductive biases, i.e., local invariance and inherent priority to prune the search space. Experiments on three benchmarks demonstrate the effectiveness and efficiency of our proposal. We also have already launched the proposed techniques to a large-scale e-commercial online service since April 2021, with significant improvements of top-tier business metrics demonstrated in the online experiments on live traffic.
- Open Access
- 18 October 2019
- Published by Association for Computing Machinery (ACM)
- p. 95-102
How "Task-Individual Fit" Influences User Contribution Behaviors in Citizen Science
- 18 October 2019
- Published by Association for Computing Machinery (ACM)
- p. 95-102
Open AccessHow "Task-Individual Fit" Influences User Contribution Behaviors in Citizen Science