Optimizing Revenue while showing Relevant Assortments at Scale release_hqfqvw5yt5du5f2ginaleeeqji

by Theja Tulabandhula, Deeksha Sinha

Released as a article .



Scalable real-time assortment optimization has become essential in e-commerce operations due to the need for personalization and the availability of a large variety of items. While this can be done when there are simplistic assortment choices to be made, imposing constraints on the collection of feasible assortments gives more flexibility to incorporate insights of store-managers and historically well-performing assortments. We design fast and flexible algorithms based on variations of binary search that find the revenue of the (approximately) optimal assortment. In particular, we revisit the problem of large-scale assortment optimization under the multinomial logit choice model without any assumptions on the structure of the feasible assortments. We speed up the comparisons steps using novel vector space embeddings, based on advances in the fields of information retrieval and machine learning. For an arbitrary collection of assortments, our algorithms can find a solution in time that is sub-linear in the number of assortments and for the simpler case of cardinality constraints - linear in the number of items (existing methods are quadratic or worse). Empirical validations using the Billion Prices dataset and several retail transaction datasets show that our algorithms are competitive even when the number of items is ∼ 10^5 (100x larger instances than previously studied).
In text/plain format

Archived Files and Locations

application/pdf  1.2 MB
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Type  article
Stage   submitted
Date   2020-03-06
Version   v1
Language   en ?
arXiv  2003.04736v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 0d17ba29-e5c9-49a2-a5a1-b69f60cf991a