Think Harder Where It Matters: Item-Level Adaptive Recursion for Sequential Recommendation
arXiv cs.AI · 22 Oct 2026, 03:58 AEST
Existing sequential recommenders often use a fixed computational budget for all items, which can lead to inefficiencies. The proposed LoopRec model introduces item-level adaptive reasoning to optimize computational resources and improve recommendation quality.
Key facts
- Existing sequential recommenders usually allocate a fixed computational budget to every item in a user's interaction history, regardless of the item's contribution to the final prediction.
- Items within the same sequence vary drastically in how much computation they require.
- Given oracle access to the target item, a non-uniform depth assignment consistently outranks the fixed one, indicating that existing uniform computation both wastes capacity on already-converged items and sacrifices overall recommendation quality.
- LoopRec recursively applies a single weight-shared block and introduces a lightweight gate at each recursion boundary that makes a binary exit-or-continue decision for every item independently.
- Extensive experiments on public benchmarks with four backbone families demonstrate that LoopRec consistently outperforms matched fixed-depth counterparts.
Read aloud
Existing sequential recommenders often use a fixed computational budget for all items, which can lead to inefficiencies. The proposed LoopRec model introduces item-level adaptive reasoning to optimize computational resources and improve recommendation quality. Existing sequential recommenders usually allocate a fixed computational budget to every item in a user's interaction history, regardless of the item's contribution to the final prediction. Items within the same sequence vary drastically in how much computation they require. Given oracle access to the target item, a non-uniform depth assignment consistently outranks the fixed one, indicating that existing uniform computation both wastes capacity on already-converged items and sacrifices overall recommendation quality. LoopRec recursively applies a single weight-shared block and introduces a lightweight gate at each recursion boundary that makes a binary exit-or-continue decision for every item independently. Extensive experiments on public benchmarks with four backbone families demonstrate that LoopRec consistently outperforms matched fixed-depth counterparts.
Sources in this cluster
- Think Harder Where It Matters: Item-Level Adaptive Recursion for Sequential Recommendation
arXiv cs.AI · 22 Oct 2026, 03:58 AEST