A rank-aware block decomposition for linear and bilinear operations in recommender models (FM, DCNv2, attention, FC) reduces redundant context feature computation to once per request with identity-equivalent results, plus rDCN variant for deeper layers.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.IR 2years
2026 2roles
background 1polarities
background 1representative citing papers
MoS applies theme-aware routing to extract multi-scale theme-specific subsequences from noisy long user sequences, achieving state-of-the-art recommendation performance with fewer FLOPs than comparable MoE models.
citing papers explorer
-
Context Features Are Cheap: Rank-Aware Decomposition for Efficient Feature Interaction in Recommender Systems
A rank-aware block decomposition for linear and bilinear operations in recommender models (FM, DCNv2, attention, FC) reduces redundant context feature computation to once per request with identity-equivalent results, plus rDCN variant for deeper layers.
-
Mixture of Sequence: Theme-Aware Mixture-of-Experts for Long-Sequence Recommendation
MoS applies theme-aware routing to extract multi-scale theme-specific subsequences from noisy long user sequences, achieving state-of-the-art recommendation performance with fewer FLOPs than comparable MoE models.