arXiv Machine Learning
Soft Curriculum Learning for Optimizing Fresh and Generalized Recommendations
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv AI
6d ago
DeGRe: Dense-supervised Generative Reranking for Recommendation
DeGRe is a dense‑supervised generative reranking framework designed to improve multi‑stage recommender systems by addressing label bias and credit assignment issues. It uses an offline Lookahead Evaluator with beam search to generate dense supervision signals, which are distilled into a lightweight Online Generator that can perform efficient greedy decoding at inference time. Experiments show that DeGRe outperforms baselines on public benchmarks and industrial datasets, and it has been successfully deployed on Taobao Flash Shopping to enhance online recommendations.
arXiv Machine Learning
Sep 23
Lightweight Ranking Heads: Accelerating Multi-Task Experimentation in Production Recommender Systems
The paper introduces Lightweight Ranking Heads (Light Heads), a framework that allows new prediction tasks to be added to large multi-task recommender systems without retraining the backbone model. By using stop‑gradients and stateless daily training, Light Heads isolate new tasks, preventing conflicts with existing ones. Deployed at YouTube scale, the approach cuts multi‑task experimentation cycles from weeks to days, enabling faster A/B testing and deployment of new ranking tasks.
arXiv AI
Jun 2
Principled Synthetic Data Enables the First Scaling Laws for LLMs in Recommendation
arXiv:2602. 07298v3 Announce Type: replace-cross Abstract: Large Language Models (LLMs) represent a promising frontier for recommender systems, yet their development has been impeded by the absence of predictable scaling laws, which are crucial for guiding research and optimizing resource allocation.
arXiv AI
Sep 10
SequenceO1: End-to-End Ultra-Long (100K) Sequence Modeling in Recommendation with Low-Rank Caching
SequenceO1 is an end‑to‑end framework that enables ultra‑long (up to 100K interactions) sequence modeling for recommendation systems. It compresses raw user histories into a fixed‑size sketch using Sketch Attention and then models short‑term and long‑term interests with Target‑to‑History Cross Attention. The system incorporates low‑rank caching, batching, pipeline lift, and a FlashSA kernel to keep training and inference efficient, achieving consistent offline and online performance gains when deployed at full traffic on Douyin.
arXiv Machine Learning
Jul 31
OneShot: Index-in-Ranking with Neural Scoring for Large-Scale Retrieval
arXiv:2607. 27475v1 Announce Type: cross Abstract: In modern recommendation systems, retrieval serves as a primary stage responsible for filtering billions of candidate items down to thousands prior to refined ranking.
arXiv Machine Learning
Sep 23
TailSpec-EASE: Knowledge-Graph-Regularized Linear Recommendation for Web Long-Tail Discovery
TailSpec-EASE is a lightweight linear recommender that incorporates a relation‑aware spectral knowledge‑graph prior into a local closed‑form reconstruction objective. By adapting the prior strength to item popularity, it provides stronger semantic guidance for long‑tail items. Across four public benchmarks, it achieves a favorable balance of overall accuracy, long‑tail performance, and training cost, improving NDCG@20 by up to 24% over a no‑KG baseline and training in just 37 seconds on CPU compared to thousands of seconds for GPU‑based KGAT and CPU LightGCN.