Metraipolis › archive › dc_ceef2b8e75e6

The Edge Spectrum of Choice-Derived Item Graphs: Strong and Weak Edges Encode Different Relations in Collaborative Filtering — arXiv:2608.29578

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.29578
License (as archived)
CC0-1.0
Archived
2026-10-17T09:44:16.932Z
SHA-256 of the archived text
0496fb742f717da2784b619170c1a174cac298f2c15613c0dd81cd3ef4d11e0a
Stable URL of this page
https://metraipolis.com/documento/dc_ceef2b8e75e6

How to cite

The Edge Spectrum of Choice-Derived Item Graphs: Strong and Weak Edges Encode Different Relations in Collaborative Filtering — arXiv:2608.29578 — arXiv (en), https://arxiv.org/abs/2608.29578 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ceef2b8e75e6 (Metraipolis archive dc_ceef2b8e75e6, sha256 0496fb742f717da2784b619170c1a174cac298f2c15613c0dd81cd3ef4d11e0a)
BibTeX
@misc{dcceef2b8e75e6,
  title = {The Edge Spectrum of Choice-Derived Item Graphs: Strong and Weak Edges Encode Different Relations in Collaborative Filtering — arXiv:2608.29578},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.29578},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ceef2b8e75e6; sha256 0496fb742f717da2784b619170c1a174cac298f2c15613c0dd81cd3ef4d11e0a},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.29578. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Graph collaborative filtering relies on item--item graphs whose edges are used for positive smoothing, under the implicit assumption that stronger edges encode more of the same relation as weaker ones. We show that this assumption fails for a practically important class of graphs: those whose edge weights come from a choice model. On such graphs, strong and weak edges encode qualitatively different relations, which we call an edge spectrum. Specifically, strong edges concentrate on the in-slate competitors of clicked items, exactly the pairs that the within-slate ranking gradient pushes apart, while weak edges do not. We formalize this as a sign mismatch between the smoothing operator and the ranking gradient, and prove that co-click graphs cannot exhibit the same misalignment by construction. This diagnosis explains three empirical observations on MIND and EB-NeRD: (i) drop-in choice-derived operators do not beat co-click, despite indexing structurally distinct neighborhoods; (ii) uniform scalar fixes (sign flip, in-slate margin loss) fail predictably, because the misalignment lives in the graph, not in the loss; (iii) only edge-magnitude-aware operators, with the regime boundary located by the diagnosis rather than by tuning, recover the predicted ordering. The neighbor cutoff $k$ is therefore a semantic switch, not a sparsification hyperparameter. Our claim concerns which interventions fail or succeed and why, not absolute headline gains, which the diagnosis itself predicts to be small under the attenuated propagation channel we observe. We turn the diagnosis into a reusable protocol practitioners can run before deploying any choice-derived item-side operator. Code: this https URL .

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-01 in cs.IR).
Categorie arXiv: Information Retrieval (cs.IR).
Pagina del lavoro: https://arxiv.org/abs/2608.29578 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T09:12:53.466Z dalla pagina https://arxiv.org/catchup/cs.IR/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).