What a Recommender Can Reach, Remember, and Afford

Seven recent papers on LLMs and recommender systems, and three questions that connect them. Can the decoder actually reach the right item? What should the system remember about a user, and who gets to change the list? And what does it cost to train over a full catalog?

The companion column on RL, agents, and applications is Knowing When to Intervene: Six Papers on RL, Search Agents, and RAG. The numbers below are the authors’ reported results on their own benchmarks.

In this column

Reach

1. Beyond Semantic IDs: can the decoder reach the item?

2. ICE-Fuse: context read from interaction images

Remember and revise

3. MATE: separate memories for recurring and recent taste

4. INTEGER: generative recommenders that hold a conversation

5. Personal-agent mediation: rescue versus harm

Data and cost

6. Evidence Before Sampling: which unobserved items are real negatives?

7. CutBCE: BCE over an 876k-item catalog without dense logits

Reach

1. Beyond Semantic IDs: can the decoder reach the item?

Beyond Semantic IDs: Finite-Beam Reachability and Continuous-Query Generation in Generative Recommendation

The paper separates two properties that are easy to conflate in semantic-ID recommenders: whether an item is scoreable at all, and whether finite-width beam search actually puts a held-out target into the returned list. It proposes CQG-Single, which generates one continuous retrieval query, and CQG-AR, which generates continuous residual updates autoregressively; both score every encoded item through dense or approximate-nearest-neighbor retrieval. [1]

Under a unified protocol with valid-prefix constrained decoding, CQG-Single beats a TIGER-style baseline in all seven runs with 55.3% as many trainable parameters, and extra continuous refinement depth does not monotonically help. [1]

This is a natural sequel to our FLASH deep dive. FLASH asked whether the decoder matches the code structure; this paper asks whether the decoder’s search budget can reach the right codes. The comparison is against one TIGER-style baseline, so it does not establish that continuous queries beat every semantic-ID design.

2. ICE-Fuse: context read from interaction images

Seeing the Context: Enhancing Recommender Systems with Image-Derived Contextual Signals

Most recommenders use images to enrich item or user representations. This paper instead uses a vision-language model to extract physical, social, and modal context from interaction images, and ICE-Fuse integrates those categories into a context-aware recommender. [2]

On TripAdvisor with Review-aware Graph Contrastive Learning, image-derived context does not beat established signals on its own but improves results when combined with them; semantic analysis suggests image and review context capture different aspects of an interaction. [2]

The negative result on its own is useful to report. Evidence comes from one dataset and one recommender, so complementarity is a hypothesis to test elsewhere.

Remember and revise

3. MATE: separate memories for recurring and recent taste

MATE: Adaptive Long- and Short-Term User Memory for LLM-Based Recommendation

MATE checks each new interaction for support from historical behavior and consistency with recent interactions, then uses that temporal evidence to update separate long-term and short-term user memories. A recent-context representation controls how much each memory contributes to the representation used for recommendation. [3]

During online adaptation the shared model is frozen and only the two user memories are updated. On MovieLens-10M, Amazon Luxury Beauty, and KuaiRec it reports a 7.0–13.2% improvement in mean NDCG@10 over the strongest external baseline. [3]

Freezing the model and updating only memory is an attractive serving pattern: per-user state changes, shared weights do not. That also bounds what the experiments show. The online results test memory adaptation, not continual learning of the model itself.

4. INTEGER: generative recommenders that hold a conversation

Adapting Generative Recommenders for Multi-Turn Interaction

INTEGER extends a generative recommender to multi-turn dialogue with a learned routing token that decides when to recommend, history re-anchoring that conditions on both past behavior and the conversation, and behavioral replay with instruction rehearsal to limit forgetting. [4]

On Amazon Beauty and Toys it matches or exceeds the strongest baselines in accuracy with competitive conversation quality, reporting a 13.3% Hit@10 gain on Beauty. The authors note that rejected items are replaced through an intent-agnostic mechanism, leaving attribute-aware feedback to future work. [4]

The routing token is a learned decision about when to act. Two product categories are a narrow base, and an intent-agnostic replacement means “not this one” and “something cheaper” are handled the same way.

5. Personal-agent mediation: rescue versus harm

Personal-Agent Mediated Recommendation with Cross-Platform User History

A platform ranks candidates with local data; a user-authorized personal agent revises the slate using cross-platform history. The authors decompose the change in hit rate into rescues minus harmful overrides, and propose PAMO, which reallocates RL advantage toward rationales that depend on cross-platform history under a value floor. [5]

We covered it in detail in When Should a Personal Agent Override Your Recommender?. The short version: PAMO beats matched GRPO on HR@10 and NDCG@10 across all five test sets, mostly by making fewer harmful overrides rather than more rescues. [5]

MATE, INTEGER, and PAMO all keep a strong model fixed and change something around it: user memory, the decision to recommend, or the final slate. That separation makes each easier to deploy and harder to evaluate in isolation.

Data and cost

6. Evidence Before Sampling: which unobserved items are real negatives?

Evidence Before Sampling: Interpretable Implicit Negative Candidate Discovery for Recommendation

An unobserved user–item pair does not by itself show disinterest. This paper mines observed behavior into symbolic rules, scores them for support, informativeness, and product relevance, ranks the retained rules by evidence, and uses an LLM to interpret them against business objectives and domain knowledge. [6]

Candidate-quality evaluations on an industrial B2B task and three public datasets report higher precision than the evaluated baselines. In the industrial task, symbolic selection improves downstream test PR-AUC by 12.5% over random selection at four negatives per positive. [6]

The downstream comparison is against random negatives, not hard-negative or popularity-based samplers used in production. The more durable idea is the evaluation split: judging whether a negative candidate is valid separately from whether it improves the downstream model. [6]

7. CutBCE: BCE over an 876k-item catalog without dense logits

Cut Binary Cross Entropy: Efficient Large-Vocabulary Loss and Gradient Kernels for Sequential Recommendation

Multi-label BCE over a large catalog normally materializes a dense batch × sequence × vocabulary logits tensor in high-bandwidth memory. CutBCE computes the exact loss and gradient by fusing dense background-loss evaluation with sparse target corrections, using a custom vector-Jacobian product and a Pallas TPU backward kernel that computes logit tiles on-chip. [7]

Training multi-label SASRec on Yambda-50M with 876k items across 8 TPU chips, it reports 65.7% lower peak HBM and 225.9% faster training with comparable accuracy. [7]

This is a systems paper, and its gains are on specific TPU hardware. It matters for modeling because full-catalog losses are often avoided for memory reasons and replaced with sampled losses. Cheaper exact losses widen what can be tested.

One experiment to try

Separate reachability from ranking.

For a held-out target, record two things: whether it enters the candidate set the model can return at all, and where it ranks if it does. Run that for a semantic-ID decoder at several beam widths, a continuous-query generator at several ANN budgets, and a dense retriever, all at matched serving cost.

If most misses are unreachable targets, the fix is search budget or output representation. If most are reachable but ranked low, the fix is the scoring model. A single Recall@K number cannot tell the two apart.