


























Abstract:Both Dimensionality Reduction (DR) and Graph Drawing (GD) aim to visualize abstract, non-linear structures, yet rely on different optimization paradigms. This contrast is evident in Multidimensional Scaling (MDS), which typically depends on the SMACOF algorithm despite graph drawing results showing that simpler stochastic optimization schemes can be more effective for the same objective. We bridge these domains by adapting Stochastic Gradient Descent (SGD) techniques from graph drawing to vector data embedding. We present a scikit-learn compatible estimator that minimizes global stress through local pairwise updates, improving upon the existing implementation. Experiments on standard high-dimensional benchmarks show that our stochastic solver converges substantially faster than SMACOF while achieving comparable or lower stress.
| Comments: | To appear in GDxDR workshop 2026 |
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2605.00641 [cs.LG] |
| (or arXiv:2605.00641v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2605.00641 arXiv-issued DOI via DataCite (pending registration) |
From: Jacob Miller [view email]
[v1]
Fri, 1 May 2026 13:22:56 UTC (1,178 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。