Xuan Bi

Xuan Bi

Auto-generated profile, based on publicly available information

Xuan Bi

Carlson School of Management, University of Minnesota, Minneapolis, Minnesota 55455

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
1 May 2022 in INFORMS Journal on Computing
Verified
Journal Article
Closed access
XBXuan Bi
Xuan Bi
GAGediminas Adomavicius
Gediminas Adomavicius
WLWilliam Li
William Li
AQAnnie Qu
Annie Qu
Because of the accessibility of big data collections from consumers, products, and stores, advanced sales forecasting capabilities have drawn great attention from many businesses, especially those in retail, because of the importance of forecasting in decision making. Improvement of forecasting accuracy, even by a small percentage, may have a substantial impact on companies’ production and financial planning, marketing strategies, inventory controls, and supply chain management. Specifically, our research goal is to forecast the sales of each product in each store in the near future. Motivated by tensor factorization methodologies for context-aware recommender systems, we propose a novel approach called the advanced temporal latent factor approach to sales forecasting, or ATLAS for short, which achieves accurate and individualized predictions for sales by building a single tensor factorization model across multiple stores and products. Our contribution is a combination of a tensor framework (to leverage information across stores and products), a new regularization function (to incorporate demand dynamics), and extrapolation of the tensor into future time periods using state-of-the-art statistical (seasonal autoregressive integrated moving-average models) and machine-learning (recurrent neural networks) models. The advantages of ATLAS are demonstrated on eight product category data sets collected by Information Resources, Inc., where we analyze a total of 165 million weekly sales transactions of over 15,560 products from more than 1,500 grocery stores.Summary of Contribution: Sales forecasting has been a task of long-standing importance. Accurate sales forecasting provides critical managerial implications for companies’ decision making and operations. Improvement of forecasting accuracy may have a substantial impact on companies’ production planning, marketing strategies, inventory controls, and supply chain management, among other things. This paper proposes a novel computational (machine-learning-based) approach to sales forecasting and thus is positioned directly at the intersection of computing and business/operations research.

1 August 2024 in Management Science
Verified
Journal Article
Closed access
XBXuan Bi
Xuan Bi
AGAlok Gupta
Alok Gupta
MYMochen Yang
Mochen Yang
Limited access to large-scale data is a key obstacle to building machine learning (ML) applications in practice, partly due to a reluctance of information exchange among data owners out of privacy and data security concerns. To address this “information silo” problem, federated learning (FL) techniques have been proposed to enable decentralized model training via an orchestrating central server and have received increasing attention in several industries (including healthcare and finance). Despite its superior privacy protection property, adoption of FL is limited by a lack of systematic understanding of its underlying economics. In this paper, we take an analytical approach to answer two questions: (1) when do data owners prefer to form a FL partnership over building ML models by themselves and (2) how can different contractual mechanisms be used to promote repeated contributions to FL (the cooperative outcome that benefits all participants). We formulate an iterated prisoner’s dilemma (IPD) model that accounts for unique FL characteristics, including the specification of the payoff matrix and the involvement of a central server to sanction noncooperation. We find that partnership formation requires participants to be not too forward-looking in temporal preferences, which is contrary to the conventional wisdom in IPD. Furthermore, to promote repeated contributions, it is insufficient to only rely on penalties imposed by the central server or by participants for noncooperation, but a combination of both is enough. Our work advances theoretical understanding of the economics of FL and provides prescriptive insights that can inform FL participant selection and contract design. This paper was accepted by D. J. Wu, information systems. Funding: This work was partially supported by Cisco Research. Supplemental Material: The online appendices are available at https://doi.org/10.1287/mnsc.2023.00611 .

1 December 2024 in Information Systems Research
Verified
Journal Article
Closed access
JCJiawei Chen
Jiawei Chen
LHLuo He
Luo He
HLHongyan Liu
Hongyan Liu
YYYinghui (Catherine) Yang
Yinghui (Catherine) Yang
XBXuan Bi
Xuan Bi
On short video sharing platforms, users often choose background music for their videos. In this paper, we study the problem of background music recommendation for short videos on short video sharing platforms. In our recommendation setting, the item (music) is not recommended directly to the user, but to the video created by the user. When making music recommendations for videos, we consider three important players: users, videos, and music. We define a unique background music recommendation problem and design a novel background music recommendation model to address the problem. We propose a model based on the deep learning framework to effectively address the distinctive three-way relationships among users, videos, and music. Our model considers not only of the conventional user–music alignment, but also the alignment between videos and music. To evaluate our model, we conduct comprehensive experiments on real-world data collected from one of the most popular short video sharing platforms. Our proposed model significantly outperforms other existing models in recommendation performance. The superiority of our proposed model remains consistent across various scenarios, including cold-start recommendations, data sets with varying density levels, and data sets spanning diverse video categories.

17 June 2022 in Journal of Econometrics
Verified
Journal Article
Closed access
XBXuan Bi
Xuan Bi
XSXiaotong Shen
Xiaotong Shen

25 August 2025 in Journal of Medical Internet Research
Verified
Journal Article
Open access
LQLin Qiu
Lin Qiu
CTChuang Tang
Chuang Tang
XBXuan Bi
Xuan Bi
GBGordon Burtch
Gordon Burtch
YCYanmin Chen
Yanmin Chen
HZHeping Zhang
Heping Zhang
Background: Generative artificial intelligence (GenAI) has rapidly emerged as a promising tool in health care. Despite its growing adoption, how physicians make use of it in medical practice has not been qualitatively studied. Existing literature has largely focused on theoretical applications or experimental validations, with limited insight into real-world physician engagement with GenAI technologies. Objective: The aim of this study was to leverage a fine-grained dataset at the query level to quantitatively examine how physicians incorporate GenAI into their clinical and research workflows. The primary objective was to analyze usage patterns over time and across physician demographics. A secondary goal was to assess potential risks to patient privacy arising from physicians’ interactions with GenAI platforms. Methods: This study collected 106,942 query-and-answer pairs by 989 physicians between August 29, 2023, and April 16, 2024. We performed topic classification to identify the most prevalent use cases, examining how these use cases evolved over time and across demographics. We also developed sensitivity classifiers to detect personally identifiable information in physicians’ queries to explore the potential privacy breach risks around physicians’ use of GenAI. Results: Approximately 40% (396/989) of the enrolled physicians were female, 45.9% (454/989) were younger than 25 years, and 54.1% (535/989) were between 25 and 56 years of age. The majority of them worked in clinical departments (680/989, 68.8%) or medical technology departments (127/989, 12.8%). Our classification-based quantitative analyses suggest the following. First, physicians use GenAI predominantly for medical research (64,379/106,942, 60.2%) rather than clinical practice (13,100/106,942, 12.25%). Second, physicians focus more on health care–related questions (rising from 64,165/106,942, 60% to 83,415/106,942, 78%) within the first 15% (16,041/106,942) of their query sequence. Third, the use of GenAI differed across physician demographics and features. Specifically, female physicians asked a larger proportion of clinical questions (female: 0.154 vs male: 0.108; P<.001) and administration questions (female: 0.027 vs male: 0.018; P<.001) than male physicians; younger physicians posed more clinical questions (age ≤25: 0.146 vs age ∈ (25, 40]: 0.115 vs age >40: 0.103; P<.001) but fewer research questions (age ≤25: 0.580 vs age ∈ (25, 40]: 0.607 vs age >40: 0.664; P<.001) than senior physicians; and physicians accessing GenAI via computers asked more research questions (computer: 0.637 vs mobile: 0.296; P<.001), whereas physicians using mobile devices asked more clinical questions (computer: 0.107 vs mobile: 0.264; P<.001). Fourth, only 2.68% (2866/106,942) of physician queries contained sensitive information, the majority of which were primarily derived from writing and editing. Conclusions: Physicians are actively integrating GenAI into their professional routines, primarily leveraging it for research but also increasingly for clinical support. Usage patterns vary significantly across demographic lines, including gender, age, and device preference. Despite the presence of sensitive information in some queries, the risk of privacy breaches appears to be low.

1 March 2024 in Information Systems Research
Verified
Journal Article
Closed access
XBXuan Bi
Xuan Bi
MYMochen Yang
Mochen Yang
GAGediminas Adomavicius
Gediminas Adomavicius
How to acquire the most valuable consumers to grow your recommender system? We propose a dynamic consumer acquisition model to enable value-driven acquisition decisions. We build a model of consumer acquisition that takes into account the value that a consumer contributes to the recommender system, the cost of their participation (e.g., privacy loss), and the value of their participation to other consumers (via network externality). We also propose data-driven procedures to estimate this model to enable informed, value-driven acquisition decisions. On three different data sets, we perform comprehensive simulation-based evaluations to demonstrate the performance of this dynamic consumer acquisition model. We find nuanced relationships between the firm’s choice of incentive strategies and acquisition outcomes. Neither a constant pricing strategy nor a greedy pricing strategy may be optimal. Instead, under a moderately greedy strategy, where the firm only partially extracts the network externality from consumers, the dynamic acquisition sequence can outperform random acquisition sequences on firm utility, recommender system performance, and consumer surplus simultaneously. Our work contributes a novel theoretical framework, practical insights, and design artifacts to facilitate effective consumer acquisition in recommender systems.