Su Jia
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
Su Jia has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Ramamoorthi Ravi
Tepper School of Business, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213
2 shared publications - Sridhar Tayur
Quantum Technologies Group, Tepper School of Business, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213
2 shared publications - Andrew A. Li
Tepper School of Business, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213
1 shared publication Andrew Li
Tepper School of Business, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213
1 shared publicationIan Anderson
Glance, Bengaluru, Karnataka 560103, India
1 shared publicationJeremy Karp
Marketplace Optimization, Lyft Inc, San Francisco, California
1 shared publication
Latest Publications
- 21 April 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 74 (4) , 1945-1964
Short-Lived High-Volume Bandits
When Thousands of Items Arrive Every Hour: A New Approach to Online Experimentation Researchers have reported a new approach to address a key challenge for online platforms. In a new paper in Operations Research, Jia et al. introduced the Short-lived High-volume Bandits (SLHVB) framework. This models modern platforms where thousands of items—such as ads, stories, or interface designs—arrive each hour but remain available only briefly. The study develops a near-optimal online learning policy that balances exploration and exploitation. Theoretical analysis shows the algorithm achieves nearly the minimal possible loss as the number of user impressions grows. The team tested the policy in a large-scale field experiment with Glance, a leading lock-screen content platform. The policy increased viewing duration by 4.32% and click-through rates by 7.48% compared to the platform’s existing deep-learning-based recommender system.
- 21 April 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 74 (4) , 1945-1964
Short-Lived High-Volume Bandits
When Thousands of Items Arrive Every Hour: A New Approach to Online Experimentation Researchers have reported a new approach to address a key challenge for online platforms. In a new paper in Operations Research, Jia et al. introduced the Short-lived High-volume Bandits (SLHVB) framework. This models modern platforms where thousands of items—such as ads, stories, or interface designs—arrive each hour but remain available only briefly. The study develops a near-optimal online learning policy that balances exploration and exploitation. Theoretical analysis shows the algorithm achieves nearly the minimal possible loss as the number of user impressions grows. The team tested the policy in a large-scale field experiment with Glance, a leading lock-screen content platform. The policy increased viewing duration by 4.32% and click-through rates by 7.48% compared to the platform’s existing deep-learning-based recommender system.
- 1 April 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 72 (4) , 3291-3308
Toward a Liquid Biopsy: Greedy Approximation Algorithms for Active Sequential Hypothesis Testing
This paper addresses challenges in developing liquid biopsies for early-stage cancer detection through active sequential hypothesis testing (ASHT). In the problem of ASHT, a learner seeks to identify the true hypothesis (true cancer type) from a known set of hypotheses (candidate cancer types). The learner is given a set of actions (sequencing genetic intervals) and knows the distribution of the random outcome (whether a mutation is detected) of any action under any true hypothesis. Given a target error [ ], the goal is to sequentially select the fewest number of actions to identify the true hypothesis with probability at least [ ]. Motivated by applications in which the number of hypotheses or actions is massive (e.g., genomics-based cancer detection), we propose efficient greedy algorithms and provide the first approximation guarantees for ASHT, under two types of adaptivity. Our guarantees are independent of the number of actions and logarithmic in the number of hypotheses. Numerical tests on synthetic and real DNA mutation data show that our algorithms significantly outperform previous heuristic policies. This paper was accepted by David Simchi-Levi, healthcare management. Supplemental Material: The online appendices and data files are available at https://doi.org/10.1287/mnsc.2023.00829 .
- 1 April 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 72 (4) , 3291-3308
Toward a Liquid Biopsy: Greedy Approximation Algorithms for Active Sequential Hypothesis Testing
This paper addresses challenges in developing liquid biopsies for early-stage cancer detection through active sequential hypothesis testing (ASHT). In the problem of ASHT, a learner seeks to identify the true hypothesis (true cancer type) from a known set of hypotheses (candidate cancer types). The learner is given a set of actions (sequencing genetic intervals) and knows the distribution of the random outcome (whether a mutation is detected) of any action under any true hypothesis. Given a target error [ ], the goal is to sequentially select the fewest number of actions to identify the true hypothesis with probability at least [ ]. Motivated by applications in which the number of hypotheses or actions is massive (e.g., genomics-based cancer detection), we propose efficient greedy algorithms and provide the first approximation guarantees for ASHT, under two types of adaptivity. Our guarantees are independent of the number of actions and logarithmic in the number of hypotheses. Numerical tests on synthetic and real DNA mutation data show that our algorithms significantly outperform previous heuristic policies. This paper was accepted by David Simchi-Levi, healthcare management. Supplemental Material: The online appendices and data files are available at https://doi.org/10.1287/mnsc.2023.00829 .
- 1 May 2022
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Manufacturing & Service Operations Management
- Vol. 24 (3) , 1650-1663
Effective Online Order Acceptance Policies for Omnichannel Fulfillment
Problem definition: Omnichannel retailing has led to the use of traditional stores as fulfillment centers for online orders. Omnichannel fulfillment problems have two components: (1) accepting a ce...
- 1 May 2022
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Manufacturing & Service Operations Management
- Vol. 24 (3) , 1650-1663
Effective Online Order Acceptance Policies for Omnichannel Fulfillment
Problem definition: Omnichannel retailing has led to the use of traditional stores as fulfillment centers for online orders. Omnichannel fulfillment problems have two components: (1) accepting a ce...