AI & ML
Node Localization by Multidimensional Scaling with Iterative Majorization
arXiv stat.ML0 views
arXiv:2611.18466v1 Announce Type: new Abstract: Node localization aims to estimate the positions of nodes based on collected data from other nodes. Depending on the data characteristics, different procedures are utilized to estimate the locations. In this paper, we introduce a comprehensive multidimensional scaling algorithm based on iterative majorization that comprises many of the different data characteristics to estimate node locations. The implicitly normalized loss function provides absolute distances and, given anchors, absolute node locations. The algorithm uses a new convergent coordinate descent procedure for the minimization of the majorization function, allowing for a natural treatment of anchors. Optimal transformations of the data seamlessly allows other data than Euclidean distances. Data from multiple sources, resulting in either asymmetric or three-way data, fit the same extensive framework.
Source:https://arxiv.org/abs/2611.18466PreviousMesh-Free Weak-Form Regression for Learning Interaction Kernels from Particle TrajectoriesNextContrastive latent representation learning with denoising score matching
Related posts
In which John becomes a Machine Learning researcher
0Hacker News New
Can We Fix AI?
0Hacker News New
I'm Glad That Literary Awards Are Going to AI
0Hacker News New
Show HN: TalentRadar – 3D geospatial tech compensation and role radar
0Hacker News Show
Show HN: Brief2mp4 – ClaudeCode/Codex skill that checks videos against the brief
0Hacker News Show
Show HN: Figma Like AI Landing Page Builder
0Hacker News Show