Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

4283125166 · Jun 202019922001200920172026
48 results for neighbor embedding

LNPE enhances local connections in embeddings using extended neighbor propagation.

problem Improving local connections and interactions in nonlinear dimensionality reduction.
method Inspired by GCN, LNPE extends 1-hop neighbors to n-hop neighbors in LLE.
result LNPE produces more faithful and robust embeddings with better topological and geometrical properties.

Neighbor embeddings balance attraction and repulsion to visualize data.

problem Visualizing high-dimensional datasets with trade-offs between continuous and discrete structures.
method Neighbor embeddings combine attractive and repulsive forces to visualize data.
result Changing the exaggeration parameter in t-SNE yields a spectrum of embeddings with a trade-off between continuous and discrete structures.

Improves visualization of high-dimensional data by correcting misleading artifacts in neighbor embedding methods.

problem Misleading visual artifacts in t-SNE and UMAP due to lack of data-independent manifold learning interpretations.
method LOO-map framework that extends embedding maps to the entire input space, identifying and correcting map discontinuities.
result Developed point-wise diagnostic scores to detect unreliable embedding points and improve hyperparameter selection.

Stochastic Neighbor Embedding and its variants are widely used dimensionality reduction techniques -- despite their popularity, no theoretical results are known. We prove that the optimal SNE embedding of well-separated clusters from high dimensions to any Euclidean space R^d manages to successfully separate the cluste…

2017-02-09abs ↗pdf ↗

Proposes MR-SNE for multimodal data visualization.

problem Visualizing data from multiple domains with relations across them.
method Extends t-SNE to compute augmented relations and jointly embed them in a low-dimensional space.
result Demonstrates promising performance in visualizing Flickr and Animal with Attributes 2 datasets.

Manifold learning now plays a very important role in machine learning and many relevant applications. Although its superior performance in dealing with nonlinear data distribution, data sparsity is always a thorny knot. There are few researches to well handle it in manifold learning. In this paper, we propose Hierarchi…

2019-09-16abs ↗pdf ↗

Improves time series classification with forest proximities.

problem Time series classification accuracy and efficiency.
method PF-GAP, an extension of RF-GAP proximities to proximity forests, combined with Multi-Dimensional Scaling and Local Outlier Factors.
result Forest proximities show stronger connection between misclassified points and outliers.

Heterophily affects GNN robustness; separating ego- and neighbor-embeddings improves defense.

problem The robustness of GNNs to adversarial attacks.
method Formalized relation between heterophily and GNN robustness; empirical analysis; design principles for improved robustness.
result Separating ego- and neighbor-embeddings increases GNN robustness.

New method uses MHN for associative learning in network embedding.

problem Represent nodes in networks as low-dimensional vectors while incorporating topological and structural information.
method Introduces Modern Hopfield Networks (MHN) for associative learning between node content and neighbors.
result Competitive performance on node classification and linkage prediction tasks.

GICDM corrects hubness in embedding spaces for better generative model evaluation.

problem Hubness phenomenon distorts distances in high-dimensional embedding spaces.
method Generative ICDM (GICDM) using multi-scale extension to correct neighborhood estimation.
result GICDM resolves hubness-induced failures and improves metric behavior.

New methods use vector search and nearest-neighbor matching for policy learning in causal inference.

problem Learning optimal policies in causal inference with limited data.
method RAG-based policy learning with vector search and nearest-neighbor matching.
result The methods bound the within-candidate choice regret and evaluate the one-step method directly as a policy.

The t-distributed Stochastic Neighbor Embedding (t-SNE) is a powerful and popular method for visualizing high-dimensional data. It minimizes the Kullback-Leibler (KL) divergence between the original and embedded data distributions. In this work, we propose extending this method to other f-divergences. We analytically a…

2018-11-03abs ↗pdf ↗

NESS improves neighbor embedding for smooth cell-state transitions in single-cell data.

problem Challenges in extracting smooth, low-dimensional representations from noisy single-cell data.
method Builds on PCS framework to develop NESS, a stable machine learning approach.
result NESS consistently yields useful biological insights across diverse single-cell datasets.

Paper studies t-SNE convergence with generalized kernels.

problem Understanding convergence of t-SNE with generalized kernels.
method Concrete formulation of generalized kernels, proving convergence to an equilibrium distribution.
result t-SNE converges to an equilibrium distribution under certain conditions for generalized kernels.

The distance metric plays an important role in nearest neighbor (NN) classification. Usually the Euclidean distance metric is assumed or a Mahalanobis distance metric is optimized to improve the NN performance. In this paper, we study the problem of embedding arbitrary metric spaces into a Euclidean space with the goal…

2007-06-24abs ↗pdf ↗

This paper proves the manifold hypothesis for lower embedding dimensions using osculating hyperspheres.

problem The dataset lies on a low-dimensional submanifold in high-dimensional space.
method Constructing osculating hyperspheres and applying surgery theory to embed the hypersurface.
result The manifold hypothesis holds for embedding dimensionalities up to d1d-1.

Proposes a boundary detection method inspired by LLE for high-dimensional data.

problem Identifying boundary points from data on an embedded manifold.
method Inspired by locally linear embedding, uses nearest neighbor search schemes and spectral properties of local covariance matrix.
result Enhanced boundary detection in noisy data.

The local linear embedding algorithm (LLE) is a non-linear dimension-reducing technique, widely used due to its computational simplicity and intuitive approach. LLE first linearly reconstructs each input point from its nearest neighbors and then preserves these neighborhood relations in the low-dimensional embedding. W…

2008-08-06abs ↗pdf ↗

Improved multi-task averaging reduces mean squared error in high-dimensional data.

problem Joint estimation of multiple distributions using independent data sets.
method Exploits similarities between tasks by shrinking naive estimators towards local averages.
result The method provides a significant reduction in mean squared error, especially in high-dimensional spaces.

In this paper, we focus on learning low-dimensional embeddings for nodes in graph-structured data. To achieve this, we propose Caps2NE -- a new unsupervised embedding model leveraging a network of two capsule layers. Caps2NE induces a routing process to aggregate feature vectors of context neighbors of a given target n…

2019-11-12abs ↗pdf ↗

GTEA learns node representations in temporal interaction graphs.

problem Inductive representation learning on temporal interaction graphs.
method Integrates sequence model with time encoder and self-attention scheme for edge and node embeddings.
result GTEA learns comprehensive node representations capturing temporal and structural characteristics.

Estimates missing distributions using nearest neighbors with kernel methods.

problem Missing data and unobserved confounding in multivariate distributions.
method Distributional matrix completion framework with kernel nearest neighbors.
result Consistent recovery of underlying distributions with missing data.

Stochastic neighbor embedding (SNE) and related nonlinear manifold learning algorithms achieve high-quality low-dimensional representations of similarity data, but are notoriously slow to train. We propose a generic formulation of embedding algorithms that includes SNE and other existing algorithms, and study their rel…

2012-06-18abs ↗pdf ↗

End-to-end deep metric learning tackles multi-label image classification.

problem Multi-label image classification problem.
method Two-way deep distance metric learning in a latent space with a reconstruction module.
result Our method outperforms state-of-the-arts on publicly available image datasets.

We study intersection of two polyhedral spheres without self-intersections in 3-space. We find necessary and sufficient conditions on sequences x = x_1,x_2,...,x_n, y = y_1,y_2,...,y_n of positive integers, for existence of 2-dimensional polyhedra f,g in R^3 homeomorphic to the sphere and such that * f-g has n connecte…

2010-12-04abs ↗pdf ↗