mlsanityData to 14 Oct 2026

A General Traffic Shaping Protocol in E-Commerce

arXiv 2112.14941 ↗First posted 30 Dec 2021cs.LG cs.DScited by 0

Not on the map. Why?

Abstract (arXiv)

To approach different business objectives, online traffic shaping algorithms aim at improving exposures of a target set of items, such as boosting the growth of new commodities. Generally, these algorithms assume that the utility of each user-item pair can be accessed via a well-trained conversion rate prediction model. However, for real E-Commerce platforms, there are unavoidable factors preventing us from learning such an accurate model. In order to break the heavy dependence on accurate inputs of the utility, we propose a general online traffic shaping protocol for online E-Commerce applications. In our framework, we approximate the function mapping the bonus scores, which generally are the only method to influence the ranking result in the traffic shaping problem, to the numbers of exposures and purchases. Concretely, we approximate the above function by a class of the piece-wise linear function constructed on the convex hull of the explored data points. Moreover, we reformulate the online traffic shaping problem as linear programming where these piece-wise linear functions are embedded into both the objective and constraints. Our algorithm can straightforwardly optimize the linear programming in the prime space, and its solution can be simply applied by a stochastic strategy to fulfill the optimized objective and the constraints in expectation. Finally, the online A/B test shows our proposed algorithm steadily outperforms the previous industrial level traffic shaping algorithm.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 9 of its 20 references that are in the map. First posted on arXiv 30 Dec 2021.

Builds on

9 of 20 references.

References · 9

  1. 2019Introduction to Online Convex Optimizationcited by 803
  2. 2013Non-stationary Stochastic Optimizationcited by 175
  3. 2018Adaptive Online Learning in Dynamic Environmentscited by 133
  4. 2020Dynamic Regret of Convex and Smooth Functionscited by 90
  5. 2015An efficient algorithm for contextual bandits with knapsacks, and an extension to concave objectivescited by 43
  6. 2014Fast Algorithms for Online Stochastic Convex Programmingcited by 36
  7. 2020Simple and Fast Algorithm for Binary Integer and Online Linear Programmingcited by 27
  8. 2020Edge-Weighted Online Bipartite Matchingcited by 8
  9. 2017Online Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Modelscited by 6

Built on by

Not cited yet.