Scalable Force Scheme: a fast method for projecting large datasets

Global dimensionality reduction (DR) methods are widely used to project high-dimensional data into a low-dimensional representation, preserving the overall structure of the dataset. Global nonlinear DR techniques allow one to capture complex features of the data but are limited by their high computational cost, making them an unfeasible choice to process large datasets. Force scheme (FS) is one of the most popular of such examples, being adopted in a wide variety of domains, but limiting its application to small datasets. In this paper, we extend FS to improve its convergence quality and speed, by introducing several concepts from gradient descent (GD) theory and lowering its algorithmic complexity. Our new proposed method is less prone to generate distorted projections due to the presence of artifacts, while significantly improving the running times, allowing for nonlinear global DR projections of large datasets.

Institutions

Publication Details

Journal
Eurographics
Published
2025-01-01
DOI
https://doi.org/10.2312/eurova.20251098
Primary Topic
Stochastic Gradient Optimization Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Scalable Force Scheme: a fast method for projecting large datasets

Eurographics
Stochastic Gradient Optimization Techniques
article

Scalable Force Scheme: a fast method for projecting large datasets

article en

Abstract

Global dimensionality reduction (DR) methods are widely used to project high-dimensional data into a low-dimensional representation, preserving the overall structure of the dataset. Global nonlinear DR techniques allow one to capture complex features of the data but are limited by their high computational cost, making them an unfeasible choice to process large datasets. Force scheme (FS) is one of the most popular of such examples, being adopted in a wide variety of domains, but limiting its application to small datasets. In this paper, we extend FS to improve its convergence quality and speed, by introducing several concepts from gradient descent (GD) theory and lowering its algorithmic complexity. Our new proposed method is less prone to generate distorted projections due to the presence of artifacts, while significantly improving the running times, allowing for nonlinear global DR projections of large datasets.

Eurographics
Eindhoven University of Technology (NL)
Openalex Percentile: Top 78%
Stochastic Gradient Optimization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.