LoopRec
An item-level adaptive recursive framework for sequential recommendation that employs a gating mechanism to dynamically allocate computational depth for each item, thereby enabling computation on demand.
Timeline (last 90 days)
LoopRec is an item-level adaptive recursion framework whose core is a weight-sharing recursive block, with lightweight gating introduced at each recursion boundary to make an independent binary exit-or-continue decision for each item.
LoopRec turns a fixed global depth into a learnable per-item property, requires no auxiliary depth labels, and is easy to adapt to a variety of backbone architectures.
Public benchmark experiments on four backbone families show that LoopRec consistently outperforms matched fixed-depth baselines.
Weight sharing in LoopRec keeps the total number of parameters from growing with maximum depth.
LoopRec's gating mechanism outputs binary decisions, and during training the non-differentiability problem must be addressed using methods such as Gumbel-Softmax, straight-through estimators, or relaxed sampling with temperature annealing.
LoopRec's gated exit decisions are learned entirely driven by the recommendation loss, with no explicit depth supervision labels.
The computation allocation learned by LoopRec exhibits an interpretable pattern in which low-frequency items and more recent interactions receive deeper computation, and this is consistent with post-hoc Oracle analysis.
Current discussion of LoopRec is mainly concentrated in the academic community, and no large-scale industrial deployment reports have yet been seen.
All Facts (8)
LoopRec is an item-level adaptive recursion framework whose core is a weight-sharing recursive block, with lightweight gating introduced at each recursion boundary to make an independent binary exit-or-continue decision for each item.
50%UnverifiedLoopRec turns a fixed global depth into a learnable per-item property, requires no auxiliary depth labels, and is easy to adapt to a variety of backbone architectures.
50%UnverifiedPublic benchmark experiments on four backbone families show that LoopRec consistently outperforms matched fixed-depth baselines.
50%UnverifiedWeight sharing in LoopRec keeps the total number of parameters from growing with maximum depth.
50%UnverifiedLoopRec's gating mechanism outputs binary decisions, and during training the non-differentiability problem must be addressed using methods such as Gumbel-Softmax, straight-through estimators, or relaxed sampling with temperature annealing.
50%UnverifiedLoopRec's gated exit decisions are learned entirely driven by the recommendation loss, with no explicit depth supervision labels.
50%UnverifiedThe computation allocation learned by LoopRec exhibits an interpretable pattern in which low-frequency items and more recent interactions receive deeper computation, and this is consistent with post-hoc Oracle analysis.
50%UnverifiedCurrent discussion of LoopRec is mainly concentrated in the academic community, and no large-scale industrial deployment reports have yet been seen.
50%