Pith. sign in

REVIEW 1 cited by

Re-ranking With Constraints on Diversified Exposures for Homepage Recommender System

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2112.07621 v1 pith:UOTDT2CZ submitted 2021-12-12 cs.IR cs.LG

classification cs.IRcs.LG
keywords homepageitemsattentionchanneldisplaydiversityhierarchicalmodel
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The homepage recommendation on most E-commerce applications places items in a hierarchical manner, where different channels display items in different styles. Existing algorithms usually optimize the performance of a single channel. So designing the model to achieve the optimal recommendation list which maximize the Click-Through Rate (CTR) of whole homepage is a challenge problem. Other than the accuracy objective, display diversity on the homepage is also important since homogeneous display usually hurts user experience. In this paper, we propose a two-stage architecture of the homepage recommendation system. In the first stage, we develop efficient algorithms for recommending items to proper channels while maintaining diversity. The two methods can be combined: user-channel-item predictive model with diversity constraint. In the second stage, we provide an ordered list of items in each channel. Existing re-ranking models are hard to describe the mutual influence between items in both intra-channel and inter-channel. Therefore, we propose a Deep \& Hierarchical Attention Network Re-ranking (DHANR) model for homepage recommender systems. The Hierarchical Attention Network consists of an item encoder, an item-level attention layer, a channel encoder and a channel-level attention layer. Our method achieves a significant improvement in terms of precision, intra-list average distance(ILAD) and channel-wise Precision@k in offline experiments and in terms of CTR and ILAD in our online systems.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Multi-task Offline Reinforcement Learning for Online Advertising in Recommender Systems

    cs.IR 2025-06 conditional novelty 4.0 of 10

    MTORL jointly learns channel recommendation and budget allocation for online advertising from offline user journeys, and reports better accuracy and reward than prior methods on KuaiRand, Criteo, and a Taobao A/B test.

Pith tools