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

60120180240 · May 202619922001200920172026
48 results for local neighborhoods

NEAR improves graph classification by aggregating edge information.

problem Loss of local structure and relationships in 1-hop neighborhood GNNs.
method Proposes NEAR, a framework that aggregates edge information between nodes in the neighborhood.
result NEAR improves graph classification tasks over existing 1-hop based GNN algorithms.

Many prediction problems can be phrased as inferences over local neighborhoods of graphs. The graph represents the interaction between entities, and the neighborhood of each entity contains information that allows the inferences or predictions. We present an approach for applying machine learning directly to such graph…

2016-11-21abs ↗pdf ↗

A study compares local music recommendation algorithms, finding neighborhood-based methods perform best.

problem Cold-start problem for local artists with little user preference data.
method Comparison of three recommender system algorithms (IIN, ALS, BPR) on local music recommendation task.
result Neighborhood-based approach (IIN) performs best for local music recommendation.

Spectral analysis of neighborhood graphs is one of the most widely used techniques for exploratory data analysis, with applications ranging from machine learning to social sciences. In such applications, it is typical to first encode relationships between the data samples using an appropriate similarity function. Popul…

2016-12-14abs ↗pdf ↗

We classify torsion-free real-analytic affine connections on compact oriented real-analytic surfaces which are locally homogeneous on a nontrivial open set, without being locally homogeneous on all of the surface. In particular, we prove that such connections exist. This classification relies in a local result that cla…

2013-04-19abs ↗pdf ↗

We present a simple and fast geometric method for modeling data by a union of affine subspaces. The method begins by forming a collection of local best-fit affine subspaces, i.e., subspaces approximating the data in local neighborhoods. The correct sizes of the local neighborhoods are determined automatically by the Jo…

2010-10-17abs ↗pdf ↗

NNK algorithm improves neighborhood and graph construction for machine learning.

problem Ad hoc selection of k and ε parameters in kNN and ε-neighborhood methods.
method NNK algorithm for better sparse signal approximation.
result NNK leads to superior performance in local neighborhood and graph-based machine learning tasks.

This article is one of three highly influential articles on the topology of manifolds written by Robert D. Edwards in the 1970's but never published. Organizers of the Workshops in Geometric Topology (http://www.uwm.edu/~craigg/workshopgtt.htm) with the support of the National Science Foundation have facilitated the pr…

2009-04-29abs ↗pdf ↗

We propose a spectral clustering method based on local principal components analysis (PCA). After performing local PCA in selected neighborhoods, the algorithm builds a nearest neighbor graph weighted according to a discrepancy between the principal subspaces in the neighborhoods, and then applies spectral clustering. …

2013-01-09abs ↗pdf ↗

We will prove a Moser-type theorem for self-dual harmonic 2-forms on closed 4-manifolds, and use it to classify local forms on neighborhoods of singular circles on which the 2-form vanishes. Removing neighborhoods of the circles, we obtain a symplectic manifold with contact boundary - we show that the contact form on e…

1997-05-30abs ↗pdf ↗

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.

New proof shows how to identify DAGs with weakly increasing errors.

problem Identifying the true DAG in models with weakly increasing error variances.
method Minimum-trace DAG method and hill climbing algorithm with R2R neighborhood.
result Hill climbing algorithm without strict local optima under weakly increasing error variances.

The paper addresses fairness in facility location by considering local population densities.

problem Ensuring fair distribution of facilities based on local population sizes.
method Formulated a fairness concept involving neighborhood radius and applied an approximation algorithm.
result The algorithm guarantees a factor of at most 2 in all metric spaces and outperforms standard clustering algorithms.

New method for estimating local structure around target nodes in DAGs.

problem Challenges in learning causal DAG structures in high-dimensional settings.
method Constraint-based method for estimating local structure around multiple target nodes.
result Consistency results for estimating local neighborhood structure of target nodes.

Bagging reduces variance in LID estimation by preserving local distribution of NN distances.

problem High estimation variance from limited data in small neighborhoods.
method Subbagging to preserve local distribution of NN distances, combined with ensemble size.
result Bagging significantly reduces variance and MSE in LID estimation.

We propose a dynamic neighborhood aggregation (DNA) procedure guided by (multi-head) attention for representation learning on graphs. In contrast to current graph neural networks which follow a simple neighborhood aggregation scheme, our DNA procedure allows for a selective and node-adaptive aggregation of neighboring …

2019-04-09abs ↗pdf ↗

We study generalized complex manifolds from the point of view of symplectic and Poisson geometry. We start by showing that every generalized complex manifold admits a canonical Poisson structure. We use this fact, together with Weinstein's classical result on the local normal form of Poisson manifolds, to prove a local…

2004-12-04abs ↗pdf ↗

New algorithm learns Markov network structures efficiently.

problem Learning Markov network structures without chordality assumptions.
method Local penalized likelihood ratio tests and two-stage hill-climbing algorithm.
result PLRHC-BIC0.5_{0.5} algorithm compares favorably against state-of-the-art methods.

The study proves local rigidity of minimal 2-spheres in electrovacuum spacetimes.

problem Proving local rigidity of minimal 2-spheres in electrovacuum spacetimes under certain conditions.
method Analyzing electrovacuum spacetimes and using constraints on charged Hawking mass and area minimization.
result Local rigidity of minimal 2-spheres in electrovacuum spacetimes, with isometric neighborhoods to specific spacetimes.

A new classifier encodes local neighborhoods for each class using Fly Bloom Filters.

problem Efficiently classify data with single-pass learning.
method Proposes a new classifier that encodes local neighborhoods for each class with per-class Fly Bloom Filters.
result The proposed classifier's performance is competitive with nearest-neighbor classifiers and other single-pass classifiers.

TNC learns time series representations by leveraging temporal neighborhoods.

problem Complex, unlabeled time series data.
method Temporal Neighborhood Coding (TNC) with a debiased contrastive objective.
result TNC outperforms other unsupervised methods in time series clustering and classification.

This paper sets a lower limit for the size of Weinstein's Lagrangian tubular neighborhoods.

problem Finding the minimum size of Weinstein's Lagrangian tubular neighborhoods.
method Using the curvature tensor and second fundamental form of the submanifold.
result Explicit lower bounds for the radii of tubular neighborhoods are derived.

We establish that over a C^{2,1} manifold the exponential map of any Lipschitz connection or spray determines a local Lipeomophism and that, furthermore, reversible convex normal neighborhoods do exist. To that end we use the method of Picard-Lindelof approximation to prove the strong differentiability of the exponenti…

2013-08-30abs ↗pdf ↗

We propose a non-parametric link prediction algorithm for a sequence of graph snapshots over time. The model predicts links based on the features of its endpoints, as well as those of the local neighborhood around the endpoints. This allows for different types of neighborhoods in a graph, each with its own dynamics (e.…

2012-06-27abs ↗pdf ↗

We extend results of Pachner and Casali to give finite sets of moves relating triangulations of PL manifolds respecting filtrations by locally flat manifolds and stratifications in which a finite family of simple local models exists for neighborhoods of strata.

2014-04-11abs ↗pdf ↗

Study shows TAP free energy minimization provides better posterior inference in high-dimensional linear models.

problem Deviation from true posterior mean and underestimation of posterior uncertainty in variational inference.
method Minimization of TAP free energy in a high-dimensional asymptotic framework, showing geometric and statistical properties.
result Local minimizer of TAP free energy provides consistent estimate of posterior marginals and correctly calibrated posterior inference.

A method to visualize multidimensional local subspaces using implicit differentiation.

problem Understanding the effect of multidimensional projection on local subspaces.
method Implicit function differentiation to analyze local subspaces shaped by multidimensional ellipses.
result Visualization of local subspaces provides insights into the global structure of data.

The aim of the paper is to understand the local forms of conformal vector fields in the neighborhood of a singularity. We begin a general study in this direction, for any pseudo-Riemannian type, and give a complete answer in the Riemannian case. This is done using geometric methods, and studying local dynamics of seque…

2009-09-01abs ↗pdf ↗

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 ↗

As an efficient and scalable graph neural network, GraphSAGE has enabled an inductive capability for inferring unseen nodes or graphs by aggregating subsampled local neighborhoods and by learning in a mini-batch gradient descent fashion. The neighborhood sampling used in GraphSAGE is effective in order to improve compu…

2019-04-29abs ↗pdf ↗

Proposes a new regularization method for deep learning models.

problem Lack of leverage from neighboring sample relationships in existing regularization techniques.
method Patch-level Neighborhood Interpolation (Pani) that constructs patch-level graphs and linearly interpolates neighborhood patch features.
result Demonstrates effectiveness of Pani in both supervised and semi-supervised settings.

The paper proposes a method to determine the geometric priors of relational data.

problem Identifying geometric structure in heterogeneous, high-dimensional data.
method Combinatorial approach analyzing nearest-neighbor structures and local neighborhood growth rates.
result The method can identify the geometric priors of suitable embedding spaces for relational data.