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,932 papers · 148 categories

Trend · papers per month

72143215286 · Jun 202019922001200920172026
48 results for similarity preservation

Proposes a method to preserve graph similarities for better clustering accuracy.

problem Sub-optimal performance due to non-similarity-preserving kernels in graph-based clustering.
method Adaptive graph learning method that preserves pairwise similarities and unifies clustering and graph learning.
result Improves clustering accuracy by preserving pairwise similarities in the graph.

In this paper we study Moebius applicable surfaces, i.e., conformally immersed surfaces in Moebius 3-space which admit deformations preserving the Moebius metric. We show new characterizations of Willmore surfaces, Bonnet surfaces and Harmonic inverse mean curvature surfaces in terms of Moebius or similarity invariants…

2005-12-13abs ↗pdf ↗

Reproduces IVFS for high-dimensional data structure preservation.

problem Preserving high-dimensional data structure in unsupervised feature selection.
method Inspired by random subset method, IVFS maintains data similarity through topological structure.
result IVFS outperforms SPEC and MCFS on most datasets.

Data similarity is a key concept in many data-driven applications. Many algorithms are sensitive to similarity measures. To tackle this fundamental problem, automatically learning of similarity information from data via self-expression has been developed and successfully applied in various models, such as low-rank repr…

2019-03-11abs ↗pdf ↗

IVFS simplifies feature selection for high-dimensional data preservation.

problem Maintaining structure and pairwise distances in high-dimensional data.
method IVFS framework based on persistent diagrams from computational topology.
result IVFS well preserves pairwise distances and topological patterns of full data.

The paper examines how well node similarities are preserved by random projections in graph embeddings.

problem The preservation of node similarities under random projections in graph embeddings.
method Investigation of dot product and cosine similarity preservation by random projections over graph matrix rows.
result Random projections produce unreliable embeddings for dot product, especially for high-degree nodes.

We show that surgery on a connected clover (or clasper) with at least one loop preserves the concordance class of a knot. Surgery on a slightly more special class of clovers preserves invertible concordance. We also show that the converse is false. Similar results hold for clovers with at least two loops vs. S-equivale…

2001-02-13abs ↗pdf ↗

Matrix factorization is at the heart of many machine learning algorithms, for example, dimensionality reduction (e.g. kernel PCA) or recommender systems relying on collaborative filtering. Understanding a singular value decomposition (SVD) of a matrix as a neural network optimization problem enables us to decompose lar…

2017-02-06abs ↗pdf ↗

This article gives an alternative approach to the self-shrinking and self-expanding solutions of the curve shortening flow, which are related to singularity formation of the mean curvature flow. The motivation for the self-similar solutions arises from natural area preserving rescaling. Further we describe the self-sim…

2015-05-27abs ↗pdf ↗

Embeddings of lab test codes improve mortality prediction and preserve ordinality.

problem Improving mortality prediction using lab test embeddings.
method Training embeddings for LOINC codes and their concatenations with abnormality symbols, evaluating performance on mortality prediction tasks.
result Embeddings of lab test codes improve mortality prediction and preserve ordinality.

Study proves existence and properties of shrinkers in area-preserving curve-shortening flow.

problem Existence and properties of shrinkers in area-preserving curve-shortening flow.
method Using known results on λ-curves, we prove existence of non-circular shrinkers and deduce a saddle-point property.
result Existence and properties of shrinkers in area-preserving curve-shortening flow, including a saddle-point property.

Binary autoencoder with sparse hidden layer preserves information and zero reconstruction error.

problem Preserving information and zero reconstruction error in binary neural networks.
method Binary autoencoder with random binary weights, sparse hidden layer, and varying neuron thresholds.
result Zero reconstruction error for any input with a large hidden layer and varying neuron thresholds.

Fix a free, orientation-preserving action of a finite group G on a 3-dimensional handlebody V. Whenever G acts freely preserving orientation on a connected 3-manifold X, there is a G-equivariant imbedding of V into X. There are choices of X closed and Seifert-fibered for which the image of V is a handlebody of a Heegaa…

2001-10-07abs ↗pdf ↗

Proposes a novel approach using vector cross product to preserve directional edges in directed graphs.

problem Preserving directional edges in directed graphs for tasks like link prediction and node recommendation.
method Integrates the non-commutative property of vector cross product into a Siamese neural network to learn N-dimensional embeddings.
result Low-dimensional embeddings effectively preserve directional properties and outperform state-of-the-art methods.

Null Lagrangian-preserving surgeries are a generalization of the Garoufalidis and Rozansky null-moves, that these authors introduced to study the Kricker lift of the Kontsevich integral, in the setting of pairs (M,K) composed of a rational homology sphere M and a null-homologous knot K in M. They are defined as replace…

2012-07-09abs ↗pdf ↗

Study shows how flat flow solutions in 2D converge to disks.

problem Understanding the asymptotics of area-preserving mean curvature flow in 2D.
method Analyzes flat flow solutions starting from bounded sets of finite perimeter.
result Flat flow solutions converge to a union of equally sized disks with exponential rate.

DNN-based cross-modal retrieval has become a research hotspot, by which users can search results across various modalities like image and text. However, existing methods mainly focus on the pairwise correlation and reconstruction error of labeled data. They ignore the semantically similar and dissimilar constraints bet…

2017-03-21abs ↗pdf ↗

Study on stability of surfaces in null cones under area-preserving variations.

problem Investigating stability of spacelike cross sections of null cones.
method Area-preserving variations, Hawking energy analysis, spherical cross sections.
result Only round spheres are stable cross sections of the standard Minkowski lightcone.

CTGCN learns dynamic graph embeddings preserving both local and global graph structure.

problem Learning node representations for evolving graphs while preserving both local and global graph structure.
method CTGCN uses k-core based temporal graph convolutional network to learn dynamic graph embeddings.
result CTGCN outperforms existing methods in link prediction and structural role classification.

Post-processing corrects bias in ML systems without retraining.

problem Correcting bias in ML systems that are already in use.
method Proposes general post-processing algorithms for individual fairness based on graph Laplacian regularization.
result Empirically, post-processing algorithms correct individual biases in large-scale NLP models while preserving accuracy.

LPL optimizes embeddings to align local neighborhoods, improving cross-lingual word alignment.

problem Aligning embeddings across different datasets and languages.
method Locality Preserving Loss (LPL) optimizes model to project embeddings while maintaining local neighborhoods and aligning them.
result LPL-based alignment leads to better and consistent accuracy, especially in small training set settings.

The study identifies exceptions to fiber-preserving symmetry in ODEs and systems.

problem Identifying exceptions to fiber-preserving symmetry in ODEs and systems.
method Lie's classification of Lie algebras of vector fields, absolute and relative scalar differential invariants, conditional and vector-valued relative invariants, prolongations of actions.
result Examples of scalar ODEs and systems with symmetry groups not fiber-preserving.

The goal of homomorphic encryption is to encrypt data such that another party can operate on it without being explicitly exposed to the content of the original data. We introduce an idea for a privacy-preserving transformation on natural language data, inspired by homomorphic encryption. Our primary tool is {\em obfusc…

2019-04-21abs ↗pdf ↗

Paper proposes G-CRD to improve GNNs by preserving global graph topology.

problem Improving lightweight GNNs for robust performance on large-scale real-world graphs.
method Introduces Graph Contrastive Representation Distillation (G-CRD) using contrastive learning.
result G-CRD consistently boosts GNN performance and robustness, outperforming existing methods.

This paper applies secure multi-party computation to K-means clustering to protect private data.

problem Privacy-preserving K-means clustering for distributed private data.
method Secure multi-party computation (MPC) techniques to protect private data during K-means clustering.
result Privacy-preserving K-means clustering is feasible and effective for both horizontal and vertical data distribution.

The paper studies the stability of volume and area preserving mean curvature flows in Schwarzschild and asymptotic Schwarzschild spaces.

problem Investigating the stability of mean curvature flows in specific spacetime geometries.
method Combining center manifold analysis with global existence results for flows near isoperimetric hypersurfaces.
result Global existence and convergence to constant mean curvature (CMC) hypersurfaces for flows in asymptotic Schwarzschild space.

In joint work with Yang Huang, we defined a canonical absolute grading on Heegaard Floer homology by homotopy classes of oriented 2-plane fields. A similar grading was defined on embedded contact homology by Michael Hutchings. In this paper we show that the isomorphism between these homology theories defined by Colin-G…

2014-03-12abs ↗pdf ↗

SDSPCAAN combines supervised and local data structures for better dimensionality reduction.

problem Preserving both global and local data structures for noisy high-dimensional data.
method Supervised discriminative sparse PCA with adaptive neighbors (SDSPCAAN).
result SDSPCAAN improves classification accuracy on high-dimensional datasets.

As a highlighting research topic in the multimedia area, cross-media retrieval aims to capture the complex correlations among multiple media types. Learning better shared representation and distance metric for multimedia data is important to boost the cross-media retrieval. Motivated by the strong ability of deep neura…

2017-04-14abs ↗pdf ↗