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

89179268357 · Jun 202019922001200920172026
48 results for spectral points

Study on spectral points of Inoue surfaces with Tricerri metric.

problem Identifying spectral points on Inoue surfaces.
method Analyzing chiral Dirac operators twisted by flat C\mathbb C^*-connections.
result No spectral points inside the annulus α1/4<z<α1/4α^{-1/4} < |z| < α^{1/4}, with spectral points on boundary.

This paper establishes the consistency of spectral approaches to data clustering. We consider clustering of point clouds obtained as samples of a ground-truth measure. A graph representing the point cloud is obtained by assigning weights to edges based on the distance between the points they connect. We investigate the…

2015-08-08abs ↗pdf ↗

This paper explains spectral clustering and its equivalence to PCA, breaking it into fully connected and multi-connected cases.

problem Understanding the mathematics behind spectral clustering and its equivalence to PCA.
method Dividing spectral clustering into two categories based on graph connectivity and proving the equivalence to PCA.
result Spectral clustering and PCA are equivalent, with specific proofs for fully connected and multi-connected graphs.

Study spectral gaps in hyperbolic rational homology spheres.

problem Finding spectral gaps in hyperbolic rational homology spheres.
method Construction of families of hyperbolic rational homology spheres with coexact 1-form spectral gaps.
result Provided intervals containing limit points of spectral gaps, with the rightmost interval being [0.8196, 0.8277].

Detects graph topology changes from noisy signals using prior spectral information.

problem Detecting changes in graph topology from graph signals.
method Leverages graph filtering and subspace detection to distill problem into a CUSUM-based algorithm.
result Demonstrates the effectiveness of incorporating prior spectral signatures for change-point detection.

This paper improves spectral clustering for large datasets using the Nystrom method.

problem Spectral clustering's scalability issues with large datasets.
method A principled spectral clustering algorithm exploiting Nystrom approximation's spectral properties.
result Improved spectral clustering efficiency and accuracy compared to existing methods.

We study topological recursion on the irregular spectral curve xy2xy+1=0xy^2-xy+1=0, which produces a weighted count of dessins d'enfant. This analysis is then applied to topological recursion on the spectral curve xy2=1xy^2=1, which takes the place of the Airy curve x=y2x=y^2 to describe asymptotic behaviour of enumerative proble…

2014-12-29abs ↗pdf ↗

Spectral Clustering is a popular technique to split data points into groups, especially for complex datasets. The algorithms in the Spectral Clustering family typically consist of multiple separate stages (such as similarity matrix construction, low-dimensional embedding, and K-Means clustering as post processing), whi…

2019-11-01abs ↗pdf ↗

Spectral Clustering(SC) is a prominent data clustering technique of recent times which has attracted much attention from researchers. It is a highly data-driven method and makes no strict assumptions on the structure of the data to be clustered. One of the central pieces of spectral clustering is the construction of an…

2019-09-17abs ↗pdf ↗

In this paper, we introduce an algorithm for performing spectral clustering efficiently. Spectral clustering is a powerful clustering algorithm that suffers from high computational complexity, due to eigen decomposition. In this work, we first build the adjacency matrix of the corresponding graph of the dataset. To bui…

2017-04-07abs ↗pdf ↗

We introduce two invariants called sl(3) Khovanov module and pointed sl(3) Khovanov homology for spatial webs (bipartite trivalent graphs). Those invariants are related to Kronheimer-Mrowka's instanton invariants JJ^\sharp and II^\sharp for spatial webs by two spectral sequences. As an application of the spectral seq…

2018-09-13abs ↗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 ↗

In this paper we study the spectral asymmetry of (possibly nonselfadjoint) elliptic PsiDO's in terms of the difference of zeta functions coming from different cuttings. Refining previous formulas of Wodzicki in the case of odd class elliptic PsiDO's, our main results have several consequence concerning the local indepe…

2003-10-08abs ↗pdf ↗

Improves learning of spectral mixture kernels with approximate Bayesian inference.

problem Difficult optimization of large number of SM kernel parameters.
method Approximate Bayesian inference using variational distribution of spectral points and random Fourier features.
result Accelerates convergence and leads to better optimal parameters.

We construct a map from the suspension GG-spectrum ΣGMΣ_G^\infty M of a smooth compact GG-manifold to the equivariant AA-theory spectrum AG(M)A_G(M), and we show that its fiber is, on fixed points, a wedge of stable hh-cobordism spectra. This map is constructed as a map of spectral Mackey functors, which is compatible …

2020-01-15abs ↗pdf ↗

Authors prove an asymptotic expansion for spectral zeta functions on discrete tori.

problem Proving an asymptotic expansion for spectral zeta functions on discrete tori.
method Inspired by Friedli and Karlsson's work, the authors derive an asymptotic expansion for the spectral zeta function on discrete tori.
result Similar asymptotic expansions hold for m=2 and higher dimensions, equivalent to the Epstein-Riemann conjecture.

Spectral regularization improves learning over combinatorial spaces with limited data.

problem Learning pseudo-Boolean functions with scarce labeled data.
method Regularizing the spectral representation of learned functions using the L_1 norm.
result Regularization allows for data-frugal learning and achieves statistically optimal generalization performance.

We first show that a Laplace isospectral family of Riemannian orbifolds, satisfying a lower Ricci curvature bound, contains orbifolds with points of only finitely many isotropy types. If we restrict our attention to orbifolds with only isolated singularities, and assume a lower sectional curvature bound, then the numbe…

2003-01-30abs ↗pdf ↗

The paper analyzes neural networks for solving high-dimensional Schrödinger eigenvalue problems.

problem Analyzing generalization error of neural networks for high-dimensional Schrödinger eigenvalue problems.
method Proves convergence rate of generalization error independent of dimension dd under spectral Barron space assumption. Verifies assumption by proving regularity estimate.
result Generalization error rate is independent of dimension dd under spectral Barron space assumption.

SpecNet2 improves spectral embedding without orthogonalization, achieving better performance and efficiency.

problem Improving spectral embedding methods for better performance and efficiency.
method Optimizes an equivalent objective of the eigen-problem without orthogonalization, allowing separate row and column sampling.
result Local and global convergence of the new objective using batch-based gradient descent is proven, and improved performance and efficiency are demonstrated on simulated and image datasets.

In this paper we study equivariant constrained Willmore tori in the 3-sphere. These tori admit a 1-parameter group of Möbius symmetries and are critical points of the Willmore energy under conformal variations. We show that the associated spectral curve of an equivariant torus is given by a double covering of $\mathbb …

2012-11-17abs ↗pdf ↗

Unified framework for clustering with sparse convex combinations.

problem Challenges in subspace clustering with limited labelled data.
method Spectral-based sparse subspace representation with extensions to constrained and active learning.
result Effective and competitive clustering results on simulated and real data.

We study the connections between spectral clustering and the problems of maximum margin clustering, and estimation of the components of level sets of a density function. Specifically, we obtain bounds on the eigenvectors of graph Laplacian matrices in terms of the between cluster separation, and within cluster connecti…

2018-12-16abs ↗pdf ↗

We provide sufficient conditions to factorise an equivariant spectral triple as a Kasparov product of unbounded classes constructed from the group action on the algebra and from the fixed point spectral triple. Our results are for the action of compact abelian Lie groups, and we demonstrate them with examples from mani…

2015-05-12abs ↗pdf ↗

This article determines the spectral data, in the integrable systems sense, for all weakly conformally immersed Hamiltonian stationary Lagrangian in R4\R^4. This enables us to describe their moduli space and the locus of branch points of such an immersion. This is also an informative example in integrable systems geome…

2007-07-12abs ↗pdf ↗

In the context of clustering, we assume a generative model where each cluster is the result of sampling points in the neighborhood of an embedded smooth surface; the sample may be contaminated with outliers, which are modeled as points sampled in space away from the clusters. We consider a prototype for a higher-order …

2010-01-08abs ↗pdf ↗

We prove a rank inequality on the instanton knot homology and the Khovanov homology of a link in S3S^3. The key step of the proof is to construct a spectral sequence relating Baldwin-Levine-Sarkar's pointed Khovanov homology to a singular instanton invariant for pointed links.

2018-09-24abs ↗pdf ↗