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
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IR 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
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.