arXiv Machine Learning By Henry Han, Luyu Niu, Diane Li, Jiacun Wang

Differential rank preservation manifold learning

Read the original on arXiv Machine Learning →

The paper introduces Smooth Rank t‑SNE (SR‑tSNE), a variant of t‑SNE that incorporates a differentiable rank term using a sigmoid approximation to preserve the ordering of neighbors in the embedding. It also proposes Ordinal DLP (O‑DLP), a metric that rewards neighbors only when they appear at their original rank. Across eight diverse benchmarks, SR‑tSNE outperforms 12 baselines in rank preservation, neighborhood overlap, and downstream tasks such as label transfer, cell‑type discovery, and intraday trading.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Computer Vision
Sep 3

Aggregating Neighbor Embedding Projection and Rank-Based Manifold Learning for Image Retrieval

The paper introduces a new image retrieval framework that merges neighbor embedding projections with rank-based manifold learning via rank aggregation. It uses UMAP to create low‑dimensional feature representations and combines ranked lists from UMAP and rank‑based re‑ranking methods using the Borda Count strategy. Experiments on public datasets with ResNet152, Swin Transformer, and DINOv2 features show that this combined approach improves retrieval performance, especially in scenarios where baseline representations have low precision.

By Vinicius Atsushi Sato Kawai, Gustavo Rosseto Leticio, Lucas Pascotti Valem, Daniel Carlos Guimar\~aes Pedronette
arXiv Machine Learning
Sep 1

Effective Graph and Rank-based Contextual Embeddings for Textual and Multimedia Data

arXiv:2608.29001v1 Announce Type: new Abstract: In a data-driven world, efficiently organizing and mapping relationships between objects is crucial. Graphs are powerful tools for modeling these conne...

By Thiago C\'esar Castilho Almeida, Gustavo Rosseto Let\'icio, Lucas Pascotti Valem, Andr\'e Freitas, Daniel Carlos Guimar\~aes Pedronette
arXiv Machine Learning
Aug 19

How smoothing the affinity matrix affects neighborhood preservation in t-SNE

The paper investigates how adjusting the sharpness of t‑SNE’s affinity matrix influences neighborhood preservation across scales. By applying a row‑wise power transform parameterized by γ, the authors can smooth or sharpen each row while keeping sparsity and rank order intact, effectively rescaling the Gaussian bandwidth and altering local perplexities. Experiments show that sharpening enhances the retention of the very nearest neighbors, whereas smoothing improves the preservation of broader local neighborhoods, outperforming existing multiscale affinity methods in the mid‑local range.

By Shirin Mohebi, Guillaume Bied, Jefrey Lijffijt