-
The central claim that LPD represents a user-specific multifaceted preference distribution is not sufficiently established.
The user-specific posterior remains a single Gaussian, qϕ(z∣xu)=N(μu,diag(σu2)). The proposed LPD is instead the responsibility vector of one latent representation over several global GMM components, γu(c)=p(c∣zu).
This appears closer to soft cluster membership or soft prototype assignment than to a genuine user-specific multimodal preference distribution. The model does not learn multiple user-specific latent modes or multiple interest representations, and prediction still relies on a single latent representation through the VAE decoder.
Therefore, the key conceptual step from "soft membership over global GMM components" to "multifaceted user preference distribution" needs stronger justification. The lack of semantic, structural, or stability analysis of the GMM components further weakens this interpretation.
-
The necessity of the GMM-derived LPD is not isolated from simpler alternatives.
The GMM plays two roles: providing a more flexible prior and mapping a continuous user representation into a K-dimensional soft assignment vector for KNN. The GMM-only ablation partially evaluates the first role, but the second is not isolated.
A crucial missing baseline is to retain exactly the same neighbor mining, candidate construction, decoder filtering, and preference-alignment pipeline, but perform KNN directly on the encoder latent representation, for example using ∥μu−μv∥2 or cosine similarity.
The existing dx variant is insufficient because it compares LPD-space retrieval with sparse raw interaction-space retrieval rather than with another learned latent representation.
Another useful baseline is a simpler soft-prototype representation such as au=softmax(Wzu/τ), followed by the same KNN and pseudo-positive pipeline. This would test whether the Gaussian-specific means, variances, and mixture weights provide additional value beyond a generic soft categorical/prototype representation.
Without these controls, it is unclear whether the gains come from the flexible prior, latent-space KNN, a prototype bottleneck, or specifically from GMM responsibilities.
-
The pseudo-positive mining procedure creates a potentially serious self-reinforcement loop.
The same model produces zu, constructs γu, retrieves neighbors, collects candidate items, uses its own decoder πi(zu) to select the top H pseudo-positives, and is then trained to further increase the scores of those selected items.
This creates a feedback loop of the form current model belief→pseudo labels→reinforcement of current model belief.
If early latent representations, GMM assignments, or decoder predictions are wrong, the procedure may reinforce these errors. Small M, H, and λ may reduce the influence of noisy pseudo-labels, but they are heuristic controls rather than evidence that the loop is stable.
This should be validated through sensitivity to M, H, λ, and K; pseudo-positive precision or held-out hit rate; neighbor and pseudo-label stability across epochs; robustness across random seeds; robustness to injected pseudo-label noise; or comparisons with warm-up or teacher-based variants.
-
The theoretical analysis motivates limitations of vanilla VAE-CF, but does not derive the concrete LPD-VAE algorithm.
The theory supports the general observations that a shared prior can restrict posterior diversity and that reconstruction can penalize posterior overlap between users with different interaction statistics. However, it does not establish why the solution should specifically be GMM→γu→L1-KNN→neighbor items→decoder Top-H→pseudo-positive loss.
In particular, the theory does not establish why GMM responsibilities are the correct preference representation, why L1 distance is the appropriate similarity metric, or why neighbors selected under this metric provide reliable positive items. The theory therefore motivates the general problem more than the particular algorithm.
-
GMM initialization and component stability are insufficiently specified and validated.
The method jointly trains the encoder, decoder, and GMM parameters {ωc,μc,σc2}c=1K, but the paper does not clearly describe how component means, variances, and mixture weights are initialized, whether a pretrained VAE or warm-up stage is used, or whether pseudo-positive mining starts immediately.
This matters because early GMM assignments directly determine user neighbors and therefore affect later pseudo-label supervision.
The paper also lacks diagnostics such as component utilization, mixture-weight distribution, assignment entropy, component separation, effective number of active components, and stability across random seeds. These analyses are important because the main semantic interpretation depends on the GMM components representing meaningful and stable preference structure.
-
The computation of LPD for user retrieval is not sufficiently clear.
The paper defines γu(c)=p(c∣zu), while zu comes from a stochastic variational posterior. It is unclear whether KNN uses one sampled zu, the posterior mean μu, or an expectation over multiple samples.
If a stochastic sample is used, the resulting LPD and nearest-neighbor set may themselves be unstable. Since these neighbors determine the pseudo-positive supervision, this is an important implementation detail.
-
The scalability of the global user-KNN stage is unclear.
The algorithm repeatedly computes LPDs and retrieves nearest users on datasets containing hundreds of thousands of users. A naive implementation would require pairwise comparisons with complexity on the order of O(U2K). The paper should clarify how this stage is implemented efficiently and report its additional training-time and memory cost.
We sincerely appreciate the reviewer's time and effort in evaluating our work, as well as the valuable comments and constructive suggestions. Below, we provide our responses to the concerns raised.
Question 1: Despite its theoretical and empirical support, the proposed method appears incremental compared with PIA [a], which also aligns masked posteriors with user-specific targets. The GMM prior appears to be an extension of this approach, but the distinction and its advantages are not sufficiently justified. The moderate improvements over PIA reported in Table 1 warrant a more in-depth investigation.
Response:
We thank you for the valuable comments. We acknowledge that both LPD-VAE and PIA address the limitation of VAE-CF in exploiting global collaborative information. However, our work differs fundamentally from PIA in terms of research objectives and the methods designed to address the underlying problems.
(1) Differences between LPD-VAE and PIA.
PIA models the correlations among users' observed interactions in the interaction space. In contrast, we compute each user's LPD over the GMM components in the latent space and use it to discover latent collaboration among users in that space, that is, to find items that a given user has not interacted with but may be interested in, so as to more effectively alleviate the two limitations of vanilla VAE-CF.
PIA targets the insufficient use of far-but-related users in conventional VAE-CF. It introduces an Anchor Regularizer, derived from interaction behaviors, to align user posteriors with item embeddings and thereby promote global information sharing. However, PIA focuses on aligning user posteriors with item embeddings, and this strategy remains limited in uncovering relations between users who share little interaction history but may have similar latent preferences.
LPD-VAE uses the posterior responsibilities of the GMM components to construct a user's latent preference distribution (LPD), and thereby identifies users with similar latent preferences over the global latent preference components. It then mines candidate items from the neighbors' interaction histories, filters them with the target user's decoder to obtain potential positive samples, and introduces cross-user supervision through a preference alignment loss. As a result, LPD-VAE can further establish associations between users based on latent preferences, and more efficiently exploit the collaborative information provided by users with little interaction overlap.
Finally, we emphasize that the above description of the differences between LPD-VAE and PIA will be added to the experimental analysis and related work sections of the revised manuscript.
(2) The role of the GMM prior and its relationship to the proposed mechanism.
Unlike Multi-VAE+GMM, which only replaces the standard Gaussian prior with a GMM prior, LPD-VAE further leverages the GMM posterior probability of assignments to construct LPDs and establish latent preference collaborationss among users in the latent preference space. This enables the model to overcome the limitation of prior distribution modeling alone, which cannot explicitly capture collaborative relationships between users with similar latent preferences but limited overlap in their interaction histories. By exploiting collaborative information from such users, LPD-VAE provides additional samples for users with sparse feedback.
Finally, we will incorporate this distinction between Multi-VAE+GMM and LPD-VAE into the experimental analysis section of the revised manuscript.
(3) Additional experiments and analyses.
To further distinguish the contribution of the GMM prior from that of the subsequent collaborative mechanism, and to verify the effectiveness and stability of the proposed method, we add the following experiments (detailed results are given in our responses to the corresponding comments of Reviewer EGJa). First, in the comparison of user similarity representations (Table 1), we compare, under the same mining procedure, neighbor retrieval based on zu (L2 and cosine), Soft-Prototype, and γu. γu performs best on both Multi-VAE and RecVAE. Second, regarding the quality of potential positives (Table 3), the proportion of selected potential positives that appear in the users’ test sets ranges from 0.095 to 0.128. Third, regarding stability and robustness, the hyperparameter sensitivity analysis shows that Recall@20 varies by no more than 0.015 (Table 2); the Jaccard similarity of the neighbor and potential positive sets across training stages reaches 0.98 after epoch 40 (Table 4); the start timing of mining has little effect on performance (Table 5); and all GMM components are used, with no component collapse (Table 7). Finally, regarding computational efficiency (Table 9), LPD takes less per-epoch training time than the corresponding PIA variants (Multi-VAE: 6.12 s vs. 10.46 s; RecVAE: 12.36 s vs. 12.57 s).