# recommendation systems

Machine-learning systems that select and rank items to provide users with personalized recommendations from a large collection.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## Intelligent Embedding Pruning for Large-Scale Recommendation Models

DevFeed: [Intelligent Embedding Pruning for Large-Scale Recommendation Models](<https://devfeed.tech/articles/intelligent-embedding-pruning-for-large-scale-recommendation-models-145034.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.25288>)

Author: Anish Khazane, Alex Saad-Falcon, Guanchu Wu, Marcio Porto, Jasper Shan, Fei Yu, Eugene Shulga, Intaik Park, Yongzhe Zhang, Xiaoyu Deng, Sheng Luo, Xiaoya Wang

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [recommendation systems](<https://devfeed.tech/topics/recommendation-systems.md>), [Model Optimizer](<https://devfeed.tech/topics/model-optimizer.md>)

Tags: [cardinality](<https://devfeed.tech/tags/cardinality.md>), [cost](<https://devfeed.tech/tags/cost.md>), [criteo](<https://devfeed.tech/tags/criteo.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [embedding](<https://devfeed.tech/tags/embedding.md>), [feature](<https://devfeed.tech/tags/feature.md>), [feature-importance](<https://devfeed.tech/tags/feature-importance.md>), [fewer](<https://devfeed.tech/tags/fewer.md>), [gpu](<https://devfeed.tech/tags/gpu.md>), [guidance](<https://devfeed.tech/tags/guidance.md>), [large](<https://devfeed.tech/tags/large.md>), [memory](<https://devfeed.tech/tags/memory.md>), [memory-pressure](<https://devfeed.tech/tags/memory-pressure.md>), [minimal](<https://devfeed.tech/tags/minimal.md>), [model](<https://devfeed.tech/tags/model.md>), [models](<https://devfeed.tech/tags/models.md>), [modern](<https://devfeed.tech/tags/modern.md>), [open-source](<https://devfeed.tech/tags/open-source.md>), [pruning](<https://devfeed.tech/tags/pruning.md>), [recommendation](<https://devfeed.tech/tags/recommendation.md>), [scale](<https://devfeed.tech/tags/scale.md>)

### AI overview

Feature-importance-guided in-training embedding pruning (FI-ITEP) reduces recommendation-model memory while avoiding the accuracy losses that can arise when pruning ratios are set by table-size heuristics. Across three large-scale models, it reduced total memory by 20-40% while matching or improving accuracy versus percentile-based ITEP. The abstract reports training the same models on fewer GPU trainers (for example, 112 to 80), with higher per-GPU throughput and more than 1,000 GPU-hours saved per model launch. The authors also report reproducing the trends on open-source DLRM using Criteo 1TB. The excerpt says the study quantifies training-time and GPU-cost tradeoffs, including the cost of computing feature importance, but gives no detailed results for those costs.

### Source excerpt

arXiv:2611.25288v1 Announce Type: new Abstract: Modern recommendation systems face substantial memory pressure, largely from the sparse embedding layer that maps high-cardinality categorical features into dense vectors. In-training embedding pruning (ITEP) removes less important embedding rows during training, yielding end-to-end memory savings but sometimes degrading accuracy because per-table pruning ratios are set by size-based heuristics. We use feature importance (FI) to guide these ratios (FI-ITEP), assigning higher pruning to tables tied to less important features. Across three large-scale recommendation models, FI-ITEP achieves 20--40% total memory reduction while matching or improving accuracy relative to percentile-based ITEP. Because the feature-importance signal requires minimal resources to compute, these memory savings translate into concrete systems benefits: the same models train on fewer GPU trainers (e.g., 112 to 80) with higher per-GPU throughput, saving 1,000+ GPU-hours per model launch. We reproduce these trends on the open-source DLRM (Criteo 1TB) and quantify the end-to-end training-time and GPU-cost tradeoff---including the burden of computing FI---offering practical guidance for embedding pruning in real-world systems.

## From Benchmarks to the Bench: Preference, Correspondence and Selectivity in Bidirectional Drug-Target Screening

DevFeed: [From Benchmarks to the Bench: Preference, Correspondence and Selectivity in Bidirectional Drug-Target Screening](<https://devfeed.tech/articles/from-benchmarks-to-the-bench-preference-correspondence-and-selectivity-in-bidirectional-drug-target-screening-145171.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.26369>)

Author: Jiangjie Qiu, Chengrui Xu, Xiaonan Wang

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [recommendation systems](<https://devfeed.tech/topics/recommendation-systems.md>), [Ground truth / benchmark quality](<https://devfeed.tech/topics/ground-truth-benchmark-quality.md>)

Tags: [architecture](<https://devfeed.tech/tags/architecture.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [drug-discovery](<https://devfeed.tech/tags/drug-discovery.md>), [drugs](<https://devfeed.tech/tags/drugs.md>), [hit](<https://devfeed.tech/tags/hit.md>), [interaction](<https://devfeed.tech/tags/interaction.md>), [measurements](<https://devfeed.tech/tags/measurements.md>), [model-evaluation](<https://devfeed.tech/tags/model-evaluation.md>), [models](<https://devfeed.tech/tags/models.md>), [overlap](<https://devfeed.tech/tags/overlap.md>), [predictions](<https://devfeed.tech/tags/predictions.md>), [random](<https://devfeed.tech/tags/random.md>), [recommendations](<https://devfeed.tech/tags/recommendations.md>), [targets](<https://devfeed.tech/tags/targets.md>), [test](<https://devfeed.tech/tags/test.md>), [training](<https://devfeed.tech/tags/training.md>)

### AI overview

Across 13 released drug-target interaction systems, Top-10 recommendations often differed sharply: for the same target, 77.8% of model-pair comparisons had no molecule overlap; for the same drug, 70.1% had no protein overlap. Published inhibition measurements showed that some systems enriched active candidates, but their hit yields changed little across different drugs or targets, and some rarely ranked both molecules and kinases correctly when drugs favoured different kinases. Other systems lost more hits when recommendations were matched to different screening contexts. Retraining one architecture with the same data and objective but different random seeds produced similar test performance yet only about two shared candidates on average between Top-10 lists in a separate catalogue. The findings suggest benchmark performance alone may not establish whether rankings can guide experimental choices.

### Source excerpt

arXiv:2611.26369v1 Announce Type: new Abstract: Identifying active molecules for known targets and potential targets for existing drugs is central to drug discovery and repurposing. Drug-target interaction (DTI) models can rank vast numbers of drug-target pairs, but limited experimental capacity restricts testing to a small number of candidates. We compared the bidirectional recommendations of 13 released systems across 711 molecular structures of FDA-approved drugs and 614 human proteins. For the same target or drug, pairs of models produced completely disjoint Top-10 molecule and protein lists in 77.8% and 70.1% of comparisons, respectively. Even where recommendations overlapped, agreement between some systems largely reflected recurring preferences for the same candidates. Published inhibition measurements for 79 molecules and 65 kinases revealed that some systems enriched active candidates, yet their hit yields changed little when recommendations were matched to different drugs or targets, whereas other systems lost substantially more hits. Some of the former systems also rarely ranked both molecules and kinases correctly when two drugs favoured different kinases. We further retrained the same architecture on the same data, with the training objective fixed and random seeds varied. Despite similar test performance, mean pairwise Top-10 overlap on a separate screening catalogue was about two candidates. Our study moves DTI model evaluation beyond benchmark performance to assess whether model predictions can guide meaningful experimental decisions in drug discovery and target identification.

## LLM4Rail: An LLM-Augmented Personalized Railway Services Platform

DevFeed: [LLM4Rail: An LLM-Augmented Personalized Railway Services Platform](<https://devfeed.tech/articles/llm4rail-an-llm-augmented-personalized-railway-services-platform-145306.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2507.23377>)

Author: Zhuo Li, Xianghuai Deng, Chiwei Feng, Hanmeng Li, Shenjie Wang, Junchao Fan, Jiaxing Shen, Zhiyuan Wen, Longxiang Gao, Linchun Wu

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [recommendation systems](<https://devfeed.tech/topics/recommendation-systems.md>), [llm-reasoning](<https://devfeed.tech/topics/llm-reasoning.md>), [function calling](<https://devfeed.tech/topics/function-calling.md>), [Large Language Model](<https://devfeed.tech/topics/llm.md>), [AI Chat](<https://devfeed.tech/topics/ai-chat.md>)

Tags: [alignment](<https://devfeed.tech/tags/alignment.md>), [arguments](<https://devfeed.tech/tags/arguments.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [dataset](<https://devfeed.tech/tags/dataset.md>), [food](<https://devfeed.tech/tags/food.md>), [framework](<https://devfeed.tech/tags/framework.md>), [generation](<https://devfeed.tech/tags/generation.md>), [generative](<https://devfeed.tech/tags/generative.md>), [language](<https://devfeed.tech/tags/language.md>), [large-language-models-llms](<https://devfeed.tech/tags/large-language-models-llms.md>), [llm](<https://devfeed.tech/tags/llm.md>), [llms](<https://devfeed.tech/tags/llms.md>), [mechanism](<https://devfeed.tech/tags/mechanism.md>), [modules](<https://devfeed.tech/tags/modules.md>), [novel](<https://devfeed.tech/tags/novel.md>), [platform](<https://devfeed.tech/tags/platform.md>), [railway](<https://devfeed.tech/tags/railway.md>), [service](<https://devfeed.tech/tags/service.md>), [services](<https://devfeed.tech/tags/services.md>), [similarity](<https://devfeed.tech/tags/similarity.md>), [system](<https://devfeed.tech/tags/system.md>)

### AI overview

LLM4Rail is a personalized railway-services platform with modules for ticket and weather inquiries, onboard food and drink recommendations, and casual conversation. Its iterative ER-QTAO framework uses Experience Storage and Retrieval and Diagnostic Observation Generation to help the LLM call external tools with complex arguments. For catering, the authors introduce the Chinese Railway Food & Drink dataset, organized by city, cuisine, age group, and spiciness, and a zero-shot conversational recommender. A feature-similarity alignment mechanism is intended to keep generated recommendations matched to dataset entries.

### Source excerpt

arXiv:2507.23377v2 Announce Type: replace Abstract: Large language models (LLMs) have significantly reshaped different walks of business. To meet the increasing demands for individualized railway service, we develop LLM4Rail - a novel LLM-augmented personalized railway services platform. Empowered by the LLM, LLM4Rail provides dedicated modules for ticket and weather inquiries, food & drink recommendations, and casual conversation. In LLM4Rail, we propose the iterative "Experience-Retrieval Question-Thought-Action-Observation (ER-QTAO)" reasoning framework. It introduces two key mechanisms, Experience Storage and Retrieval (ESR) and Diagnostic Observation Generation (DOG), to enhance the LLM's ability to invoke appropriate external tools with complex arguments. To provide personalized onboard dining services, we first construct the Chinese Railway Food & Drink (CRFD) dataset, which covers a wide range of signature dishes categorized by city, cuisine, age group, and spiciness level, and then develop an LLM-based zero-shot conversational recommender system for railway catering. In addition, to address the unconstrained nature of generative recommendations, we design a feature-similarity-based alignment mechanism to ensure that all recommended items are aligned with entries in the CRFD dataset.

## Designing Algorithmic Recommendations to Achieve Human-AI Complementarity

DevFeed: [Designing Algorithmic Recommendations to Achieve Human-AI Complementarity](<https://devfeed.tech/articles/designing-algorithmic-recommendations-to-achieve-human-ai-complementarity-144848.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2405.01484>)

Author: Bryce McLaughlin, Jann Spiess

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [recommendation systems](<https://devfeed.tech/topics/recommendation-systems.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [human computer interaction](<https://devfeed.tech/topics/human-computer-interaction.md>), [Human-AI evaluation](<https://devfeed.tech/topics/human-ai-evaluation.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [algorithms](<https://devfeed.tech/tags/algorithms.md>), [causal-inference](<https://devfeed.tech/tags/causal-inference.md>), [choice](<https://devfeed.tech/tags/choice.md>), [cs-hc](<https://devfeed.tech/tags/cs-hc.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [econ-em](<https://devfeed.tech/tags/econ-em.md>), [experiment](<https://devfeed.tech/tags/experiment.md>), [hiring](<https://devfeed.tech/tags/hiring.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [recommendation-algorithms](<https://devfeed.tech/tags/recommendation-algorithms.md>), [recommendations](<https://devfeed.tech/tags/recommendations.md>), [stat-ml](<https://devfeed.tech/tags/stat-ml.md>), [training-data](<https://devfeed.tech/tags/training-data.md>)

### AI overview

The paper models how algorithmic recommendations affect a human decision-maker's binary treatment choice, instead of evaluating algorithms only by their predictions. Using potential outcomes and a connection to instrumental variables, it introduces a monotonicity assumption that classifies responses by compliance with recommendations and the decision a person would make without one. An online experiment simulating hiring illustrates how this framework can explain relative performance across recommendation algorithms. The authors also derive maximin-optimal algorithms that can be implemented with machine learning using limited training data. The supplied text does not report specific experimental results.

### Source excerpt

arXiv:2405.01484v3 Announce Type: replace-cross Abstract: Algorithms frequently assist, rather than replace, human decision-makers. However, the design and analysis of algorithms often focus on predicting outcomes and do not explicitly model their effect on human decisions. This discrepancy between the design and role of algorithmic assistants becomes particularly concerning in light of empirical evidence that suggests that algorithmic assistants again and again fail to improve human decisions. In this article, we formalize the design of recommendation algorithms that assist human decision-makers without making restrictive ex-ante assumptions about how recommendations affect decisions. We formulate an algorithmic-design problem that leverages the potential-outcomes framework from causal inference to model the effect of recommendations on a human decision-maker's binary treatment choice. Within this model, we make a connection between algorithmic recommendations and instrumental variables. Leveraging this connection, we introduce a monotonicity assumption that leads to an intuitive classification of human responses to the algorithm. Under this assumption, we can express the human's response to algorithmic recommendations in terms of their compliance with the algorithm and the active decision they would take if the algorithm sends no recommendation. We showcase the utility of our framework using an online experiment that simulates a hiring task. We argue that our approach can make sense of the relative performance of different recommendation algorithms in the experiment and can help design solutions that realize human-AI complementarity. Finally, we leverage our approach to derive maximin-optimal recommendation algorithms that can be implemented with machine learning using limited training data.

## From Sessions to Serving: Integrating LLM-Based Embeddings into Retrieval for Production Content Recommendation

DevFeed: [From Sessions to Serving: Integrating LLM-Based Embeddings into Retrieval for Production Content Recommendation](<https://devfeed.tech/articles/from-sessions-to-serving-integrating-llm-based-embeddings-into-retrieval-for-production-content-recommendation-145141.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.26096>)

Author: Zhixiong Hu, Meng Li, Maggie Zhang, Deborshi Goswami, David Bailey, James Bradley

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [recommendation systems](<https://devfeed.tech/topics/recommendation-systems.md>), [Embeddings](<https://devfeed.tech/topics/embeddings.md>), [Large Language Model](<https://devfeed.tech/topics/llm.md>), [information retrieval](<https://devfeed.tech/topics/information-retrieval.md>), [personalization](<https://devfeed.tech/topics/personalization.md>), [AI Integration Strategies](<https://devfeed.tech/topics/ai-integration-strategies.md>)

Tags: [cs-ir](<https://devfeed.tech/tags/cs-ir.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [embeddings](<https://devfeed.tech/tags/embeddings.md>), [llm](<https://devfeed.tech/tags/llm.md>), [production](<https://devfeed.tech/tags/production.md>), [recommendation](<https://devfeed.tech/tags/recommendation.md>), [retrieval](<https://devfeed.tech/tags/retrieval.md>), [serving](<https://devfeed.tech/tags/serving.md>)

### AI overview

LSER adds session- and history-level embeddings from a pretrained LLM as auxiliary user-side signals in the retrieval-stage user tower, alongside existing learned sequence encoders. For freshness as behavior changes, an asynchronous nearline serving path refreshes sequential and LLM-derived user vectors for the recommendation server. An ablation across a multi-content-type catalog indicates the LLM features can improve model performance, and the authors report that this approach is technically feasible in production. The excerpt gives no quantitative results or details of the serving implementation.

### Source excerpt

arXiv:2611.26096v1 Announce Type: cross Abstract: Personalized content recommendation on large marketplace websites must reconcile heterogeneous candidate content (e.g., customer stories, product pages, industry pages, and learning content) with sparse, fast-changing user behavior, placing increasing demands on the retrieval stage to represent user interest well, not just the downstream ranking stage. We present LSER (LLM Session Embedding Retrieval), a production content recommendation system for autodesk.com that derives session- and history-level embeddings from a pretrained large language model (LLM) and adds them as auxiliary user-side features in the retrieval-stage user tower alongside existing learned sequence encoders. To keep user-side embeddings fresh under real-time behavior, we build a nearline serving path that asynchronously refreshes sequential and LLM-derived user vectors for our main content recommendation server. We validate the incremental value of the LLM features through an ablation study across our full multi-content-type catalog. Our results indicate that integrating LLM-derived embeddings as additional retrieval signals, together with production-grade nearline serving, is technically feasible and can improve model performances.

## Learning Generative Ranking Policies for Whole-Page Optimization

DevFeed: [Learning Generative Ranking Policies for Whole-Page Optimization](<https://devfeed.tech/articles/learning-generative-ranking-policies-for-whole-page-optimization-145066.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.25527>)

Author: Chen Qiu, Zhigang Hua, Qi Xu, Jizhe Zhang, Sha Hua, Ren Mao, Luke Simon

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [recommendation systems](<https://devfeed.tech/topics/recommendation-systems.md>), [information retrieval](<https://devfeed.tech/topics/information-retrieval.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Combinatorial optimization](<https://devfeed.tech/topics/combinatorial-optimization.md>)

Tags: [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-ir](<https://devfeed.tech/tags/cs-ir.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [generative](<https://devfeed.tech/tags/generative.md>), [improvement](<https://devfeed.tech/tags/improvement.md>), [learning](<https://devfeed.tech/tags/learning.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [pages](<https://devfeed.tech/tags/pages.md>), [policies](<https://devfeed.tech/tags/policies.md>), [ranking](<https://devfeed.tech/tags/ranking.md>), [recommendation](<https://devfeed.tech/tags/recommendation.md>)

### AI overview

The paper proposes whole-page policy improvement for recommendation ranking, choosing and ordering items jointly because items can compete for attention or complement one another. Its local page-level objective repeatedly moves the generator toward higher-scoring pages and splits into a target for each position: at the same partial page, candidates are compared by the scores of the complete pages they lead to. This aims to train each choice for its contribution to the whole page. The authors report better results than evaluated generative re-ranking baselines on KuaiRand-1K, RL4RS-SeqSlate, and an industrial logged-page dataset, and performance closest to the known optimum on a synthetic benchmark. The supplied text does not provide metric values or experimental details.

### Source excerpt

arXiv:2611.25527v1 Announce Type: cross Abstract: A recommendation page is consumed as a whole: the items on it compete for attention and complement one another, so the best page is not simply the individually best items placed side by side. We study whole-page optimization, which selects and orders the items on a page jointly to maximize the score of the page. The number of possible pages grows combinatorially, so good pages must be generated rather than enumerated. Some generative re-ranking methods use the same page-level training signal for every choice in a sampled page. Others imitate target pages built before training, which remain largely fixed as the generator improves. We address both limitations with one local page-level objective, which repeatedly moves the current generator toward pages with higher score. This objective splits exactly into one training target per position, and each target compares candidates at the same partial page by the scores of the complete pages they lead to. Every position therefore learns to choose the item that is better for the whole page, rather than the item that looks best on its own. We call this procedure whole-page policy improvement. On two public datasets, KuaiRand-1K and RL4RS-SeqSlate, which cover multi-objective item selection and constrained ordering, and on an industrial dataset of logged pages, our method outperforms the evaluated generative re-ranking baselines. On a synthetic benchmark with a known optimal page, it also comes closest to the optimum, showing that its improvements come from better whole-page decisions.

## Learning Multinomial Logits in $O(n \\log n)$ time

DevFeed: [Learning Multinomial Logits in $O(n \\log n)$ time](<https://devfeed.tech/articles/learning-multinomial-logits-in-o-n-log-n-time-144870.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2601.04423>)

Author: Flavio Chierichetti, Mirko Giacchini, Ravi Kumar, Silvio Lattanzi, Alessandro Panconesi, Erasmo Tani, Andrew Tomkins

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [recommendation systems](<https://devfeed.tech/topics/recommendation-systems.md>)

Tags: [adaptive](<https://devfeed.tech/tags/adaptive.md>), [algorithms](<https://devfeed.tech/tags/algorithms.md>), [choice](<https://devfeed.tech/tags/choice.md>), [conditional](<https://devfeed.tech/tags/conditional.md>), [cs-ds](<https://devfeed.tech/tags/cs-ds.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [distribution](<https://devfeed.tech/tags/distribution.md>), [error](<https://devfeed.tech/tags/error.md>), [learning](<https://devfeed.tech/tags/learning.md>), [lower-bounds](<https://devfeed.tech/tags/lower-bounds.md>), [math-st](<https://devfeed.tech/tags/math-st.md>), [model](<https://devfeed.tech/tags/model.md>), [queries](<https://devfeed.tech/tags/queries.md>), [recommender-system](<https://devfeed.tech/tags/recommender-system.md>), [sampling](<https://devfeed.tech/tags/sampling.md>), [stat-ml](<https://devfeed.tech/tags/stat-ml.md>), [stat-th](<https://devfeed.tech/tags/stat-th.md>)

### AI overview

For an MNL model queried on item slates, adaptive learning achieves total variation error ε for every slate with O(n log n/ε²) queries; a matching Ω(n log n/ε²) lower bound makes this optimal. A second adaptive algorithm gives multiplicative 1±ε accuracy, except on subsets of mass below ε, using O(n log n/ε³) queries, also matching its lower bound. The non-adaptive multiplicative-error algorithm uses O(n² log n log(n/ε)/ε³) queries; the stated Ω(n² log n/ε²) lower bound leaves it almost tight in n, within a log n factor.

### Source excerpt

arXiv:2601.04423v2 Announce Type: replace-cross Abstract: A Multinomial Logit (MNL) model is composed of a finite universe of items $[n]=\{1,\dots,n\}$, each assigned a positive weight. A query specifies an admissible subset---called a slate---and the model chooses one item from that slate with probability proportional to its weight. This query model is also known as the Plackett--Luce model or conditional sampling oracle in the literature. Although MNLs have been studied extensively, a basic computational question remains open: given query access to slates, how efficiently can we learn weights so that, for every slate, the induced choice distribution is within total variation distance $\varepsilon$ of the ground truth? This question is central to MNL learning and has direct implications for modern recommender system interfaces. We provide both adaptive and non-adaptive algorithms for this task. Our first adaptive algorithm makes $O(\frac{n\log n}{\varepsilon^2})$ queries and learns every choice distribution in total variation distance $\varepsilon$. We also provide a second adaptive algorithm that with $O(\frac{n \log n}{\varepsilon^3})$ queries provides a stronger guarantee: each choice distribution is approximated to a multiplicative $1\pm\varepsilon$ error (except for subsets of mass smaller than $\varepsilon$). We complement these algorithms with lower bounds of $\Omega(\frac{n\log n}{\varepsilon^2})$ for total variation distance and $\Omega(\frac{n \log n}{\varepsilon^3})$ for the multiplicative error guarantee, showing the optimality of our adaptive algorithms. Our non-adaptive algorithm makes $O\left(\frac{n^{2}}{\varepsilon^{3}}\log n \log\frac{n}{\varepsilon}\right)$ queries to obtain guarantees under the multiplicative error notion. We complement this result with an $\Omega(\frac{n^2 \log n}{\varepsilon^2})$ lower bound for any non-adaptive algorithm, showing that our algorithm is almost tight in $n$ (within a $\log n$ factor).

## MLE Agents: Autonomous ML Engineering in Large-scale Recommendation Systems

DevFeed: [MLE Agents: Autonomous ML Engineering in Large-scale Recommendation Systems](<https://devfeed.tech/articles/mle-agents-autonomous-ml-engineering-in-large-scale-recommendation-systems-142723.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.23910>)

Author: Matthew Li, Albert Liang, Dilip Raj

Published: 2026-11-19T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [agentic workflows](<https://devfeed.tech/topics/agentic-workflows.md>), [recommendation systems](<https://devfeed.tech/topics/recommendation-systems.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Model Development](<https://devfeed.tech/topics/model-development.md>), [Large Language Model](<https://devfeed.tech/topics/llm.md>)

Tags: [agents](<https://devfeed.tech/tags/agents.md>), [autonomous](<https://devfeed.tech/tags/autonomous.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [engineering](<https://devfeed.tech/tags/engineering.md>), [industry](<https://devfeed.tech/tags/industry.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [recommendation](<https://devfeed.tech/tags/recommendation.md>), [recommendation-systems](<https://devfeed.tech/tags/recommendation-systems.md>)

### AI overview

Human-on-the-loop MLE agents proposed, implemented, trained, and evaluated changes to large-scale search rankers, while engineers retained control of objectives, search direction, and final review. To address experiments taking hours, offline metrics that may not predict online impact, and diminishing gains, the system used parallel training, an objective calibrated to online impact, and careful context engineering. In one campaign, 325 of 1,097 completed candidate experiments were accepted (29.6%), versus 15.6% in an earlier campaign with a different objective and search constraint. The best model increased search volume by 0.23% in a large-scale A/B test. The authors report that some gains came from previously untried architectural changes and emphasize that the harness around the model matters alongside the underlying model.

### Source excerpt

arXiv:2611.23910v1 Announce Type: new Abstract: The typical workflow for improving large-scale ranking and recommendation models is slow and tedious: an engineer forms a hypothesis, implements it as a code change, trains a model, and evaluates it both offline and online, often relying on their own intuition and experience along the way. Autonomous LLM agents promise to speed this up by running the loop on their own, but it is still unclear whether they can do this in industry-scale systems rather than on benchmarks or small proxy tasks. We build human-on-the-loop machine learning engineer (MLE) agents that propose, implement, train, and evaluate model changes on large-scale search rankers. Engineers retain control over objective design, search direction, and final-model review. We identify three obstacles that make this industry setting challenging: feedback takes hours per experiment, offline metrics do not always predict online impact, and improvements saturate after the early wins. We address these with parallel training runs, an objective calibrated to match online impact, and careful context engineering. In one campaign, the system ran 1,097 completed candidate experiments and accepted 325, a 29.6\% acceptance rate compared with 15.6\% in the earlier campaign under a different objective and search constraint. Its best model increases search volume by 0.23\% in an A/B test of large scale. Several improvements were architectural changes the team had never tried, drawn from the broader industry and literature, suggesting that MLE agents can explore regions of the design space that human intuition overlooks. We find that the design of the harness around the model matters: intuition suggests that a stronger underlying model is enough, but in our experience, the design of the loop around it is just as critical. More broadly, our work shows that autonomous agents can do real machine-learning engineering in industry-scale systems.

## Co-Pilot for Health: Personalized Algorithmic AI Nudging to Improve Health Outcomes

DevFeed: [Co-Pilot for Health: Personalized Algorithmic AI Nudging to Improve Health Outcomes](<https://devfeed.tech/articles/co-pilot-for-health-personalized-algorithmic-ai-nudging-to-improve-health-outcomes-142487.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2401.10816>)

Author: Jodi Chiam, Aloysius Lim, Cheryl Nott, Nicholas Mark, Ankur Teredesai, Sunil Shinde

Published: 2026-11-19T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [recommendation systems](<https://devfeed.tech/topics/recommendation-systems.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Sports](<https://devfeed.tech/topics/sports.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-hc](<https://devfeed.tech/tags/cs-hc.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [gnn](<https://devfeed.tech/tags/gnn.md>), [health](<https://devfeed.tech/tags/health.md>), [platform](<https://devfeed.tech/tags/platform.md>), [recommendation-system](<https://devfeed.tech/tags/recommendation-system.md>)

### AI overview

A Graph Neural Network based recommendation system used wearable fitness data to send personalized, context-aware daily health nudges to 84,764 people in Singapore over 12 weeks. Compared with matched controls who received no nudges, recipients increased daily step count by 6.17% (p = 3.09x10⁻⁴) and weekly moderate-to-vigorous physical activity by 7.61% (p = 1.16x10⁻²). The abstract reports that 13.1% of nudges were opened; among opened nudges, 11.7% were rated useful and 1.9% not useful. These results describe the reported study and do not establish outcomes beyond its population and period.

### Source excerpt

arXiv:2401.10816v3 Announce Type: replace-cross Abstract: The ability to shape health behaviors of large populations automatically, across wearable types and disease conditions at scale has tremendous potential to improve global health outcomes. We designed and implemented an AI driven platform for digital algorithmic nudging, enabled by a Graph-Neural Network (GNN) based Recommendation System, and granular health behavior data from wearable fitness devices. Here we describe the efficacy results of this platform with its capabilities of personalized and contextual nudging to $n=84,764$ individuals over a 12-week period in Singapore. We statistically validated that participants in the target group who received such AI optimized daily nudges increased daily physical activity like step count by 6.17% ($p = 3.09\times10^{-4}$) and weekly minutes of Moderate to Vigorous Physical Activity (MVPA) by 7.61% ($p = 1.16\times10^{-2}$), compared to matched participants in control group who did not receive any nudges. Further, such nudges were very well received, with a 13.1% of nudges sent being opened (open rate), and 11.7% of the opened nudges rated useful compared to 1.9% rated as not useful thereby demonstrating significant improvement in population level engagement metrics.

## KnowMe Paper Radar: Lightweight Discovery of Promising Papers in the Age of Autoresearch

DevFeed: [KnowMe Paper Radar: Lightweight Discovery of Promising Papers in the Age of Autoresearch](<https://devfeed.tech/articles/knowme-paper-radar-lightweight-discovery-of-promising-papers-in-the-age-of-autoresearch-142693.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.23702>)

Author: Zhuo Chen, Jian Wang, Jinjie Gu, Lijun Wu

Published: 2026-11-19T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [recommendation systems](<https://devfeed.tech/topics/recommendation-systems.md>), [AI-driven information retrieval](<https://devfeed.tech/topics/ai-driven-information-retrieval.md>), [Cache](<https://devfeed.tech/topics/cache.md>)

Tags: [abstract](<https://devfeed.tech/tags/abstract.md>), [acquisition](<https://devfeed.tech/tags/acquisition.md>), [agents](<https://devfeed.tech/tags/agents.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [authors](<https://devfeed.tech/tags/authors.md>), [automatic](<https://devfeed.tech/tags/automatic.md>), [autoresearch](<https://devfeed.tech/tags/autoresearch.md>), [browser](<https://devfeed.tech/tags/browser.md>), [cache](<https://devfeed.tech/tags/cache.md>), [capabilities](<https://devfeed.tech/tags/capabilities.md>), [cli](<https://devfeed.tech/tags/cli.md>), [collaboration](<https://devfeed.tech/tags/collaboration.md>), [command-line](<https://devfeed.tech/tags/command-line.md>), [command-line-interface](<https://devfeed.tech/tags/command-line-interface.md>), [component](<https://devfeed.tech/tags/component.md>), [context](<https://devfeed.tech/tags/context.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-ir](<https://devfeed.tech/tags/cs-ir.md>), [discovery](<https://devfeed.tech/tags/discovery.md>), [lightweight](<https://devfeed.tech/tags/lightweight.md>), [paper](<https://devfeed.tech/tags/paper.md>), [papers](<https://devfeed.tech/tags/papers.md>)

### AI overview

KnowMe Paper Radar ranks papers for a reader's current research questions by combining topical relevance and recency with author research histories, collaboration paths, and direction-specific institutional context. Users set topics, priorities, exclusions, and dates; exposed score components and sources help explain priorities and surface work beyond familiar authors. Automatic acquisition, version merging, and graph-cache reuse support routine use without LLM inference. On 174,640 acquired records, repeated context preparation was more than three times faster; cached abstracts raised NDCG@10 from 0.412 to 0.598 on expert-judged retrieval tasks. The abstract also reports analyses of semantic retrieval, research-history modeling, and literature-grounded planning, with browser and structured CLI interfaces for researchers and research agents.

### Source excerpt

arXiv:2611.23702v1 Announce Type: new Abstract: The growing volume of topically similar papers makes it difficult to identify new work that can offer useful research insights or methodological guidance. We present KnowMe Paper Radar, a lightweight discovery tool that combines multiple sources of evidence into personalized reading priorities. Users specify topics, priorities, exclusions and dates; the system brings together topical relevance, recency, author research histories, collaboration paths and direction-specific institutional context. By exposing each score component and its supporting sources, KnowMe helps readers select promising papers for their current questions and discover relevant work beyond familiar authors. Automatic acquisition, version merging and graph-cache reuse keep this workflow convenient without large language model (LLM) inference during ordinary use. Experiments on 174,640 acquired records show more than threefold faster repeated context preparation, while cached abstracts improve normalized discounted cumulative gain at rank 10 (NDCG@10) from 0.412 to 0.598 on expert-judged retrieval tasks. Complementary analyses examine how the same accumulated records support semantic retrieval, research-history modeling and literature-grounded planning. A browser interface and a structured command-line interface (CLI) make these capabilities available to both researchers and research agents, positioning KnowMe as a practical upstream tool for literature-informed recursive self-improvement (RSI) workflows.

## LLM-Assisted Reranking to Operationalize Nuanced Objectives in Recommender Systems

DevFeed: [LLM-Assisted Reranking to Operationalize Nuanced Objectives in Recommender Systems](<https://devfeed.tech/articles/llm-assisted-reranking-to-operationalize-nuanced-objectives-in-recommender-systems-142527.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2606.02883>)

Author: Amir Ghasemian, Homa Hosseinmardi, Upasana Dutta, Duncan J. Watts

Published: 2026-11-19T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [recommendation systems](<https://devfeed.tech/topics/recommendation-systems.md>), [personalization](<https://devfeed.tech/topics/personalization.md>)

Tags: [abstract](<https://devfeed.tech/tags/abstract.md>), [alignment](<https://devfeed.tech/tags/alignment.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cy](<https://devfeed.tech/tags/cs-cy.md>), [cs-hc](<https://devfeed.tech/tags/cs-hc.md>), [cs-ir](<https://devfeed.tech/tags/cs-ir.md>), [diversity](<https://devfeed.tech/tags/diversity.md>), [elections](<https://devfeed.tech/tags/elections.md>), [embedding](<https://devfeed.tech/tags/embedding.md>), [engagement](<https://devfeed.tech/tags/engagement.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [guardrails](<https://devfeed.tech/tags/guardrails.md>), [immigration](<https://devfeed.tech/tags/immigration.md>), [inequality](<https://devfeed.tech/tags/inequality.md>), [language](<https://devfeed.tech/tags/language.md>), [language-models](<https://devfeed.tech/tags/language-models.md>), [large-language-models](<https://devfeed.tech/tags/large-language-models.md>), [large-language-models-llms](<https://devfeed.tech/tags/large-language-models-llms.md>), [lightweight](<https://devfeed.tech/tags/lightweight.md>), [llm](<https://devfeed.tech/tags/llm.md>), [llm-assisted](<https://devfeed.tech/tags/llm-assisted.md>), [personalization](<https://devfeed.tech/tags/personalization.md>), [recommender-systems](<https://devfeed.tech/tags/recommender-systems.md>), [reranking](<https://devfeed.tech/tags/reranking.md>)

### AI overview

Using real YouTube recommendation trajectories, the study reranks sidebar candidates with zero-shot prompts to three LLMs and compares them with an embedding baseline. Pure personalization improves relevance but narrows ideological exposure; two models also promote problematic content for users whose histories include it. The third model declines the most explicitly partisan requests, suggesting model-specific guardrails. Lightweight prompt constraints substantially reduce problematic exposure across all three models while keeping relevance above the platform baseline. Synthetic tests find no universal preference for topical versus partisan cues: topic dominates for abortion and immigration, while partisanship dominates for elections, where topical signals are weaker. The findings support evaluating LLM-assisted recommendations for social effects as well as relevance, and treating prompt design as a value-laden choice.

### Source excerpt

arXiv:2606.02883v2 Announce Type: replace-cross Abstract: Recommender systems shape what information we see, raising concerns about filter bubbles, radicalization, polarization, and social inequality. Large language models (LLMs) enable more powerful personalization that may intensify these dynamics, yet most recommenders are tuned for engagement or narrow accuracy metrics, with little attention to broader social effects. We investigate whether LLM-assisted reranking, while improving personalization, inadvertently amplifies exposure to ideologically congenial, extreme, or conspiratorial political content, a risk theorized but not yet empirically characterized. Using real YouTube trajectories, we rerank the platform's sidebar candidates by zero-shot prompting across three models, alongside an embedding baseline, and evaluate relevance, ideological alignment and diversity, and exposure to conspiratorial or extremist content. We find that (i) under a pure personalization instruction, reranking improves relevance while narrowing ideological exposure and, on two of three models, promoting problematic content for users with such histories; the third model, which declines most explicitly partisan requests, points to model-specific guardrails; (ii) lightweight prompt-level constraints substantially reduce problematic exposure on all three models, while the regularized rerankers still rank above the platform baseline on relevance; and (iii) synthetic experiments varying topical and partisan cues independently show no fixed preference between them: topic dominates on abortion and immigration, while partisanship takes over on elections, where the topical signal is weaker. Our results highlight the power of LLMs to operationalize contextual nuance in high-stakes political recommendation, and underscore the need to evaluate LLM-assisted personalization beyond accuracy and to treat prompt design as a value-laden choice rather than a neutral default.

## RecHarness: A Bandit-Routed Agentic Harness for Self-Evolving Recommender Systems

DevFeed: [RecHarness: A Bandit-Routed Agentic Harness for Self-Evolving Recommender Systems](<https://devfeed.tech/articles/recharness-a-bandit-routed-agentic-harness-for-self-evolving-recommender-systems-139798.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2607.29241>)

Author: Haoran Ling, Yuecheng Li, Zeyu Song, Jing Yao, Shuwen Kang, Songcheng Ren, Chi Lu, Wenjin Wu, Peng Jiang

Published: 2026-11-18T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [recommendation systems](<https://devfeed.tech/topics/recommendation-systems.md>), [Agent Harness](<https://devfeed.tech/topics/agent-harness.md>), [Model Development](<https://devfeed.tech/topics/model-development.md>), [thompson sampling](<https://devfeed.tech/topics/thompson-sampling.md>), [Large Language Model](<https://devfeed.tech/topics/llm.md>)

Tags: [advertising](<https://devfeed.tech/tags/advertising.md>), [agentic](<https://devfeed.tech/tags/agentic.md>), [bandit](<https://devfeed.tech/tags/bandit.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cl](<https://devfeed.tech/tags/cs-cl.md>), [cs-ir](<https://devfeed.tech/tags/cs-ir.md>), [harness](<https://devfeed.tech/tags/harness.md>), [recommender-systems](<https://devfeed.tech/tags/recommender-systems.md>)

### AI overview

RecHarness separates recommender optimization into direction selection and implementation: a bandit router uses historical validation feedback to choose a modification direction, then an LLM proposes a hypothesis and executable code edit within it. When local edits stagnate, a jump-basin mechanism activates a structural-jump option. The abstract reports more consistent gains and better use of limited trials than LLM-directed search across multiple tasks, datasets, and model backbones. In a 7-day A/B test on a large-scale short-video advertising platform, the selected candidate increased ADVV by 2.084%, revenue by 0.534%, and exposure by 0.559%. These are abstract-level claims; no experimental details are provided here.

### Source excerpt

arXiv:2607.29241v2 Announce Type: replace-cross Abstract: Optimizing recommender models remains heavily reliant on manual iteration over architectures, objectives, and training strategies. While LLM-based agents can automate this trial-and-error process, relying on LLMs to both select modification directions and formulate concrete hypotheses can lead to unstable search under limited trial budgets. Inspired by the above challenge, we propose RecHarness, a Bandit-Routed Agentic Harness for automated recommender model optimization. RecHarness decouples the optimization process into two steps: a bandit router selects the next modification direction according to historical validation feedback, while the LLM generates a concrete optimization hypothesis and executable code edit within the selected direction. To sustain long-horizon exploration, RecHarness uses a jump-basin mechanism to activate a structural-jump arm when local edits stagnate. Across multiple recommendation tasks, datasets, and model backbones, RecHarness achieves more consistent performance improvements and uses limited trial budgets more effectively than LLM-directed search. During a 7-day online A/B test on a large-scale short-video advertising platform, the selected candidate improves ADVV by 2.084%, Revenue by 0.534%, and Exposure by 0.559%. Code is available at: https://github.com/6lyc/RecHarness.

## Engineering AI Discover

DevFeed: [Engineering AI Discover](<https://devfeed.tech/articles/engineering-ai-discover-139631.md>)

Original publisher: [Read original article](<https://netflixtechblog.com/engineering-ai-discover-e244944cdc38?source=rss----2615bd06b42e---4>)

Author: Netflix Technology Blog

Published: 2026-11-17T17:01:02Z

Content type: article

Language: en

Sources: [Netflix](<https://devfeed.tech/sources/netflix-techblog-medium.md>)

Topics: [recommendation systems](<https://devfeed.tech/topics/recommendation-systems.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [ReAct agent Python](<https://devfeed.tech/topics/react-agent-python.md>), [LLM observability](<https://devfeed.tech/topics/llm-observability.md>), [AI Context Management](<https://devfeed.tech/topics/ai-context-management.md>), [Production Engineering](<https://devfeed.tech/topics/production-engineering.md>), [LLM security](<https://devfeed.tech/topics/llm-security.md>)

Tags: [agent](<https://devfeed.tech/tags/agent.md>), [agent-harness](<https://devfeed.tech/tags/agent-harness.md>), [ai](<https://devfeed.tech/tags/ai.md>), [ai-agent](<https://devfeed.tech/tags/ai-agent.md>), [app](<https://devfeed.tech/tags/app.md>), [artificial-intelligence](<https://devfeed.tech/tags/artificial-intelligence.md>), [challenges](<https://devfeed.tech/tags/challenges.md>), [code](<https://devfeed.tech/tags/code.md>), [discovery](<https://devfeed.tech/tags/discovery.md>), [engineering](<https://devfeed.tech/tags/engineering.md>), [engineering-ai](<https://devfeed.tech/tags/engineering-ai.md>), [generative](<https://devfeed.tech/tags/generative.md>), [generative-ai](<https://devfeed.tech/tags/generative-ai.md>), [harness-engineering](<https://devfeed.tech/tags/harness-engineering.md>), [layer](<https://devfeed.tech/tags/layer.md>), [llm](<https://devfeed.tech/tags/llm.md>), [llms](<https://devfeed.tech/tags/llms.md>), [recommendation](<https://devfeed.tech/tags/recommendation.md>), [recommendation-system](<https://devfeed.tech/tags/recommendation-system.md>), [recommendation-systems](<https://devfeed.tech/tags/recommendation-systems.md>), [recommendations](<https://devfeed.tech/tags/recommendations.md>), [reliability](<https://devfeed.tech/tags/reliability.md>), [rules](<https://devfeed.tech/tags/rules.md>), [systems](<https://devfeed.tech/tags/systems.md>), [tv](<https://devfeed.tech/tags/tv.md>)

### AI overview

AI Discover uses a controlled agent harness to make TV recommendations steerable while keeping results grounded, safe and responsive. A controller selects an established plan or validates an LLM-drafted plan; an executor runs approved capabilities, passing typed outputs between steps and using parallel execution, deadlines and fallbacks. Retrieval and ranking systems supply real catalog titles, while LLMs handle selected tasks such as generating themes and explanations. Planning before execution bounds the work and allows slow or invalid plans to fall back to tested ones; asynchronous serving acknowledges a remote press immediately and returns the generated page when ready. Rules and access limits are enforced in code, with structured request records supporting offline evaluation and replay. Model and capability choices can be changed through server-side configuration. Members steer recommendations with selectable themes and tuning options, whose preferences are stored alongside precomputed taste summaries; the current experience has no free-text input or open-ended chat. The authors say production cost, latency, member wait tolerance and multi-turn evaluation remain areas to study

### Source excerpt

The challenges and decisions behind AI Discover's intelligence layer By Varun Khaitan, Peng Ren, Gary Tang, Itay Teller, Atif Faheem, Nipun Kumar, Donnie DeBoer, Eduardo Lundgren, Matteo Rinaldi, Raghav Bakshi We recently introduced AI Discover, a new tab in our TV app where a small group of members can try new ways to find something to watch. For years, our recommendations have worked in the background, inferring what a member might enjoy from their viewing history. AI Discover moves from that silent ranking toward steerable discovery. A member picks a theme, say "Quick Watches," and gets a row of matching titles, a short note on why they fit and a few narrower themes to try next. From there, they can keep narrowing, head somewhere new or tune what they see. Building AI Discover raised a question many teams will recognize: how do you deliver a better member experience with generative AI on TV without sacrificing speed, reliability or safety? Our answer is a new intelligence layer, the agent harness behind AI Discover. For each request, it decides how to combine LLMs with our recommendation systems. It builds on years of work understanding what members enjoy, and on our recent work applying LLMs to recommendations and generative experiences. The layer itself plans each request, runs it across those systems, serves the result and evaluates it offline. This post covers the challenges we designed for and the key decisions we made along the way. Why an intelligence layer? Every Netflix page combines recommendations with rules. We pick titles a member may enjoy, and eligibility, maturity and safety rules decide what can appear. An experience built on LLMs needs the same rules, plus code that decides when to call an LLM and how to handle its output. That code is called an agent harness, and it's the core of our intelligence layer. The simplest implementation hands the entire request to an LLM and lets it pick the titles, write the labels and decide what happens next. Howe

## Beyond Similarity: Heterogeneous Graph Learning for Multi-Objective Food Substitution in Charitable Food Agencies

DevFeed: [Beyond Similarity: Heterogeneous Graph Learning for Multi-Objective Food Substitution in Charitable Food Agencies](<https://devfeed.tech/articles/beyond-similarity-heterogeneous-graph-learning-for-multi-objective-food-substitution-in-charitable-food-agencies-137274.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2608.21979>)

Author: Naimur Rahman Chowdhury, Limon Bin Hossain

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [recommendation systems](<https://devfeed.tech/topics/recommendation-systems.md>), [Neural Network](<https://devfeed.tech/topics/neural-network.md>), [Graphs](<https://devfeed.tech/topics/graphs.md>)

Tags: [affinity](<https://devfeed.tech/tags/affinity.md>), [behavior](<https://devfeed.tech/tags/behavior.md>), [cold-start](<https://devfeed.tech/tags/cold-start.md>), [correlation](<https://devfeed.tech/tags/correlation.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [data](<https://devfeed.tech/tags/data.md>), [decision](<https://devfeed.tech/tags/decision.md>), [features](<https://devfeed.tech/tags/features.md>), [food](<https://devfeed.tech/tags/food.md>), [framework](<https://devfeed.tech/tags/framework.md>), [graph](<https://devfeed.tech/tags/graph.md>), [health](<https://devfeed.tech/tags/health.md>), [learning](<https://devfeed.tech/tags/learning.md>), [multiple](<https://devfeed.tech/tags/multiple.md>), [network](<https://devfeed.tech/tags/network.md>), [neural-network](<https://devfeed.tech/tags/neural-network.md>), [node](<https://devfeed.tech/tags/node.md>), [objectives](<https://devfeed.tech/tags/objectives.md>), [ranking](<https://devfeed.tech/tags/ranking.md>), [recommendation](<https://devfeed.tech/tags/recommendation.md>), [robust](<https://devfeed.tech/tags/robust.md>)

### AI overview

The proposed HeteroGNN ranks food substitutes for charitable food agencies across three separate objectives: household behavior affinity, health suitability, and item similarity. It builds a unified relational graph from large-scale U.S. public data on food consumption behavior and nutrients, addressing agencies' limited direct consumption records. In tests that remove graph relationships to simulate standard and adverse cold-start settings, the model uses relational information beyond node features to predict consumption and remains robust when behavior or nutrient information is sparse. The objectives are weakly correlated, supporting separate rankings instead of one aggregated score. The authors present the framework as support for agency decision-makers making context-specific recommendations with limited information.

### Source excerpt

arXiv:2608.21979v2 Announce Type: replace Abstract: Charitable food agencies play an important role in alleviating food insecurity by distributing donated food to people in need. However, they rely on ad hoc in-kind donations and often face shortages of specific foods, so they offer substitutes. A good food substitution requires matching household preferences, nutritional needs, and item similarity. Agencies have limited direct records of consumption behavior due to resource constraints, making it challenging to make an appropriate substitution decision that meets multiple criteria. In this study, we propose a heterogeneous graph neural network (HeteroGNN), a source-grounded recommendation framework for food substitution in charitable food agencies. We first build a unified relational graph from large-scale public data sources, combining household behavior on food consumption and food nutrient information in the United States (US) context. We treat the substitution recommendation as a multi-objective ranking problem with three targets, including behavior affinity, health suitability, and substitution similarity. We train and validate the proposed framework under standard graph relationship and adverse cold-start settings by removing relational edges from the graph. Our results show that the proposed framework leverages relational information beyond node features in predicting consumption behavior. Additionally, the proposed framework remains robust with sparsity when the model receives incomplete information about behavior and nutrient features. Finally, we show the weak correlation among different objectives, thereby justifying the multi-objective framing as a replacement for an aggregated decision. The proposed framework can help downstream charitable agency decision-makers make contextspecific substitution recommendations with limited information available.

## Evidence Diet: When Graph Evidence Helps LLMs Rank Competing Candidates

DevFeed: [Evidence Diet: When Graph Evidence Helps LLMs Rank Competing Candidates](<https://devfeed.tech/articles/evidence-diet-when-graph-evidence-helps-llms-rank-competing-candidates-137620.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.20837>)

Author: Yuchong Hu, Zhao Zhang, Ziyao Zhao, Haoyu Wang, Jing Xiao

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [recommendation systems](<https://devfeed.tech/topics/recommendation-systems.md>), [Large Language Model](<https://devfeed.tech/topics/llm.md>), [Graph Mining](<https://devfeed.tech/topics/graph-mining.md>)

Tags: [attribution](<https://devfeed.tech/tags/attribution.md>), [books](<https://devfeed.tech/tags/books.md>), [counts](<https://devfeed.tech/tags/counts.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-ir](<https://devfeed.tech/tags/cs-ir.md>), [development](<https://devfeed.tech/tags/development.md>), [graph](<https://devfeed.tech/tags/graph.md>), [information-retrieval](<https://devfeed.tech/tags/information-retrieval.md>), [llms](<https://devfeed.tech/tags/llms.md>), [rank](<https://devfeed.tech/tags/rank.md>)

### AI overview

On Amazon Books and MovieTV, LLM rankers respond more to which supported candidate receives graph evidence than to matched item substitutions: swapping user-level evidence degrades ranking, and exchanging intact count pairs lowers NDCG@5. Adding candidate-level graph records to history improves NDCG@5 by 2.28 points on Books and 2.54 on MovieTV; on these development queries, numerical counts outperform counts presented as text. A frozen evaluation on 274 previously unused Books users found that correct evidence assignment improved pairwise accuracy by 6.07 percentage points (95% CI [4.18, 8.00]). The abstract also reports that unrelated catalog text lowers Hit@1 from 44.77% to 38.70%, while 99.9% of rankings remain valid.

### Source excerpt

arXiv:2611.20837v1 Announce Type: cross Abstract: When several candidates have graph support, does it matter which candidate receives which supporter and path counts? We study how LLM rankers use collaborative evidence on Amazon Books and MovieTV. Swapping user-level evidence degrades ranking, while matched item substitutions have little effect. On fixed clean-trained checkpoints, unrelated catalog text lowers Hit@1 from 44.77% to 38.70%, with 99.9% of rankings still valid. Across all three paired seeds, the NDCG@5 difference between count and path prompts was larger after count training than after path training. Degree matching preserves target paths while giving more rivals support. Across the full degree-matched development pools, adding candidate-level graph records to history improves NDCG@5 by 2.28 points on Books and 2.54 on MovieTV. When the target and a rival both have support, path- and count-trained rankers benefit from retaining counts. On these development queries, adding counts numerically to history scores outperforms presenting them as text. For count-trained rankers, exchanging intact count pairs among supported candidates preserves support and token length, yet lowers NDCG@5 by 4.06 points on 141 Books queries and 3.26 on 104 MovieTV queries. A frozen evaluation on 274 previously unused Books users with supported targets and rivals confirms the attribution effect: correct assignment improves pairwise accuracy by 6.07 percentage points (95% CI [4.18, 8.00]).

## Exploration of Reinforcement Learning in Generative Recommendation Models

DevFeed: [Exploration of Reinforcement Learning in Generative Recommendation Models](<https://devfeed.tech/articles/exploration-of-reinforcement-learning-in-generative-recommendation-models-137489.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.19742>)

Author: Pengfei Zheng, Wuchao Li, Shiyao Wang, Honghui Bao, Hongyi Xie, Jiaxin Deng, Xingmei Wang, Jinghao Zhang, Yufei Ye, Ruiming Tang, Guorui Zhou, Han Li, Kun Gai, Defu Lian

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Reinforcement learning](<https://devfeed.tech/topics/reinforcement-learning.md>), [recommendation systems](<https://devfeed.tech/topics/recommendation-systems.md>), [grpo](<https://devfeed.tech/topics/grpo.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>)

Tags: [absolute](<https://devfeed.tech/tags/absolute.md>), [abstract](<https://devfeed.tech/tags/abstract.md>), [applying](<https://devfeed.tech/tags/applying.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [autoregressive](<https://devfeed.tech/tags/autoregressive.md>), [balance](<https://devfeed.tech/tags/balance.md>), [based](<https://devfeed.tech/tags/based.md>), [bounded](<https://devfeed.tech/tags/bounded.md>), [but](<https://devfeed.tech/tags/but.md>), [can](<https://devfeed.tech/tags/can.md>), [cases](<https://devfeed.tech/tags/cases.md>), [confidence](<https://devfeed.tech/tags/confidence.md>), [control](<https://devfeed.tech/tags/control.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [diagnosis](<https://devfeed.tech/tags/diagnosis.md>), [exploration](<https://devfeed.tech/tags/exploration.md>), [generative](<https://devfeed.tech/tags/generative.md>), [learning](<https://devfeed.tech/tags/learning.md>), [models](<https://devfeed.tech/tags/models.md>), [recommendation](<https://devfeed.tech/tags/recommendation.md>), [reinforcement-learning](<https://devfeed.tech/tags/reinforcement-learning.md>)

### AI overview

Directly applying reinforcement learning to generative recommendation can destabilize training and reduce recommendation quality. The authors analyze GRPO and related ratio-based objectives, identifying dead-gradient regions from clipping, potentially unbounded negative-advantage updates, and insufficient sensitivity to policy confidence. They propose Gradient-Bounded Policy Optimization (GBPO), using stop-gradient normalization to keep positive and negative updates gradient-active yet bounded, while weighting them by current policy confidence so updates fade for near-certain positives and near-impossible negatives. In the evaluated settings, GBPO reportedly offers competitive recommendation performance and more stable training than other evaluated RL methods.

### Source excerpt

arXiv:2611.19742v1 Announce Type: cross Abstract: Traditional cascaded recommender systems balance accuracy and efficiency over large item spaces, but misaligned stage-wise objectives hinder end-to-end optimization. Generative recommendation unifies these stages in an autoregressive framework, providing a natural interface for reinforcement learning (RL) to optimize the entire generation process. However, directly applying RL often leads to unstable optimization and degraded recommendation quality. We revisit Group Relative Policy Optimization (GRPO) and other ratio-based objectives through a unified logit-gradient view. We identify three issues: (i) clipped surrogates create dead-gradient regions, under-utilizing samples; (ii) negative-advantage updates can become effectively unbounded as importance ratios grow, allowing a small subset of negatives to dominate optimization; and (iii) ratio-based control lacks sensitivity to absolute policy confidence, so updates on high-confidence cases may fail to vanish. Motivated by this diagnosis, we propose \emph{Gradient-Bounded Policy Optimization} (GBPO), a simple objective with stop-gradient normalization that is simultaneously (a) fully gradient-active, (b) sign-symmetrically bounded for both positive and negative updates, and (c) explicitly confidence-weighted under current policy probabilities. This ensures that updates gracefully vanish for $\pi\!\to\!1$ positives and $\pi\!\to\!0$ negatives. Across the evaluated settings, GBPO achieves competitive recommendation performance with more stable training than competing RL methods.

## Learning to Reason with Predictive Gains for Generative Recommendation

DevFeed: [Learning to Reason with Predictive Gains for Generative Recommendation](<https://devfeed.tech/articles/learning-to-reason-with-predictive-gains-for-generative-recommendation-137697.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.21441>)

Author: Zhuoyang Li, Teng Shi, Jiakai Tang, Weijie Yu, Guofu Xie, Xiao Zhang, Lei Kou, Yang Yu, Lei Shen, Xin Chen, Bing Wang, Xiaoyi Zeng, Jun Xu

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [recommendation systems](<https://devfeed.tech/topics/recommendation-systems.md>), [llm-reasoning](<https://devfeed.tech/topics/llm-reasoning.md>), [Reinforcement learning](<https://devfeed.tech/topics/reinforcement-learning.md>), [grpo](<https://devfeed.tech/topics/grpo.md>)

Tags: [alignment](<https://devfeed.tech/tags/alignment.md>), [attention](<https://devfeed.tech/tags/attention.md>), [benchmarks](<https://devfeed.tech/tags/benchmarks.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [generation](<https://devfeed.tech/tags/generation.md>), [generative](<https://devfeed.tech/tags/generative.md>), [group-relative-policy-optimization](<https://devfeed.tech/tags/group-relative-policy-optimization.md>), [grpo](<https://devfeed.tech/tags/grpo.md>), [language-models](<https://devfeed.tech/tags/language-models.md>), [llms](<https://devfeed.tech/tags/llms.md>), [log](<https://devfeed.tech/tags/log.md>), [mechanism](<https://devfeed.tech/tags/mechanism.md>), [next](<https://devfeed.tech/tags/next.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [optimize](<https://devfeed.tech/tags/optimize.md>), [performance](<https://devfeed.tech/tags/performance.md>), [prediction](<https://devfeed.tech/tags/prediction.md>), [ranking](<https://devfeed.tech/tags/ranking.md>), [reasoning](<https://devfeed.tech/tags/reasoning.md>), [recommendation](<https://devfeed.tech/tags/recommendation.md>), [semantic](<https://devfeed.tech/tags/semantic.md>)

### AI overview

GainReason trains generative recommendation models using Predictive Gain (PG): the change in target Semantic ID log-likelihood associated with each reasoning sentence. This gives sentence-level rewards intended to reveal each step's predictive contribution and distinguish reasoning trajectories more effectively than group-based, rule-reward optimization. The framework combines PG-based Reasoning Optimization (PGRO), with a custom causal attention mechanism for efficient PG computation, and an auxiliary task, PG-based Reasoning Utilization (PGRU), to strengthen reasoning-conditioned prediction. The abstract reports a theoretical alignment between expected PG and the recommendation ranking objective, and says experiments on three public benchmarks outperform competitive baselines; it provides no benchmark names or numerical results.

### Source excerpt

arXiv:2611.21441v1 Announce Type: new Abstract: Reasoning-enhanced generative recommendation (GR) has attracted increasing attention for leveraging the reasoning capabilities of large language models (LLMs) to improve next-item prediction. However, existing methods primarily optimize reasoning through Group Relative Policy Optimization (GRPO) with rule-based rewards determined by final recommendation performance, which faces two key limitations: (i) unmeasured predictive contributions within reasoning, where the predictive contributions of individual reasoning steps are not directly reflected in optimization signals, and (ii) weakly discriminative learning signals within groups, where different reasoning trajectories within the group often receive indistinguishable rewards, limiting effective policy optimization. In this paper, we propose GainReason, a simple yet effective training framework that optimizes reasoning through Predictive Gain (PG). Specifically, PG measures changes in target Semantic ID (SID) log-likelihood induced by individual reasoning sentences, providing contribution-aware and discriminative rewards. We further theoretically establish the alignment between expected PG and the recommendation ranking objective. Building on this signal, we develop PG-based Reasoning Optimization (PGRO) to optimize reasoning generation with sentence-level rewards, supported by a custom causal attention mechanism for efficient PG computation. Additionally, an auxiliary PG-based Reasoning Utilization (PGRU) task adaptively strengthens reasoning-conditioned prediction to complement PGRO. Extensive experiments on three public benchmarks demonstrate that GainReason consistently outperforms competitive baselines and achieves substantial performance gains from reasoning.

## Template-Driven Machine Learning Standardization for Large Model Fleets

DevFeed: [Template-Driven Machine Learning Standardization for Large Model Fleets](<https://devfeed.tech/articles/template-driven-machine-learning-standardization-for-large-model-fleets-137242.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2603.24963>)

Author: Jiang Liu (Peggy), John Martabano Landy (Peggy), Yao Xuan (Peggy), Djordje Gligorijevic (Peggy), Swamy Muddu (Peggy), Nhat Le (Peggy), Munaf Sahaf (Peggy), Luc Kien Hang (Peggy), Rupinder Khandpur (Pe

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Model Development](<https://devfeed.tech/topics/model-development.md>), [recommendation systems](<https://devfeed.tech/topics/recommendation-systems.md>)

Tags: [ads](<https://devfeed.tech/tags/ads.md>), [advertising](<https://devfeed.tech/tags/advertising.md>), [complexity](<https://devfeed.tech/tags/complexity.md>), [components](<https://devfeed.tech/tags/components.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [efficiency](<https://devfeed.tech/tags/efficiency.md>), [effort](<https://devfeed.tech/tags/effort.md>), [entropy](<https://devfeed.tech/tags/entropy.md>), [framework](<https://devfeed.tech/tags/framework.md>), [global-development](<https://devfeed.tech/tags/global-development.md>), [high-performance](<https://devfeed.tech/tags/high-performance.md>), [improvement](<https://devfeed.tech/tags/improvement.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [meta](<https://devfeed.tech/tags/meta.md>), [metric](<https://devfeed.tech/tags/metric.md>), [ml](<https://devfeed.tech/tags/ml.md>), [ml-models](<https://devfeed.tech/tags/ml-models.md>), [recommendation](<https://devfeed.tech/tags/recommendation.md>), [recommendation-systems](<https://devfeed.tech/tags/recommendation-systems.md>), [standardization](<https://devfeed.tech/tags/standardization.md>), [template](<https://devfeed.tech/tags/template.md>)

### AI overview

Meta's Standard Model Template (SMT) uses standardized machine learning components to generate recommendation models for varied data distributions and optimization events. In an evaluation across five global development cycles in Meta's production ads ranking ecosystem, SMT reduced technique-propagation complexity from O(n-k) to O(n+k), where n is the number of models and k the number of techniques. The abstract reports a 0.77% average cross-entropy improvement at neutral serving capacity, a 1.52% cumulative online metric lift, 92% less per-model iteration engineering time, and 6.3x greater throughput for adopting technique-model pairs. These results are presented as a comparison with independent per-model optimization; the supplied text does not provide further methodological details.

### Source excerpt

arXiv:2603.24963v4 Announce Type: replace Abstract: Modern computational advertising platforms typically rely on recommendation systems to predict user responses, such as click-through rates, conversion rates, and other optimization events. To support a wide variety of product surfaces and advertiser goals, these platforms maintain an extensive ecosystem of machine learning (ML) models. Operating at this scale, however, creates significant development and efficiency challenges: substantial engineering effort is required to regularly refresh these models and propagate new techniques, resulting in long latencies when deploying innovations across the ecosystem. We present a large-scale empirical study comparing model performance, efficiency, and technique propagation between a standardized model-building approach and independent per-model optimization in recommendation systems. To facilitate standardization, we propose the Standard Model Template (SMT)---a framework that generates high-performance models adaptable to diverse data distributions and optimization events. By composing standardized ML model components, SMT reduces technique-propagation complexity from $O(n \cdot k)$ to $O(n+k)$, where $n$ is the number of models and $k$ the number of techniques. Evaluating an extensive suite of models over five global development cycles within Meta's production ads ranking ecosystem, our launched results demonstrate: (1) a 0.77\% average improvement in cross-entropy at neutral serving capacity; (2) a 1.52\% cumulative online metric lift; (3) a 92\% reduction in per-model iteration engineering time; and (4) a 6.3$\times$ increase in technique--model pair adoption throughput. These findings challenge the conventional wisdom that diverse optimization goals inherently require diversified ML model design.

## Label-Free Detection of Structural Bias in LLM-Based Recommender Systems via Randomized Paraphrasing: The Case of Verbosity

DevFeed: [Label-Free Detection of Structural Bias in LLM-Based Recommender Systems via Randomized Paraphrasing: The Case of Verbosity](<https://devfeed.tech/articles/label-free-detection-of-structural-bias-in-llm-based-recommender-systems-via-randomized-paraphrasing-the-case-of-verbosity-137355.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.18878>)

Author: Carlos Pel\\'aez-Gonz\\'alez, David Herrera-Poyatos, Francisco Herrera, Andr\\'es Herrera-Poyatos

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [recommendation systems](<https://devfeed.tech/topics/recommendation-systems.md>), [Large Language Model](<https://devfeed.tech/topics/llm.md>)

Tags: [auditing](<https://devfeed.tech/tags/auditing.md>), [bias](<https://devfeed.tech/tags/bias.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-ir](<https://devfeed.tech/tags/cs-ir.md>), [detection](<https://devfeed.tech/tags/detection.md>), [llm](<https://devfeed.tech/tags/llm.md>), [recommender-systems](<https://devfeed.tech/tags/recommender-systems.md>)

### AI overview

The paper presents a label-free audit for structural bias in LLM recommenders. It randomly assigns paraphrasers to rewrite candidate product descriptions and randomizes their order; if choices are invariant to the rewrites, each paraphraser should be selected equally often. A four-step statistical pipeline tests this property and estimates feature effects while controlling for measured query-product relevance. Across 20,000 product queries and nine models from five families, description length increased selection odds in all nine, by up to 38% per standard deviation. Relevance remained the primary driver, and verbosity's secondary effect varied by model family. The method requires black-box access but no relevance annotations; the supplied abstract says the paper also provides cost and sample-size guidance.

### Source excerpt

arXiv:2611.18878v1 Announce Type: cross Abstract: Large language models (LLMs) are increasingly deployed as recommenders in e-commerce and conversational shopping systems, where they select a product from a set of retrieved candidates described in natural language. Their decisions should depend on relevance to the user query, but may also be influenced by surface-level properties of the descriptions, such as their length. Detecting such structural biases is difficult because relevance labels are rarely available. We propose a label-free framework to audit LLM-based recommender systems for structural bias. Candidate descriptions are rewritten by randomly assigned paraphrasing models and presented in random order. We prove that, if the recommender's choice is invariant to these rewritings, every paraphraser is selected with equal probability, yielding a statistical test that requires no relevance labels. A four-step statistical pipeline tests this property and quantifies the contribution of each description feature while controlling for query-product relevance. We apply the framework to verbosity bias on 20{,}000 product queries and nine recommender LLMs from five model families. After controlling for the measured relevance signals, description length has a positive effect on selection in all nine models, increasing the odds of selection by up to 38% per standard deviation of length. Relevance remains the primary driver of recommendations, while verbosity acts as a consistent secondary signal whose strength depends on the model family. Since the framework needs only black-box access and no annotations, it can be run as a routine audit of deployed shopping assistants, and we provide an auditing protocol with cost and sample-size guidance.

## CPGRec+: A Balance-oriented Framework for Personalized Video Game Recommendations

DevFeed: [CPGRec+: A Balance-oriented Framework for Personalized Video Game Recommendations](<https://devfeed.tech/articles/cpgrec-a-balance-oriented-framework-for-personalized-video-game-recommendations-134974.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2604.14586>)

Author: Xiping Li, Aier Yang, Jianghong Ma, Kangzhe Liu, Shanshan Feng, Haijun Zhang, Yi Zhao

Published: 2026-11-16T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [recommendation systems](<https://devfeed.tech/topics/recommendation-systems.md>), [llm-reasoning](<https://devfeed.tech/topics/llm-reasoning.md>), [Parallel reasoning](<https://devfeed.tech/topics/parallel-reasoning.md>)

Tags: [balance](<https://devfeed.tech/tags/balance.md>), [code](<https://devfeed.tech/tags/code.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-ir](<https://devfeed.tech/tags/cs-ir.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [diversity](<https://devfeed.tech/tags/diversity.md>), [edge](<https://devfeed.tech/tags/edge.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [framework](<https://devfeed.tech/tags/framework.md>), [game](<https://devfeed.tech/tags/game.md>), [games](<https://devfeed.tech/tags/games.md>), [gaming](<https://devfeed.tech/tags/gaming.md>), [gaming-industry](<https://devfeed.tech/tags/gaming-industry.md>), [generation](<https://devfeed.tech/tags/generation.md>), [gnn](<https://devfeed.tech/tags/gnn.md>), [graph](<https://devfeed.tech/tags/graph.md>), [knowledge](<https://devfeed.tech/tags/knowledge.md>), [language-models](<https://devfeed.tech/tags/language-models.md>), [large-language-models-llms](<https://devfeed.tech/tags/large-language-models-llms.md>), [recommendations](<https://devfeed.tech/tags/recommendations.md>), [video](<https://devfeed.tech/tags/video.md>), [video-game](<https://devfeed.tech/tags/video-game.md>)

### AI overview

CPGRec+ targets the accuracy-diversity trade-off in game recommendation by adding two preference-aware modules to the earlier CPGRec framework. Preference-informed Edge Reweighting (PER) uses signed edge weights to distinguish player interests from disinterests and represent preference strength, aiming to reduce over-smoothing in graph convolutions. Preference-informed Representation Generation (PRG) uses an LLM to compare global and personal interests and produce contextualized descriptions of players and games for refining their representations. On two Steam datasets, the authors report higher accuracy and diversity than state-of-the-art models.

### Source excerpt

arXiv:2604.14586v5 Announce Type: replace-cross Abstract: The rapid expansion of gaming industry requires advanced recommender systems tailored to its dynamic landscape. Existing Graph Neural Network (GNN)-based methods primarily prioritize accuracy over diversity, overlooking their inherent trade-off. To address this, we previously proposed CPGRec, a balance-oriented gaming recommender system. However, CPGRec fails to account for critical disparities in player-game interactions, which carry varying significance in reflecting players' personal preferences and may exacerbate over-smoothness issues inherent in GNN-based models. Moreover, existing approaches underutilize the reasoning capabilities and extensive knowledge of large language models (LLMs) in addressing these limitations. To bridge this gap, we propose two new modules. First, Preference-informed Edge Reweighting (PER) module assigns signed edge weights to qualitatively distinguish significant player interests and disinterests while then quantitatively measuring preference strength to mitigate over-smoothing in graph convolutions. Second, Preference-informed Representation Generation (PRG) module leverages LLMs to generate contextualized descriptions of games and players by reasoning personal preferences from comparing global and personal interests, thereby refining representations of players and games. Experiments on \textcolor{black}{two Steam datasets} demonstrate CPGRec+'s superior accuracy and diversity over state-of-the-art models. The code is accessible at https://github.com/HsipingLi/CPGRec-Plus.

## SimRec: Learning to Search, Ask, and Recommend from Simulated Interaction

DevFeed: [SimRec: Learning to Search, Ask, and Recommend from Simulated Interaction](<https://devfeed.tech/articles/simrec-learning-to-search-ask-and-recommend-from-simulated-interaction-132128.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.15426>)

Author: Yaxin Zhang, Xingyu Wu, Yuchen Yan, Yuqin Dai, Hong Zhao, Lixing Shen, Zhan Chen, Jian Shao, Yongliang Shen

Published: 2026-11-13T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [recommendation systems](<https://devfeed.tech/topics/recommendation-systems.md>), [Reinforcement learning](<https://devfeed.tech/topics/reinforcement-learning.md>), [Large Language Model](<https://devfeed.tech/topics/llm.md>), [grpo](<https://devfeed.tech/topics/grpo.md>)

Tags: [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cl](<https://devfeed.tech/tags/cs-cl.md>), [cs-ir](<https://devfeed.tech/tags/cs-ir.md>), [interaction](<https://devfeed.tech/tags/interaction.md>), [learning](<https://devfeed.tech/tags/learning.md>), [llm](<https://devfeed.tech/tags/llm.md>), [recommendation](<https://devfeed.tech/tags/recommendation.md>), [reinforcement-learning](<https://devfeed.tech/tags/reinforcement-learning.md>), [retrieval](<https://devfeed.tech/tags/retrieval.md>), [reward](<https://devfeed.tech/tags/reward.md>), [search](<https://devfeed.tech/tags/search.md>), [simulator](<https://devfeed.tech/tags/simulator.md>), [tool](<https://devfeed.tech/tags/tool.md>), [tool-use](<https://devfeed.tech/tags/tool-use.md>), [training](<https://devfeed.tech/tags/training.md>)

### AI overview

SimRec trains a tool-integrated recommendation agent's full interaction policy with reinforcement learning, addressing workflows that otherwise rely on hand-designed rules or component-specific training. Its task-anchored simulator gives feedback on each recommendation based on the current need, using either an external LLM or the recommender in self-play. A task-aligned GRPO reward credits retrieval quality and valid tool use as well as final hits; training-only target injection addresses sparse hits in large catalogs. On ESCI and Amazon C4, Qwen3-4B's NDCG@100 rose from 32.23% to 35.42% and from 22.94% to 24.72%. The authors report more candidate verification, preference use, and recovery after rejection than with the untrained agent.

### Source excerpt

arXiv:2611.15426v1 Announce Type: cross Abstract: LLM-based recommendation agents can search catalogs, inspect products, ask users, and revise rejected recommendations. However, these behaviors are often governed by hand-designed workflows, while existing training methods optimize isolated components such as query rewriting or list ranking rather than the interaction policy as a whole. We present SimRec, a reinforcement learning framework that trains the full interaction policy of a tool-integrated recommendation agent. SimRec introduces two components. A task-anchored user simulator provides feedback on every recommendation: conditioned on the current task need rather than on user profile, and it can be an external LLM or the recommender itself under self-play. A task-aligned reward optimizes the whole trajectory with GRPO, crediting natural retrieval quality and valid tool use alongside the final hit, with training-only target injection to handle sparse hits over large catalogs. On ESCI and Amazon C4, SimRec improves the NDCG@100 of a Qwen3-4B agent from 32.23% to 35.42% and from 22.94% to 24.72%}, outperforming training-free agents on far larger backbones and task-aligned baselines on NDCG. Analysis shows that the trained agent verifies candidates, uses preferences, and recovers from rejected recommendations far more often than its untrained counterpart. Our code is available at https://github.com/ZJU-REAL/SimRec .

## When Does a Recommendation Spark Curiosity? Theory, Measurement, and Field Evidence

DevFeed: [When Does a Recommendation Spark Curiosity? Theory, Measurement, and Field Evidence](<https://devfeed.tech/articles/when-does-a-recommendation-spark-curiosity-theory-measurement-and-field-evidence-132936.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.14938>)

Author: Pan Li, Alexander Tuzhilin

Published: 2026-11-13T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [recommendation systems](<https://devfeed.tech/topics/recommendation-systems.md>), [product-experimentation](<https://devfeed.tech/topics/product-experimentation.md>), [personalization](<https://devfeed.tech/topics/personalization.md>)

Tags: [about](<https://devfeed.tech/tags/about.md>), [abstract](<https://devfeed.tech/tags/abstract.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [asia](<https://devfeed.tech/tags/asia.md>), [based](<https://devfeed.tech/tags/based.md>), [build](<https://devfeed.tech/tags/build.md>), [can](<https://devfeed.tech/tags/can.md>), [canonical](<https://devfeed.tech/tags/canonical.md>), [click](<https://devfeed.tech/tags/click.md>), [company](<https://devfeed.tech/tags/company.md>), [consumer](<https://devfeed.tech/tags/consumer.md>), [content](<https://devfeed.tech/tags/content.md>), [cs-ir](<https://devfeed.tech/tags/cs-ir.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [curiosity](<https://devfeed.tech/tags/curiosity.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [design](<https://devfeed.tech/tags/design.md>), [econ-gn](<https://devfeed.tech/tags/econ-gn.md>), [field](<https://devfeed.tech/tags/field.md>), [measurement](<https://devfeed.tech/tags/measurement.md>), [q-fin-ec](<https://devfeed.tech/tags/q-fin-ec.md>), [recommendation](<https://devfeed.tech/tags/recommendation.md>), [spark](<https://devfeed.tech/tags/spark.md>), [theory](<https://devfeed.tech/tags/theory.md>)

### AI overview

The paper proposes a computational measure of how much curiosity a recommendation evokes, derived from five axioms formalizing information-gap theory. In a survey, the measure matched consumers' self-reported curiosity and outperformed alternative proxy metrics. A recommender incorporating the measure into its utility function outperformed state-of-the-art methods in offline tests on three datasets. In a controlled experiment at a major Asian video-streaming platform, it increased click-through rate, video views, and time spent compared with the platform's latest production system; the authors report that it was subsequently deployed and remains in operation. The supplied text gives no details on the measure's formula, experiment effect sizes, or deployment context.

### Source excerpt

arXiv:2611.14938v1 Announce Type: cross Abstract: Curiosity, the drive to close the gap between what one knows and what one wants to know, pulls consumers beyond their familiar content, sustains engagement, and breaks them out of the filter bubbles of repetitive, relevance-only recommendations. Despite its importance, curiosity is hardly incorporated into modern recommender systems for lack of a formal measure. The information-gap theory of curiosity provides no formal quantitative model that a recommender system can operate on, and existing proxy metrics do not accurately measure the curiosity that a recommended item evokes. To fill this research gap, we formalize the information-gap theory into five axioms of curiosity and construct the canonical formulation of a computational measure of the curiosity that a recommended item evokes in a consumer. We validate our curiosity measure through a survey-based study, in which it matches consumers' self-reported curiosity and outperforms alternative proxy metrics. We subsequently build a curiosity-aware recommender system that incorporates this measure into the utility function design, and we show through offline experiments on three real-world datasets that it significantly outperforms the state-of-the-art methods. Furthermore, we conduct a large-scale online controlled experiment at a major video-streaming platform in Asia, where we show that our method significantly increases click-through rate, video views, and time spent over the latest production system, leading to tangible economic impact for the company. Our method has since been deployed on the platform and remains in operation. Our findings establish consumer curiosity as a measurable and actionable objective for recommender systems, with important managerial implications for digital platforms to recommend what consumers wonder about.

## Reinforcement Learning: Optimizing 0.6B Dense Models on TPU v7 via vLLM

DevFeed: [Reinforcement Learning: Optimizing 0.6B Dense Models on TPU v7 via vLLM](<https://devfeed.tech/articles/reinforcement-learning-optimizing-0-6b-dense-models-on-tpu-v7-via-vllm-138119.md>)

Original publisher: [Read original article](<https://vllm.ai/blog/2026-11-12-rl-small-dense-tpu-v7>)

Author: Loki Chen, Yang Song, Hongye Xie, Ming Lei, Greg Rehm, Chongyang Bai, Dre Olgiati, Bob Kamma, Tej Choudhary, Hang Cui, Imed Zitouni, Hamed Firooz (Meta ASA); Mingfu Liang, Kavosh Asadi, Yufei Li, Fran

Published: 2026-11-12T00:00:00Z

Content type: article

Language: en

Sources: [vLLM Blog](<https://devfeed.tech/sources/vllm-blog.md>)

Topics: [LLM optimization](<https://devfeed.tech/topics/llm-optimization.md>), [Reinforcement learning](<https://devfeed.tech/topics/reinforcement-learning.md>), [vllm](<https://devfeed.tech/topics/vllm.md>), [LLM Techniques](<https://devfeed.tech/topics/llm-techniques.md>), [grpo](<https://devfeed.tech/topics/grpo.md>), [Google Cloud Platform (GCP)](<https://devfeed.tech/topics/google-cloud.md>), [llm-reasoning](<https://devfeed.tech/topics/llm-reasoning.md>), [quantization](<https://devfeed.tech/topics/quantization.md>), [recommendation systems](<https://devfeed.tech/topics/recommendation-systems.md>), [Open Source Models & Datasets](<https://devfeed.tech/topics/open-source-models-datasets.md>), [Mixture of Experts (MoE)](<https://devfeed.tech/topics/mixture-of-experts-moe.md>)

Tags: [2](<https://devfeed.tech/tags/2.md>), [2026](<https://devfeed.tech/tags/2026.md>), [8k](<https://devfeed.tech/tags/8k.md>), [ai-engineering](<https://devfeed.tech/tags/ai-engineering.md>), [cloud](<https://devfeed.tech/tags/cloud.md>), [cloud-tpu](<https://devfeed.tech/tags/cloud-tpu.md>), [designing](<https://devfeed.tech/tags/designing.md>), [google](<https://devfeed.tech/tags/google.md>), [google-cloud](<https://devfeed.tech/tags/google-cloud.md>), [hardware](<https://devfeed.tech/tags/hardware.md>), [learning](<https://devfeed.tech/tags/learning.md>), [llm-inference](<https://devfeed.tech/tags/llm-inference.md>), [minutes](<https://devfeed.tech/tags/minutes.md>), [model-serving](<https://devfeed.tech/tags/model-serving.md>), [models](<https://devfeed.tech/tags/models.md>), [open-source-ai](<https://devfeed.tech/tags/open-source-ai.md>), [optimizing](<https://devfeed.tech/tags/optimizing.md>), [performance](<https://devfeed.tech/tags/performance.md>), [policy](<https://devfeed.tech/tags/policy.md>), [qwen3](<https://devfeed.tech/tags/qwen3.md>), [reinforcement-learning](<https://devfeed.tech/tags/reinforcement-learning.md>), [rl](<https://devfeed.tech/tags/rl.md>), [tpu](<https://devfeed.tech/tags/tpu.md>), [true](<https://devfeed.tech/tags/true.md>), [vllm](<https://devfeed.tech/tags/vllm.md>), [vllm-blog](<https://devfeed.tech/tags/vllm-blog.md>), [with](<https://devfeed.tech/tags/with.md>)

### AI overview

On a 64-chip Google Cloud TPU v7 slice, the team cut a Qwen3-0.6B GRPO rollout-to-update cycle from roughly 100 minutes to 56 seconds while retaining the 8,192-token response cap. The work shows that small-model RL can be limited by dispatch, synchronization, cache handling, and kernel geometry as well as compute. Key changes fused decode steps into an XLA device loop, tuned Pallas RPA v3 fetch and compute blocks for long contexts, adjusted EOS-check cadence, used continuous batching and vocab-sharded sampling, parallelized reward scoring, and improved cache persistence, weight sync, and training attention. Decode throughput reached about 183K tokens/s averaged over the full rollout; the final cycle had a 57.9-second median, with 85% of time in rollout. Results use a public math-prompt proxy and a 4,096-token prompt cap for the final runs; earlier milestones used a 16,384-token cap, so the full ladder does not hold prompt capacity constant. Several changes in the 299-to-88-second stage were not isolated. Quantization and shared-prefix attention showed little or no net gain against production-scale kernels. The published recipe and flags are reported to reproduce the result.

### Source excerpt

Co-designing RL for a Qwen3-0.6B dense policy on Google Cloud TPU v7 across vLLM, Tunix, MaxText, and Pallas, with a 107x end-to-end speedup from ~100 minutes to ~56 seconds per true-8K RL cycle.

## Reddit "Reviews" will use AI to turn subreddit posts into product recommendations

DevFeed: [Reddit "Reviews" will use AI to turn subreddit posts into product recommendations](<https://devfeed.tech/articles/reddit-reviews-will-use-ai-to-turn-subreddit-posts-into-product-recommendations-129546.md>)

Original publisher: [Read original article](<https://www.techspot.com/news/114523-reddit-reviews-use-ai-turn-subreddit-posts-product.html>)

Author: Alfonso Maruccia

Published: 2026-11-11T20:05:00Z

Content type: news

Language: en

Sources: [TechSpot](<https://devfeed.tech/sources/techspot.md>)

Topics: [recommendation systems](<https://devfeed.tech/topics/recommendation-systems.md>), [AI for interactive applications](<https://devfeed.tech/topics/ai-for-interactive-applications.md>), [Reddit](<https://devfeed.tech/topics/reddit.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [generative-ai](<https://devfeed.tech/tags/generative-ai.md>), [product](<https://devfeed.tech/tags/product.md>), [recommendations](<https://devfeed.tech/tags/recommendations.md>), [reddit](<https://devfeed.tech/tags/reddit.md>), [reviews](<https://devfeed.tech/tags/reviews.md>), [social](<https://devfeed.tech/tags/social.md>), [the-web](<https://devfeed.tech/tags/the-web.md>), [user-reviews](<https://devfeed.tech/tags/user-reviews.md>)

### AI overview

Reddit Reviews uses generative AI to turn discussions in Reddit communities into product summaries and comparisons, including positive and negative traits and category-specific details. Users can explore other products in the same category. At launch, the feature covers about 10,000 products across Electronics, Health & Beauty, Home & Garden, and Fashion & Apparel, and is initially available to US visitors on Reddit's new site. Reddit says it plans to expand product coverage and availability outside the US throughout 2027.

### Source excerpt

Reddit has announced a significant way in how the company plans to do business on the web. The newly introduced Reddit Reviews service will turn one of the internet's most popular "places" into a review and recommendation hub. Just like everything else related to user-generated data these days, RR makes... Read Entire Article

[Next page](<https://devfeed.tech/topics/recommendation-systems.md?cursor=WyIyMDI2LTExLTExVDIwOjA1OjAwKzAwOjAwIiwgIjYxOTM5Yzg1LTk3YWQtNDQzNy04YWYxLWQ1MjI1Nzc2YTMzNCJd>)