cs.AIOct 16, 2026

StoBasket: Joint Upsell and Cross-Sell Optimization for Contribution Margin

Authors: Xin Heng

Organizations: Tote AI United States

Abstract

Retail recommenders rank relevance, but retailers earn contribution margin: an upsell earns the margin difference over the item it replaces, whereas a cross-sell earns its full margin. We introduce joint stochastic basket editing, a formulation in which one policy selects replacement and addition offers for an existing basket, values them by expected incremental contribution margin, and couples them through displayed-offer, accepted-offer, and joint-acceptance response channels. To our knowledge, it is the first formulation in which upsell and cross-sell responses are coupled; prior separable treatments are its zero-coupling special case. In real-data-calibrated simulations on five public basket datasets, StoBasket captures essentially all attainable offer margin: within 0.5% in every default-price setting and within 0.7% when the true response lies outside its model family. Correct economic accounting is the broadest gain: margin-weighted popularity leaves up to 11% of attainable margin unrealized, and a published next-basket recommender leaves 11-52%. Joint selection adds 10.2% of attainable margin on Instacart, where premium tiers and add-ons are strongly linked. When offers pay only together, the best heuristics lose 64% while exact search stays within 0.5%. For a structured subclass, we characterize when staged policies fail and give an exact optimizer that solves every tested real basket in 0.13 ms median and at most 111 ms. Profit saturates long before prediction accuracy: a correctly structured predictor trained on 5,000 randomized sessions comes within 0.06% of perfect prediction, while a signal-free one loses 38%. The same estimates yield a decision-aware market-basket analysis whose cost does not grow with association order.

Figures & tables

Appendix figures & tables16 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Beyond Ranking Accuracy: Evaluating LLM-Cited Feature Rationales for Next Basket Repurchase Recommendation

    Aug 31, 2026Yanan Cao, Anay Dombe, Murali Mohana Krishna Dandu +5Sequential RecommendationLLM Evaluation

  2. CASE: Cadence-Aware Set Encoding for Large-Scale Next Basket Repurchase Recommendation

    Apr 8, 2026Yanan Cao, Ashish Ranjan, Sinduja Subramaniam +3Recommender SystemsSequential Recommendation

  3. Learnable Randomization as Commitment Against Adaptive Optimizers

    Sep 26, 2026Zihan Deng, Chuanzhi Xu, Xiaozhen Zhong +2Policy OptimizationStackelberg Games