y0news
AnalyticsDigestsSourcesTopicsRSSAICrypto

#recommendation-systems News & Analysis

74 articles tagged with #recommendation-systems. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.

74 articles
AIBullisharXiv – CS AI · Jun 257/10
🧠

TokenMinds: Pretrained User Tokens and Embeddings for User Understanding in Large Recommender Systems

Google researchers introduce TokenMinds, a system that generates both discrete semantic ID tokens and dense embeddings for user modeling in large-scale recommender systems. Deployed across YouTube's services handling billions of users, the approach demonstrates that semantically grounded user tokens complement traditional dense embeddings while reducing computational overhead through shared vocabulary across different content formats.

AIBullisharXiv – CS AI · Jun 237/10
🧠

Memory Is No Longer a Bottleneck: Memory-Efficient Graph Filtering for Scalable Collaborative Filtering

Researchers have developed Mem-GF, a memory-efficient graph filtering method for collaborative filtering that eliminates the need to store full item similarity graphs. The approach uses Krylov subspaces to approximate polynomial graph filters, achieving 5.74× lower memory usage and 4.38× faster runtime while maintaining or exceeding recommendation accuracy of existing methods.

AIBullisharXiv – CS AI · Jun 197/10
🧠

Token Factory: Efficiently Integrating Diverse Signals into Large Recommendation Models

Researchers introduce Token Factory, a framework that converts traditional recommendation signals into efficient 'soft tokens' for Large Recommendation Models, enabling better feature integration without excessive computational overhead or prompt bloat. The approach demonstrates practical improvements in production-scale recommendation systems by compressing heterogeneous inputs while maintaining or enhancing model performance.

AIBullisharXiv – CS AI · Jun 107/10
🧠

HiGR: Industrial-Scale Hierarchical Generative Slate Recommendation Framework in Tencent

Tencent researchers introduced HiGR, a hierarchical generative framework for slate recommendation that improves both efficiency and quality in large-scale recommendation systems. The system achieves 10% better offline performance and 5x faster inference while delivering measurable gains in user engagement metrics across Tencent platforms.

AIBearisharXiv – CS AI · Jun 97/10
🧠

Multimodal Generative Engine Optimization: Rank Manipulation for Vision-Language Model Rankers

Researchers demonstrate a critical vulnerability in Vision-Language Models (VLMs) used for ranking and recommendation systems through Multimodal Generative Engine Optimization (MGEO), showing that adversaries can manipulate ranking decisions by combining imperceptible image perturbations with crafted text. This attack exploits the deep cross-modal knowledge coupling within VLMs, revealing fundamental weaknesses in how these models ground and apply multimodal information.

AIBullisharXiv – CS AI · Jun 97/10
🧠

Kunlun: Establishing Scaling Laws for Massive-Scale Recommendation Systems through Unified Architecture Design

Meta researchers have developed Kunlun, a scalable architecture for recommendation systems that establishes predictable scaling laws by improving model efficiency from 17% to 37% on GPU utilization. The system combines low-level optimizations like Generalized Dot-Product Attention with high-level innovations to double scaling efficiency, now deployed across Meta's advertising infrastructure.

🏢 Nvidia
AIBullisharXiv – CS AI · Jun 97/10
🧠

Beyond Item IDs: Scaling Short-Form-Video Recommendation via Semantic-Native Long Sequence Modeling

Researchers present a production-deployed recommendation system that scales short-form video suggestions to billion-user scale by replacing traditional Video IDs with semantic-native representations and introducing a compression transformer to reduce computational complexity. The framework achieves order-of-magnitude improvements in memory efficiency and enables longer user behavior sequences, delivering measurable gains in user engagement and content consumption metrics.

AIBullisharXiv – CS AI · Jun 27/10
🧠

Principled Synthetic Data Enables the First Scaling Laws for LLMs in Recommendation

Researchers have developed a framework for generating high-quality synthetic data that enables Large Language Models to achieve predictable scaling laws for recommendation systems—a previously unattainable milestone. Models trained on this principled synthetic data outperform those trained on real user interaction data by 130% on key metrics, establishing a foundational methodology for scaling LLM capabilities in recommendations.

🏢 Perplexity
AIBullisharXiv – CS AI · May 297/10
🧠

LoopFM: Learning frOm HistOrical RePresentations of Foundation Model for Recommendation

LoopFM introduces a novel knowledge distillation framework that transfers rich intermediate representations from large foundation models to compact vertical models, achieving significant conversion improvements (0.5-1.22%) in industrial-scale systems by structuring FM embeddings as input features rather than relying on single scalar predictions.

AIBullisharXiv – CS AI · May 287/10
🧠

FLUID: From Ephemeral IDs to Multimodal Semantic Codes for Industrial-Scale Livestreaming Recommendation

Researchers introduced FLUID, a production-scale recommendation system that eliminates reliance on item IDs for livestreaming platforms by using multimodal semantic codes instead. Deployed across platforms with over one billion users, the system achieves significant performance gains including 2.05% improvement in cold-start room views, addressing a fundamental challenge in recommending short-lived broadcast content.

AIBearisharXiv – CS AI · May 117/10
🧠

An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation

Researchers demonstrate that a simple graph heuristic without machine learning matches or outperforms advanced generative recommendation systems on standard benchmarks, revealing that widely-used datasets contain structural shortcuts that don't require sophisticated modeling. The findings question whether current benchmark evaluations actually validate the advanced capabilities that modern recommendation systems claim to provide.

AINeutralarXiv – CS AI · Apr 67/10
🧠

Jump Start or False Start? A Theoretical and Empirical Evaluation of LLM-initialized Bandits

Research examines how Large Language Models can be used to initialize contextual bandits for recommendation systems, finding that LLM-generated preferences remain effective up to 30% data corruption but can harm performance beyond 50% corruption. The study provides theoretical analysis showing when LLM warm-starts outperform cold-start approaches, with implications for AI-driven recommendation systems.

AINeutralarXiv – CS AI · Mar 267/10
🧠

Entire Space Counterfactual Learning for Reliable Content Recommendations

Researchers developed ESCM² (Entire Space Counterfactual Multitask Model), a new framework that improves post-click conversion rate estimation in recommender systems by addressing intrinsic estimation bias and false independence assumptions. The model-agnostic approach incorporates counterfactual learning to enhance recommendation accuracy and has been validated on large-scale industrial datasets.

AIBullisharXiv – CS AI · Mar 57/10
🧠

AgentSelect: Benchmark for Narrative Query-to-Agent Recommendation

Researchers introduce AgentSelect, a comprehensive benchmark for recommending AI agent configurations based on narrative queries. The benchmark aggregates over 111,000 queries and 107,000 deployable agents from 40+ sources to address the critical gap in selecting optimal LLM agent setups for specific tasks.

AINeutralarXiv – CS AI · Mar 46/102
🧠

Beyond Factual Correctness: Mitigating Preference-Inconsistent Explanations in Explainable Recommendation

Researchers propose PURE, a new framework for AI-powered recommendation systems that addresses preference-inconsistent explanations - where AI provides factually correct but unconvincing reasoning that conflicts with user preferences. The system uses a select-then-generate approach to improve both evidence selection and explanation generation, demonstrating reduced hallucinations while maintaining recommendation accuracy.

AINeutralarXiv – CS AI · Jun 236/10
🧠

TailorMind: Towards Preference-Aligned Multimodal Content Generation

TailorMind is a new AI system that generates personalized multimodal content by combining collaborative filtering with controllable generation, addressing the gap between user preferences and available content. The researchers introduce TailorBench, a comprehensive benchmark for evaluating personalized content generation across coherence, novelty, and aesthetic dimensions, with results showing 29% recall gains in reranking tasks.

AINeutralarXiv – CS AI · Jun 196/10
🧠

Denoising Implicit Feedback for Cold-start Recommendation

Researchers propose DIF, a denoising method for recommendation systems that addresses the cold-start problem by using content similarity to infer user preferences for new items. The model-agnostic approach has been deployed at scale on Kuaishou, a billion-user platform, demonstrating significant improvements in commercial metrics for cold-start scenarios.

AINeutralarXiv – CS AI · Jun 196/10
🧠

VCG: A Multimodal Retrieval Framework for E-Commerce Video Feeds under Extreme Cold-Start Conditions

Researchers present VCG, a multimodal retrieval system that addresses the cold-start problem in e-commerce video feeds by using vision-language models to match users and videos in a shared semantic space rather than relying on behavioral history. The system achieved a 50% uplift in video completion rates during A/B testing and demonstrates that CLIP-based discriminative embeddings outperform generative LLM approaches for retrieval tasks.

AINeutralarXiv – CS AI · Jun 196/10
🧠

Bid Farewell to Seesaw: Towards Accurate Long-tail Session-based Recommendation via Dual Constraints of Hybrid Intents

Researchers propose HID, a machine learning framework that resolves the long-standing accuracy-versus-diversity trade-off in session-based recommendation systems by using hybrid intent learning and dual constraint losses. The approach identifies and filters session-irrelevant noise in long-tail items, enabling systems to boost both recommendation accuracy and diversity simultaneously rather than sacrificing one for the other.

AINeutralarXiv – CS AI · Jun 196/10
🧠

Structuring and Tokenizing Distributed User Interest Context for Generative Recommendation

Researchers introduce G2Rec, a framework that combines graph-based user behavior modeling with semantic tokenization to improve generative recommendation systems. The approach addresses scalability and context-organization limitations in existing methods, enabling more accurate prediction of user interactions at industrial scale.

AINeutralarXiv – CS AI · Jun 116/10
🧠

DiffCold: A Diffusion-based Generative Model for Cold-Start Item Recommendation

DiffCold presents a diffusion-based generative model addressing the cold-start recommendation problem in collaborative filtering systems. The approach resolves the inherent performance trade-off between new and established items by using conditional diffusion to unify their embedding representations while preserving structural integrity.

AIBullisharXiv – CS AI · Jun 96/10
🧠

Generative Reasoning Re-ranker

Researchers introduce Generative Reasoning Re-ranker (GR2), an advanced framework that leverages large language models to improve recommendation system rankings through semantic ID tokenization, high-quality reasoning traces, and reinforcement learning optimization. The system demonstrates 2.4% improvement over existing state-of-the-art methods, addressing critical scalability challenges in industrial recommendation systems.

AINeutralarXiv – CS AI · Jun 96/10
🧠

DiffoR: A Unified Continuous Generative Framework for Universal Ordinal Regression

Researchers introduce DiffOR, a novel machine learning framework that applies diffusion models to ordinal regression tasks, enabling continuous value prediction with preserved order relationships. The method addresses limitations in existing approaches by capturing semantic transitions dynamically rather than enforcing rigid boundaries, demonstrating superior performance across 12 benchmarks in recommendation systems and computer vision.

AINeutralarXiv – CS AI · Jun 96/10
🧠

TRACER: Token ReAssignment for Concept ERasure in Generative Recommendation

Researchers introduce TRACER, a novel framework for removing sensitive concepts from generative recommendation systems while preserving overall utility. The method uses token reassignment to handle the unique challenge that semantic IDs in recommendation systems are shared across items to forget and retain, unlike discrete tokens in language models.

AIBullisharXiv – CS AI · Jun 96/10
🧠

Adaptive Loss Balancing for Noise-Robust GRPO in Generative Recommendation

Researchers introduce AdaGRPO, a reinforcement learning framework that selectively applies reward signals in generative recommendation systems rather than uniformly, addressing the problem of noisy reward models trained on biased data. The approach combines supervised learning with adaptive gating mechanisms and demonstrates significant improvements in e-commerce recommendation metrics and production performance.

Page 1 of 3Next →