arXiv AI
Boosting the Learning for Ranking Patterns
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
arXiv AI
Sep 28
SPADE: Escaping the Popularity-Similarity Frontier to Measure Serendipitous Recommendations
SPADE (Serendipitous Pareto Distance Evaluation) is a new metric for recommender systems that simultaneously considers item similarity, popularity, and user relevance. It projects items into a two‑dimensional space and computes a user‑specific Pareto frontier of maximally popular and historically similar items, then averages the minimum Euclidean distance from this frontier for correctly recommended test‑set items. Experiments on five datasets and five baseline algorithms demonstrate that SPADE effectively discourages algorithms from exploiting accuracy‑only metrics and reliably isolates serendipitous discoveries.
arXiv Machine Learning
Jul 7
Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls
arXiv:2607. 03515v1 Announce Type: cross Abstract: In many machine learning applications, the most relevant items for a query should be efficiently retrieved.
arXiv Machine Learning
Jun 8
Bradley-Terry Rankings for Recommender Systems Across Dataset Taxonomies
arXiv:2606. 07492v1 Announce Type: cross Abstract: The ranking of recommendation algorithms is a challenging problem since model performance is sensitive to dataset characteristics such as sparsity, sequential structure, and scale.
arXiv Machine Learning
Jun 26
Scoring Is Not Enough: Addressing Gaps in Utility-fairness Trade-offs for Ranking
arXiv:2606. 26369v1 Announce Type: cross Abstract: Scoring functions are used to represent the relevance of individual documents.
arXiv AI
Aug 25
Why This, Not That? Mining User Profiles for Pair-wise Counterfactuals
arXiv:2608.21662v1 Announce Type: cross Abstract: The topic of explanation in recommender systems has seen steady research attention since the earliest days of the field. With some exceptions, this w...
arXiv Machine Learning
Sep 30
Efficient Offline Learning of Ranking Policies via Top-$k$ Policy Decomposition
arXiv:2609.36740v1 Announce Type: new Abstract: Many recommender systems such as for e-commerce and news platforms aim to provide users with rankings they are likely to interact with. Off-Policy Lear...