- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes PACF, a training-time regularizer for matrix factorization under sparse implicit feedback. It combines BPR with a shared network that predicts signed user–item displacements and a trajectory-consistency loss that encourages positive trajectories to reach their items. Both auxiliary losses update the embeddings; the network is discarded at inference, preserving static inner-product scoring.
Critical strengths
S1. Important problem and practical design. PACF addresses limited supervision in sparse recommendation without complicating the deployed scorer. Its auxiliary network operates only during training, preserving MF’s inference complexity at the same embedding dimension.
S2. Interpretable theoretical contribution. Proposition 2 links flow-regression error to the dispersion of users sharing an item and label under bounded network sensitivity. This provides a concrete explanation of how shared regression can couple users, beyond simply reporting that an auxiliary loss improves accuracy.
Critical weaknesses
W1. The theoretical mechanism is not sufficiently validated in practice. The central bound becomes weaker as network sensitivity increases, but the paper does not establish a quantitatively useful sensitivity bound for its trained networks. Moreover, Proposition 2 provides a necessary condition for low regression error—not a guarantee of better ranking. The connection between the theory and observed improvements therefore remains incomplete.
W2. Novelty and necessity relative to simpler regularizers remain unclear. Closely related approaches—including DirectAU, UltraGCN, and graph-regularized MF—are discussed but not evaluated. Without these comparisons, the experiments do not establish whether pathwise regression offers a distinctive advantage over simpler embedding constraints.
W3. Experimental controls weaken attribution and confidence in some gains. Some endpoint and sampling controls receive only 150 tuning trials and report single-seed results, whereas PACF uses its 500-trial, five-seed main result. These differences confound component-level conclusions. Additionally, several improvements over the strongest baseline are small relative to seed variability, so paired statistical analysis is needed to establish reliable superiority. 40710_Pathwise_Alignment_for_C(…
Questions for authors
Please refer to the weaknesses.
4 comments
Follow-up: manuscript revisions and updated references
Thank you again for your review.
In response to Reviewer #ATCM's follow-up, we have further revised the manuscript to clarify the link between signed regression, shared residual coupling and positive endpoint consistency, as detailed in #ATCM-F1.
Some references in our earlier rebuttal have shifted. The following guide points to the latest revision:
- W1: the flow-gradient formula previously cited as Eq. (37) is now Eq. (42). The velocity residual norms , previously referenced as Tables 22–24, are specifically in Table 24. Sec. 5.1 now derives the local target-gradient correction in Eq. (16) for users sharing an item and label under the stated sensitivity condition. Figs. 9 and 10 show local sensitivity and co-user fitting gaps, Table 9 measures mean embedding-gradient directions, and Fig. 3 shows terminal normalized co-user dispersion.
- W2: the geometric controls are in Tables 3 and 14, and the independently tuned CoUser comparison is in Table 15. The revised mechanism distinguishes fixed geometric contraction from embedding corrections induced by a shared field's fitting residuals.
- W3: Eq. (9) expresses endpoint error through residuals at generated integration stages. This connects reference-state regression to the generated-state constraint in Eq. (10). The loss-removal, negative-target and target-gradient controls are in Tables 17, 18 and 20. Sec. 6.5.6 and Table 5 compare the static scorer with candidate-conditioned endpoint readouts, and Eq. (12) gives the gradient route into the retained static embeddings.
PACF couples co-users through the residuals of a shared field. The target-gradient component contracts embeddings of users sharing an item and label under the local conditions in Eq. (16). Trajectory consistency penalizes accumulated residuals at generated states. Both auxiliary losses update the static embeddings through Eq. (12). The endpoint readouts instead integrate a separate trajectory for each candidate. As the endpoint approaches its conditioning item, its inner-product score approaches the item norm squared and its distance score approaches zero. These limits explain the distinction between endpoint agreement and the static ranking score directly supervised by BPR.
With the discussion period nearing its end, we would appreciate your taking a look at our rebuttal and these revisions. If they resolve your concerns, please consider revising your score upward. We would be happy to clarify any remaining questions.
Follow-up: brief summary before the discussion closes
Thank you again for your review.
Our rebuttal and follow-up answer all of your weaknesses.
App. D.7 of the revised manuscript shows that one shared velocity field aligns all user–item paths and unifies PACF's components, and Lemma 7 shows that PACF contains the EP+ and CoUser penalties of Table 3 as special cases. Tables 4 and 16 to 20 show that each pathwise component lowers performance when removed under PACF's selected hyperparameters.
With two days of discussion left, we would be grateful if you could consider raising your score should these responses resolve your concerns.
Summary of our responses during discussion phase
Thank you again for recognizing PACF's practical design and its interpretable theory. Your questions led us to add trained-model diagnostics, direct comparisons and matched controls to the revised manuscript.
As the discussion period closes today, we summarize all answers in the table below, together with their locations in our responses and in the revised manuscript, to help you check each point directly.
| Question | Answer | Response | Revised paper |
|---|---|---|---|
| W1. Practical validation of the theory | Eq. (16) proves that the shared field contracts co-user embeddings near the item. Trained models confirm this prediction, since both auxiliary descent directions reduce co-user dispersion, whereas the BPR direction increases it. Eq. (E4) then links this contraction to ranking, and detaching the target gradient accordingly lowers performance. | W1, #ATCM-F2.8 | Sec. 5.1, Figs. 9, 10, Tables 9, 20 |
| W2. Simpler regularizers | PACF leads DirectAU, UltraGCN, SCCF, LightCCF and CoUser on all seven datasets. Beyond this empirical lead, Lemma 7 shows that PACF contains EP+ and CoUser as two special cases on positive pairs, a zero field and a field that ignores the path state. PACF thus extends both with the path state and the negative regression, and accordingly exceeds both under the same hyperparameters. | W2, #14vB-Q1 | Sec. 6.5.1, Lemma 7, Tables 2, 3, 15 |
| W3. Experimental controls | Each control keeps PACF's selected hyperparameters, splits and seeds, so each comparison isolates the changed component. Every control lowers performance over five seeds, so each component contributes to PACF's performance. PACF also ranks first by five-seed mean on every cell. | W3, #14vB-Q4 | Tables 4, 6, 7, 16 to 20 |
Other reviewers:
- Reviewer #ATCM asked for a unified motivation of PACF's components, answered in F2.1 and F2.9 of Follow-up 2 to #ATCM. One shared velocity field aligns all user–item paths, and all six components of PACF serve this one mechanism.
- Reviewer #14vB asked about explicit collaborative constraints, state sensitivity, the sign reversal, paired tests, an Amazon ablation, the solver and item popularity, answered in #14vB-Q1 to Q7.
We hope these answers address all of your questions. If they fully resolve your concerns, we would sincerely appreciate your considering an updated assessment.
We are grateful for your insightful comments.
The manuscript has been revised accordingly. Each heading below notes the updated sections and tables.
W1. Quantitative probes of sensitivity, dispersion, and updates (Sec. 5.1, App. C.3, Figs. 3, 9–10, Tables 8, 9, 24)
Proposition 2 is a residual lower bound under a shared predictor and a sensitivity condition. On trained models we therefore measure the local signatures of that condition directly.
Eq. (37) turns flow residuals into user updates:
∇pu∥eu(t)∥22=2[(1−t)Jh+μ(y)I]⊤eu(t).
At t=0.5 on sampled states we measure the state-Jacobian norm ∥Jh∥2, terminal co-user dispersion V, the Adam drift of Lf relative to BPR, the cosine Cf, and the dispersion derivatives Dk (units 10−6):
These numbers make the residual mechanism concrete. Finite ∥Jh∥2, positive target–prediction gaps in Fig. 10, and E±>0 in Tables 22–24 show shared-fitting conflict at probed states. Near-zero Cf and Df,Dt<0 show that the auxiliary terms supply a geometric direction distinct from BPR and oriented toward lower mean relative dispersion. Fig. 3 then records lower terminal V than BPR. Together with the matched ablations in W3, the evidence chain is therefore: conflict is observed, auxiliary gradients have a different geometry, and deleting those training paths hurts ranking.
W2. Comparisons with DirectAU, UltraGCN, SCCF, & CoUser (Sec. 6.5.1, App. C.4, Tables 2, 3, 14, 15)
The full seven-dataset HPO comparison is reported in #14vB-Q1. Here we separate the mechanisms that produce that ranking lead.
CoUser adds κRc=∣E∣κ∑i∑u∈Si∥pu−pˉi∥22 to BPR-MF. By the identity ∑u∈Si∥pu−qi∥22=∑u∈Si∥pu−pˉi∥22+∣Si∣∥pˉi−qi∥22 CoUser contracts users toward pˉi and leaves pˉi free of qi. EP$^+$ instead restores an item anchor by a fixed distance pull. PACF fits common displacements into vθ and updates embeddings through leftover residuals. Fig. 3 and Table 3 support that geometric contrast under matched hyperparameters, while Tables 2, 6, and 7 place PACF ahead of published graph and contrastive methods under their own HPO.
W3. Ablations & reliability (Sec. 6.5.1–6.5.6, App. C.1, C.4, Tables 3–5, 14–21)
Matched ablations under PACF's selected hyperparameters identify which residual-coupling modules move ranking. #14vB-Q4 reports the main-table Yelp paired gaps versus LightCCF under the same five-seed protocol.
With the same hyperparameters, splits, initializations, and 500-epoch budgets, the matched substitutes below change the named factor. The joint control β=0 with t∼Beta(1,5) from Table 17 is included as a simultaneous path/loss stress test. The table reports five-seed NDCG@10 in percent as mean ± STD:
These matched gaps show that shared field, path support, signed targets, and both pathwise losses each move ranking under one fixed protocol. Sec. 6.5.6 further shows that the static readout a leads aΦ and adist, so the retained gain is amortized into the scorer. On the main comparison, #14vB-Q4 reports Yelp mean leadership with positive paired gaps and CIs that cover both signs under the five-seed protocol.