Optimizing Offer Sets in Sub-Linear Time

@article{Farias2020OptimizingOS,
  title={Optimizing Offer Sets in Sub-Linear Time},
  author={Vivek F. Farias and Andrew A. Li and Deeksha Sinha},
  journal={Proceedings of the 21st ACM Conference on Economics and Computation},
  year={2020}
}
Personalization and recommendations are now accepted as core competencies in just about every online setting, ranging from media platforms to e-commerce to social networks. While the challenge of estimating user preferences has garnered significant attention, the operational problem of using such preferences to construct personalized offer sets to users is largely still open, particularly in modern settings where a massive number of items and a millisecond response time requirement mean that… 
View on ACM
[PDF] Semantic Reader

Figures and Tables from this paper

54 References

Collaborative Filtering on a Budget

This paper proposes a new model for representing and compressing matrix factors via hashing that allows for essentially unbounded storage (at a graceful storage / performance trade-off) for users and items to be represented in a pre-defined memory footprint.

Learning binary codes for collaborative filtering

This paper proposes to construct binary codes for users and items such that the preference of users over items can be accurately preserved by the Hamming distance between their respective binary codes.

Learning to Order Things

An on-line algorithm for learning preference functions that is based on Freund and Schapire's "Hedge" algorithm is considered, and it is shown that the problem of finding the ordering that agrees best with a learned preference function is NP-complete.

Discrete Factorization Machines for Fast Feature-based Recommendation

A convergent updating rule is proposed that resolves the challenging discrete optimization of DFM and shows that DFM consistently outperforms state-of-the-art binarized recommendation models, and DFM shows very competitive performance compared to its real-valued version (FM), demonstrating the minimized quantization loss.

Google news personalization: scalable online collaborative filtering

This paper describes the approach to collaborative filtering for generating personalized recommendations for users of Google News using MinHash clustering, Probabilistic Latent Semantic Indexing, and covisitation counts, and combines recommendations from different algorithms using a linear model.

Field-aware Factorization Machines for CTR Prediction

This paper establishes FFMs as an effective method for classifying large sparse data including those from CTR prediction, and proposes efficient implementations for training FFMs and comprehensively analyze FFMs.

An Efficient Boosting Algorithm for Combining Preferences

This work describes and analyze an efficient algorithm called RankBoost for combining preferences based on the boosting approach to machine learning, and gives theoretical results describing the algorithm's behavior both on the training data, and on new test data not seen during training.

Deep Learning based Recommender System: A Survey and New Perspectives

A taxonomy of deep learning based recommendation models is provided and a comprehensive summary of the state-of-the-art is provided, along with expanding on current trends and providing new perspectives pertaining to this new exciting development of the field.

Preference preserving hashing for efficient recommendation

Experiments show that the recommendation speed of the proposed PPH algorithm can be hundreds of times faster than original MF with real-valued features, and the recommendation accuracy is significantly better than previous work of hashing for recommendation.

Comparison-based Choices

The main result is that any comparison-based choice function in one dimension can be inferred as efficiently as a basic maximum or minimum choice function across many query contexts, suggesting that choice-set effects need not entail any fundamental algorithmic barriers to inference.
...