Haixun Wang

Haixun Wang

Auto-generated profile, based on publicly available information

Haixun Wang

Instacart, San Francisco, California, USA

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
13 July 2025
Verified
Conference Paper
Open access
YSYimin Shi
Yimin Shi
YFYang Fei
Yang Fei
SZShiqi Zhang
Shiqi Zhang
HWHaixun Wang
Haixun Wang
XXXiaokui Xiao
Xiaokui Xiao

21 March 2025 in ACM Transactions on Recommender Systems
Verified
Journal Article
Open access
YZYao Zhou
Yao Zhou
HWHaonan Wang
Haonan Wang
JHJingrui He
Jingrui He
HWHaixun Wang
Haixun Wang
With the prevalence of deep learning–based embedding approaches, recommender systems have become a proven and indispensable tool in various information filtering applications. However, it is difficult to determine which aspects of the deep models’ input drive the final ranking decision in many of these recommender systems; thus, they often cannot be understood by human stakeholders. In this article, we investigate the dilemma between recommendation and explainability, and show that by utilizing the contextual features (e.g., item reviews from users), we can design a series of explainable recommender systems without sacrificing their performance. In particular, we propose three types of explainable recommendation strategies with gradual changes in model transparency: whitebox, graybox, and blackbox. Each strategy explains its ranking decisions via different mechanisms: attention weights, adversarial perturbations, and counterfactual perturbations. We apply these explainable models on five real-world datasets under a contextualized setting in which the users provided explicit reviews of the items. The empirical results show that our models can achieve highly competitive ranking performance while generating accurate and effective explanations in terms of numerous quantitative metrics and qualitative visualizations.

21 October 2023
Verified
Conference Paper
Open access
ZKZiyi Kou
Ziyi Kou
SMSaurav Manchanda
Saurav Manchanda
SLShih-Ting Lin
Shih-Ting Lin
MXMin Xie
Min Xie
HWHaixun Wang
Haixun Wang
XZXiangliang Zhang
Xiangliang Zhang
Next Basket Recommendation (NBR) aims to recommend a set of products as a basket to users based on their historical shopping behavior. In this paper, we investigate the problem of NBR in online marketplaces (e.g., Instacart, Uber Eats) that connect users with multiple sellers. In such scenarios, effective NBR can significantly enhance the shopping experience of users by recommending diversified and completed products based on specific sellers, especially when a user purchases from a seller they have not visited before. However, conventional NBR approaches assume that all considered products are from the same sellers, which overlooks the complex relationships between users, sellers, and products. To address such limitations, we develop SecGT, a sequential collaborative graph transformer framework that recommends users with baskets from specific sellers based on seller-aware user preference representations that are generated by collaboratively modeling the joint user-seller-product interactions and sequentially exploring the user-agnostic basket transitions in an interactive way. We evaluate the performance of SecGT on users from a leading online marketplace at multiple cities with various involved sellers. The results show that SecGT outperforms existing NBR and also traditional product recommendation approaches on recommending baskets from cold sellers for different types of users across all cities.

30 April 2023
Verified
Conference Paper
Open access
CRChuanwei Ruan
Chuanwei Ruan
ASAllan Stewart
Allan Stewart
HLHan Li
Han Li
RYRyan Ye
Ryan Ye
DVDavid Vengerov
David Vengerov
HWHaixun Wang
Haixun Wang
Personalization is essential in e-commerce, with item recommendation as a critical task. In this paper, we describe a hybrid embedding-based retrieval system for real-time personalized item recommendations on Instacart. Our system addresses unique challenges in the multi-source retrieval system, and includes several key components to make it highly personalized and dynamic. Specifically, our system features a hybrid embedding model that includes a long-term user interests embedding model and a real-time session-based model, which are combined to capture users’ immediate intents and historical interactions. Additionally, we have developed a contextual bandit solution to dynamically adjust the number of candidates from each source and optimally allocate retrieval slots given a limited computational budget. Our modeling and system optimization efforts have enabled us to provide highly personalized item recommendations in real-time at scale to all our customers, including new and long-standing users.

8 September 2025 in ACM Transactions on Knowledge Discovery From Data
Verified
Journal Article
Open access
JLJi LIU
Ji LIU
BMBeichen Ma
Beichen Ma
QYQiaolin Yu
Qiaolin Yu
RJRuoming Jin
Ruoming Jin
JZJingbo Zhou
Jingbo Zhou
PVPatrick Valduriez
Patrick Valduriez
Federated Learning (FL) is a promising distributed machine learning approach that enables collaborative training of a global model using multiple edge devices. The data distributed among the edge devices are highly heterogeneous. Thus, FL faces the challenge of data distribution and heterogeneity, where non-Independent and Identically Distributed (non-IID) data across edge devices may yield in significant accuracy drop. Furthermore, the limited computation and communication capabilities of edge devices increase the likelihood of stragglers, thus leading to slow model convergence. In this article, we propose the FedDHAD FL framework, which comes with two novel methods: dynamic heterogeneous model aggregation (FedDH) and adaptive dropout (FedAD). FedDH dynamically adjusts the weights of each local model within the model aggregation process based on the non-IID degree of heterogeneous data to deal with the statistical data heterogeneity. FedAD performs neuron-adaptive operations in response to heterogeneous devices to improve accuracy while achieving superb efficiency. The combination of these two methods makes FedDHAD significantly outperform state-of-the-art solutions in terms of accuracy (up to 6.7% higher), efficiency (up to 2.02 times faster), and computation cost (up to 15.0% smaller).

8 May 2025
Verified
Conference Paper
Open access
DXDa Xu
Da Xu
DZDanqing Zhang
Danqing Zhang
CRChuanwei Ruan
Chuanwei Ruan
LZLingling Zheng
Lingling Zheng
BYBo Yang
Bo Yang
HWHaixun Wang
Haixun Wang