Strong/Weak Graph Edges Encode Opposite Relations in CF
_reachsumit · x · 2026-09-01
Paper challenges the assumption that strong and weak edges encode the same relation in graph collaborative filtering, showing they encode qualitatively different relations in choice-derived graphs.
Key Findings:
- Strong Edges: Concentrate on in-slate competitors of clicked items, exactly the pairs ranking gradients push apart.
- Weak Edges: Do not exhibit this property.
Theory: Formalizes this as a sign mismatch between the smoothing operator and the ranking gradient.
Empirical Evidence: Explains three observations on MIND and EB-NeRD:
- Choice-derived operators fail to beat co-click graphs.
- Uniform scalar fixes (sign flip, margin loss) fail predictably.
- Only edge-magnitude-aware operators recover the predicted ordering.
More from Research
- Why "it feels better" isn't good enough for production LLM decisions — camerongreen95 · 2026-09-01
- Abliteration technique removes model refusals while keeping coding/cyber capabilities, sparking debate — aryaman2020 · 2026-09-01
- Explanation of Denoising Diffusion Models and Score Matching — ariG23498 · 2026-09-01
- LightRAG: Simple and Fast Retrieval-Augmented Generation — goyalshaliniuk · 2026-09-01
- 10 GitHub repos to learn RAG: from embeddings to production systems — goyalshaliniuk · 2026-09-01
- NVIDIA Introduces Hydra-0: A Generalist World Model for Robotics — chris_j_paxton · 2026-09-01