---
title: "Osaka Metro University's SOM-OLP Cuts Classic Clustering Complexity From Quadratic to Linear"
subtitle: "A new objective-based Self-Organizing Map variant gives every data point its own continuous latent coordinate, cutting cost from O(NM²) to O(NM) while topping 16 benchmarks."
url: "https://alphasignal.ai/news/osaka-metro-university-s-som-olp-cuts-classic-clustering-complexity-from"
author: "AlphaSignal Newsroom"
author_url: "https://alphasignal.ai/editorial-team"
company: "AlphaSignal"
company_url: "https://alphasignal.ai/company/alphasignal"
published: "2026-10-28T01:16:29.453Z"
updated: "2026-10-28T01:18:48.952Z"
type: "Paper"
topics:
  - "Data"
  - "Benchmarks"
subtopics:
  - "Datasets"
upvotes: 3768
source_url: "https://arxiv.org/abs/2604.13622"
comments: 0
truncated: true
---

# Osaka Metro University's SOM-OLP Cuts Classic Clustering Complexity From Quadratic to Linear

> A new objective-based Self-Organizing Map variant gives every data point its own continuous latent coordinate, cutting cost from O(NM²) to O(NM) while topping 16 benchmarks.

Researchers at Osaka Metropolitan University have introduced Self-Organizing Maps with Optimized Latent Positions, or SOM-OLP, an objective-based variant of the classic self-organizing map. The method gives every data point a continuous coordinate on the map and reduces per-iteration complexity from STVQ’s O(NM²) to O(NM), where N is the number of data points and M is the number of map nodes. The [SOM-OLP paper](https://arxiv.org/abs/2604.13622) has been accepted at IJCNN 2026, part of the IEEE World Congress on Computational Intelligence.

A self-organizing map represents high-dimensional data with prototype vectors arranged on a low-dimensional grid, usually in two dimensions. Training attempts to preserve neighborhoods, so nearby inputs remain nearby on the grid. That combination supports clustering, visualization, and vector quantization, which compresses each input by associating it with a prototype.

## A 30-year cost problem

Classical SOM and Batch SOM train quickly, but their updates lack a single global objective that they are guaranteed to minimize. The [original STVQ paper](https://link.springer.com/chapter/10.1007/BFb0020223) addressed that limitation in the 1990s with Soft Topographic Vector Quantization. STVQ applies deterministic annealing to an energy function, uses temperature-dependent soft assignments between points and prototypes, and optimizes them through an expectation-maximization-style loop.

STVQ explicitly evaluates interactions across map neighborhoods for every data point. With dense neighborhood interactions, each iteration costs O(NM²). A later bias-variance decomposition reduces the bound to O(NM + M²), but the map nodes remain coupled and each point is represented through weights over fixed, discrete grid locations.

_Preview only. Full text requires an AlphaSignal Pro account._

## Sources

- [Self-Organizing Maps with Optimized Latent Positions](https://arxiv.org/abs/2604.13622)
- [Phase transitions in soft topographic vector quantization](https://link.springer.com/chapter/10.1007/BFb0020223)
- [An Annealed Self-Organizing Map for Source Channel Coding](https://papers.nips.cc/paper/1443-an-annealed-self-organizing-map-for-source-channel-coding)
- [Self-organizing maps: Generalizations and new optimization techniques](https://www.sciencedirect.com/science/article/abs/pii/S0925231298000356)
