Metraipolis › archive › dc_a3448dfbdd53

Model-Based Learning of Latent Euclidean Embedding from Relational Data — arXiv:2611.00765

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.00765
License (as archived)
CC0-1.0
Archived
2026-11-03T11:24:55.943Z
SHA-256 of the archived text
870a5dc1e597b8d9ea0143961b304d901a0cee4196c533c412d92d3d2d81d7cf
Stable URL of this page
https://metraipolis.com/documento/dc_a3448dfbdd53

How to cite

Model-Based Learning of Latent Euclidean Embedding from Relational Data — arXiv:2611.00765 — arXiv (en), https://arxiv.org/abs/2611.00765 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a3448dfbdd53 (Metraipolis archive dc_a3448dfbdd53, sha256 870a5dc1e597b8d9ea0143961b304d901a0cee4196c533c412d92d3d2d81d7cf)
BibTeX
@misc{dca3448dfbdd53,
  title = {Model-Based Learning of Latent Euclidean Embedding from Relational Data — arXiv:2611.00765},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.00765},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a3448dfbdd53; sha256 870a5dc1e597b8d9ea0143961b304d901a0cee4196c533c412d92d3d2d81d7cf},
  year = {2026}
}

Archived text

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

Visualizing and interpreting the dependence structure in relational data often benefits from geometric representations via low-dimensional Euclidean embeddings. However, existing approaches are typically restricted to specific response types, rely on burdensome high-dimensional nonconvex optimization, or lack uniform theoretical guarantees for simultaneous coordinate recovery. To address these limitations, we introduce a unified, distance-based latent space framework for both unipartite and bipartite relational data---accommodating continuous, binary, ordinal, and count-valued observations---via a modular two-stage procedure that decouples signal estimation from geometric recovery. First, we estimate the low-rank signal matrix using spectral denoising. For models with nonlinear link functions, we further apply one-step row- and column-wise refinement to achieve uniform entrywise accuracy. Second, we recover the latent configurations through direct spectral analysis for unipartite data and a low-dimensional alignment optimization for bipartite data. We establish uniform recovery guarantees that characterize the propagation of error from signal estimation to the embedding space. To illustrate the scalability and interpretability of our approach, we apply the proposed method to two real-world datasets: a statistician citation network and European Parliament voting records.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno).
Categorie arXiv: Machine Learning (stat.ML) ; Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2611.00765 — 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-11-03T11:02:37.788Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).