- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2(+1)
Read review
Paper summary
This paper studies a randomly masked LAE. Based on a prior work DEQL, it introduces an independent diagonal regularization and derives a whole-matrix closed-form solution, which has computational advantage over baselines. Furthermore, the authors propose a related low-rank approximation and conduct experimental evaluation on recommendation tasks.
Critical strengths
- The empirical results in the paper demonstrate a significant efficiency improvement. Under fair settings, the proposed solution achieves a significant speedup of approximately 1.5–2.6 times compared to DEQL.
- The paper provides relatively comprehensive experimental results involving multiple recommendation datasets.
Critical weaknesses
-
The Reviewer think that the contribution beyond DEQL is not adequately discussed in the paper. Compared to DEQL, the main modifications in the paper focus on computational implementation and independent diagonal penalties, while the discussion of the low-rank part mainly refers to some existing techniques. This makes the paper's current positioning closer to an extension of the existing DEQL framework with only provide some incremental results.
-
Some related works are not sufficiently discussed. This paper does not include [1], which also introduces low-rank designs in the LAE model, making its comparison with existing works incomplete.
-
Some experimental results show that the proposed solution has limited accuracy advantages or even disadvantages compared to some strong baselines. For example, compared to DEQL, only 3 out of 12 comparisons reached significance, while the Recall advantage of Games was approximately +6.48% in the main text, but reversed to approximately -0.84% in the appendix. This suggests that the gains reported in the main table may be sensitive to data partitioning.
-
The article should briefly discuss some practical application scenarios (such as cold-start) that the proposed scheme might have in recommender systems. Furthermore, another suggestion from reviewers is to place comparisons of related work in the main text rather than the appendix.
[1] Pu, Y., Fan, R., Chen, J., Zhu, Z., Lian, D., & Chen, E. (2025). Automated Sparse and Low-Rank Shallow Autoencoders for Recommendation. ACM Transactions on Recommender Systems, 3(3), 1-26.
Questions for authors
Please refer to Weakness.
5 comments
W3: We retuned both methods on ten random splits and tested significance with Holm correction (Appendix C.2). The Games gain in the main table is sensitive to the split.
Accuracy is comparable across the two methods. Differences are small and dataset-dependent, and none of the 12 dataset-metric comparisons is significant after Holm correction. Table 8 reports the mean differences, Uni- minus DEQL(), and Holm-adjusted p-values from a one-sided corrected t-test:
| Dataset | ΔR@20 (adj. p) | ΔN@20 (adj. p) |
|---|---|---|
| Games | +0.0070 (0.96) | +0.0010 (1.00) |
| Beauty | -0.0011 (1.00) | +0.0007 (1.00) |
| Gowalla-1 | +0.0003 (1.00) | +0.0001 (1.00) |
| ML-20M | +0.0006 (0.73) | +0.0014 (0.072) |
| Netflix | +0.0002 (0.27) | +0.0001 (0.29) |
| MSD | 0.0000 (1.00) | 0.0000 (1.00) |
Before correction, the same three comparisons as in the original five-split test have p-values below 0.05. We have updated Section 5.2 and moderated the abstract's accuracy claim accordingly.
On Games, the main-table R@20 gain of 6.48% comes from a single split. The five-split appendix comparison (-0.84%) reused the configurations selected on that split without retuning. After retuning on ten splits, the mean gain is positive but small relative to the variation across splits. We therefore agree that the single-split gain is sensitive to the partition and does not establish a reliable advantage on Games.
Uni- is also not uniformly best in the main tables: EDLAE is slightly better on MSD, while deep or graph models lead on Yelp2018 and Gowalla (Tables 3 and 4; Section 5.2).
The sweeps in Appendix C.3 suggest that full-matrix regularization accounts for most of the improvement over the unregularized model, while mainly redistributes accuracy across popularity groups. The evidence supports an interpretable extension with comparable accuracy.
W4: Appendix E now discusses cold-start and long-tail recommendation. Sections 2 and 4.2 also compare our model with the most closely related work.
For previously unseen users with observed interactions, the model provides recommendations through fold-in without retraining the item-to-item matrix. Corollary 4.4 explicitly covers these inputs. The strong generalization setting in Table 3 evaluates this scenario because test users are disjoint from training users, although it does not separately measure performance for users with very few interactions.
For long-tail items, Corollary 4.4 shows that a positive total penalty shrinks the scores of less popular items less at equal prediction difficulty. Relative to the zero-diagonal limit, the selected improves tail accuracy and catalog coverage on the strong generalization datasets (Tables 13 and 14). Relative to the free-diagonal endpoint , tail accuracy does not improve on most datasets (Table 12). The tail benefit over the zero-diagonal limit therefore mainly reflects allowing a nonzero diagonal; increasing does not consistently improve tail accuracy.
As new interactions arrive, the model can be refitted in closed form. Tuning and reuses one factorization per . Zero-interaction cold start, covering users without interactions and new items without training interactions, remains outside our scope. Handling these cases requires side information, such as item content, or a popularity fallback (Appendix E).
Section 2 now compares how EASE, EDLAE, RLAE, RDLAE, and DEQL treat the diagonal, while Section 4.2 relates our objective to linear masked autoencoders.
Thank you for your detailed explanations and revisions on this manuscript, which has addressed some of my main concerns. I therefore update my soundness score to 2.
However, at the same time, the manuscript has also been extensively changed, which includes substantial additions of contents. Within the limited discussion time for about 3-4 days, I'm afraid that I'm not able to examine all these additions carefully enough to fully check their correctness. I feel sorry but want to maintain my original overall score. I believe the revised manuscript would be benefited from another round of full review in a future top venue.
Thank you for your constructive comments. We have added an exact analysis of the diagonal penalty, significance tests after retuning, and a discussion of Pu et al. (2025). All references below are to the revised manuscript.
DEQL derives column-wise solutions under general emphasis (Section 1). Our whole-matrix closed form answers two questions it leaves open: how the diagonal changes cross-item predictions and whether a separate diagonal penalty yields new solutions.
Theorem 4.3 and Corollary 4.4 show that, for an unobserved item (Ru,i=0), the score under WL2∗ equals γi times the score under the zero-diagonal solution W∞∗, where γi=(p+ηi)/(p+ηi+qα2ϵi) and ηi=s(λD+λW)/(qα2Ni,i).
Here, q=1−p, s=qα2+p, Ni,i is item popularity, and ϵi measures its regularized prediction difficulty from other items. Holding (p,α,λW) fixed, increasing λD reduces the fitted diagonal and moves each column toward the zero-diagonal endpoint.
Diagonal control therefore scales each item's prediction from other items by a factor γi shared across users. Differences in these factors across items can change a user's ranking. With a positive total penalty, more popular items undergo stronger shrinkage at equal prediction difficulty. When λW>0, the effect of a finite λD on the multiplier is largest at intermediate popularity (Figure 1; Appendix C.4).
Corollary 4.5 holds the masking rate p and normalized ridge λ~W fixed, keeping the shared inverse unchanged. If two co-occurring items differ in popularity, every finite λD>0 produces off-diagonal coefficients that DEQL(L2) with the same p and λ~W cannot reproduce at any emphasis ratio, and in general not even up to a rank-preserving rescaling. If all such items have equal popularity, a smaller emphasis ratio reproduces the coefficients. The added freedom thus comes exactly from variation in popularity and carries no guarantee of better rankings.
We agree that the low-rank part builds on existing full-rank-teacher techniques (Jin et al., 2021; Steck & Garcia, 2021; Li et al., 2026). We present it as a secondary result in Appendix D, outside the listed contributions. Our weighted approximation uses the metric induced by the objective under general emphasis and diagonal regularization. DEQL's exact low-rank closed form applies only when the two emphasis weights are equal (Appendix A). In that equal-weight case without diagonal regularization, our weighted approximation is itself an exact rank-constrained minimizer and, without ridge, recovers an optimal encoder-decoder product of the linear masked autoencoder of Bisulco et al. (2025) (Appendix D.1).
AutoS²AE+ (Pu et al., 2025), together with ELSA, SANSA, SVD-AE, and ImplicitSLIM, pursues compact or sparse item transformations. Our approximations project a full-rank closed-form teacher without low-rank training, so they require the full-rank solve first (Appendix E).