Memory Is No Longer a Bottleneck: Memory-Efficient Graph Filtering for Scalable Collaborative Filtering
Researchers have developed Mem-GF, a memory-efficient graph filtering method for collaborative filtering that eliminates the need to store full item similarity graphs. The approach uses Krylov subspaces to approximate polynomial graph filters, achieving 5.74× lower memory usage and 4.38× faster runtime while maintaining or exceeding recommendation accuracy of existing methods.