Pith. sign in

REVIEW 2 cited by

Towards Low-loss 1-bit Quantization of User-item Representations for Top-K Recommendation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2112.01944 v1 pith:7DC5TAOU submitted 2021-12-03 cs.IR

classification cs.IR
keywords quantizationrecommendationuser-iteminformationmodelperformancequantizedrepresentation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Due to the promising advantages in space compression and inference acceleration, quantized representation learning for recommender systems has become an emerging research direction recently. As the target is to embed latent features in the discrete embedding space, developing quantization for user-item representations with a few low-precision integers confronts the challenge of high information loss, thus leading to unsatisfactory performance in Top-K recommendation. In this work, we study the problem of representation learning for recommendation with 1-bit quantization. We propose a model named Low-loss Quantized Graph Convolutional Network (L^2Q-GCN). Different from previous work that plugs quantization as the final encoder of user-item embeddings, L^2Q-GCN learns the quantized representations whilst capturing the structural information of user-item interaction graphs at different semantic levels. This achieves the substantial retention of intermediate interactive information, alleviating the feature smoothing issue for ranking caused by numerical quantization. To further improve the model performance, we also present an advanced solution named L^2Q-GCN-anl with quantization approximation and annealing training strategy. We conduct extensive experiments on four benchmarks over Top-K recommendation task. The experimental results show that, with nearly 9x representation storage compression, L^2Q-GCN-anl attains about 90~99% performance recovery compared to the state-of-the-art model.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. CoVE: Compressed Vocabulary Expansion Makes Better LLM-based Recommender Systems

    cs.IR 2025-06 conditional novelty 6.0 of 10

    CoVE assigns each item a unique token ID, tunes item embeddings and the LM head, and predicts the next item from logits, beating finetune-and-retrieval baselines by up to 62 percent with a 16x compressed embedding table.

  2. Learning Binarized Representations with Pseudo-positive Sample Enhancement for Efficient Graph Collaborative Filtering

    cs.IR 2025-06 conditional novelty 5.0 of 10

    BiGeaR++ learns 1-bit user and item embeddings by distilling ranking knowledge from full-precision embeddings and synthesizing hard pseudo-positive samples, reaching 98-108 percent of LightGCN's Recall and NDCG on fiv...

Pith tools