cd /news/machine-learning/incremental-roseland-batch-wise-land… · home › topics › machine-learning › article
[ARTICLE · art-172338] src=arxiv.org ↗ pub= topic=machine-learning verified=true sentiment=↑ positive

Incremental Roseland: Batch-wise Landmark Diffusion via Kernelized Sequential Karhunen--Lo\`eve Update

Researchers introduced incremental Roseland (iRoseland), a method that updates the landmark diffusion (Roseland) spectral embedding batch-wise using a kernelized Sequential Karhunen-Loève (SKL) scheme, according to arXiv paper 2611.23414v1. iRoseland requires only a single pass over the data and runs in bounded memory with state independent of the number of points processed, and a forgetting factor lets it track drifting distributions. Experiments show agreement with Roseland to round-off on stationary data and accuracy exceeding equal-memory Roseland by an order of magnitude on long streams.

key takeaway

iRoseland updates the Roseland landmark-diffusion embedding in a single bounded-memory pass via a kernelized Sequential Karhunen-Loève scheme, matching Roseland to round-off on stationary data and beating equal-memory Roseland by an order of magnitude on long streams.

by read1 min views4 publishedNov 19, 2026

arXiv:2611.23414v1 Announce Type: new Abstract: Landmark diffusion (Roseland) computes a diffusion-map-style spectral embedding from the singular value decomposition of a degree-normalized data-to-landmark kernel matrix, at a cost far below that of full diffusion maps. It assumes, however, that all data are available at once. We introduce incremental Roseland (iRoseland), which casts the landmark affinity as a row-growing matrix whose SVD can be updated with a kernelized Sequential Karhunen--Lo`eve (SKL) scheme. Degre correction is handled by a first order expansion about a reference mean kernel row and so that the landmark-side eigenbasis may be recovered from a single landmark-by-landmark eigendecomposition at each step. The presented method requires only a single pass over the data and runs in bounded-memory with state independent of the number of points processed. A forgetting factor lets the method track drifting distributions, and a sample-size-invariant embedding keeps outputs comparable across time. Experiments show agreement with Roseland to round-off on stationary data, and accuracy that exceeds equal-memory Roseland by an order of magnitude on long streams. On drifting data, we observe large gains from forgetting with a window matched to the drift.

── more in #machine-learning 4 stories · sorted by recency
── more on @roseland 3 stories trending now
sponsored brought to you by zahid.host 4,200+ EU-deployed projects
reading about agents? ship yours in a single git push.

Run your AI side-project on zahid.host

EU-based hosting, git-push deploys, automatic HTTPS, no cold starts. Free tier with a custom domain — perfect for shipping the agent you just read about.

$git push zahid main
→ Live at https://your-agent.zahid.host ✓
Get free account → Pricing
from €0/mo · no card required
LIVE [news/incremental-roseland…] indexed:0 read:1min 2026-11-19 · —