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

1345 · Oct 200919922001200920172026
48 results for buckling eigenmaps

Paper finds inequalities for eigenvalues of buckling problems on special metric spaces.

problem Eigenvalue inequalities for buckling problems of drifting Laplacian.
method Investigated on bounded domains in complete smooth metric measure spaces (SMMSs) with special functions.
result General inequalities for eigenvalues derived under curvature constraints.

In this paper, we investigate universal estimates for eigenvalues of a buckling problem. For a bounded domain in a Euclidean space, we give a positive contribution for obtaining a sharp universal inequality for eigenvalues of the buckling problem. For a domain in the unit sphere, we give an important improvement on the…

2009-08-26abs ↗pdf ↗

This paper studies eigenvalues of the buckling problem of arbitrary order on bounded domains in Euclidean spaces and spheres. We prove universal bounds for the k-th eigenvalue in terms of the lower ones independent of the domains. Our results strengthen the recent work in [28] and generalize Cheng-Yang's recent estimat…

2010-10-12abs ↗pdf ↗

We consider the higher order buckling eigenvalues of the following Dirichlet poly-Laplacian in the unit sphere (Δ)pu=Λ(Δ)u(-Δ)^p u=Λ(-Δ) u with order p(2)p(\geq2). We obtain universal bounds on the (k+1)(k+1)th eigenvalue in terms of the first kkth eigenvalues independent of the domains. In particular, for p=2p=2, our result is shar…

2009-08-31abs ↗pdf ↗

Transformers interpreted as probabilistic Laplacian Eigenmaps steps.

problem Improving transformer performance through probabilistic interpretation.
method Probabilistic Laplacian Eigenmaps model derivation and graph diffusion step.
result Subtracting identity from attention matrix improves transformer performance.

Paper analyzes convergence of Laplacian eigenmaps on submanifolds with singularities.

problem Analyzing convergence of Laplacian eigenmaps on submanifolds with singularities.
method Using ε-neighborhood graphs constructed from random points on the submanifold, the paper provides a spectral approximation result for the Laplacian.
result The convergence rate for the eigenvalue of the Laplacian is \( O\left(\left(\log n/n ight)^{1/(m+2)} ight) \), where \( m \) and \( n \) are the dimension of the manifold and the sample size, respectively.

Study shows rates for Laplacian-eigenmap methods in nonparametric regression.

problem Minimizing error in nonparametric regression using Laplacian-eigenmap.
method Adaptive and non-adaptive minimax rates using Sobolev space constraints.
result Extends minimax rates to various weighted Laplacian matrices.

For curves of prescribed length embedded into the unit disc in two dimensions, we obtain scaling results for the minimal elastic energy as the length just exceeds 2π and in the large length limit. In the small excess length case, we prove convergence to a fourth order obstacle type problem with integral constraint on…

2018-12-12abs ↗pdf ↗

Survey of Laplacian-based methods for data dimensionality reduction and embedding.

problem Efficiently reducing high-dimensional data to lower dimensions while preserving important features and structures.
method Laplacian-based methods including spectral clustering, Laplacian eigenmap, locality preserving projection, graph embedding, and diffusion map.
result Comprehensive overview of various optimization variants and applications of Laplacian-based techniques.

Manifold learning and dimensionality reduction techniques are ubiquitous in science and engineering, but can be computationally expensive procedures when applied to large data sets or when similarities are expensive to compute. To date, little work has been done to investigate the tradeoff between computational resourc…

2016-03-12abs ↗pdf ↗

Study improves regularity estimates for harmonic maps into ellipsoids.

problem Independence of regularity estimates on harmonic maps with varying target dimensions.
method Analyzes harmonic maps into ellipsoids, uses Palais-Smale sequences, and critical metrics.
result Enhanced regularity estimates for Laplace harmonic eigenmaps.

We study the conformal plate buckling equation (Laplace--Beltrami)^2 u =1, where the L-B operator is for the metric g = e^{2u}g_0, with g0g_0 the standard Euclidean metric on R^2. This conformal elliptic PDE of fourth order is equivalent to the nonlinear system of elliptic PDEs of second order, Delta u +K_g e^(2u)=0, D…

2001-04-18abs ↗pdf ↗

Proposes EOT eigenmaps for aligning and embedding multiple datasets.

problem Aligning and embedding multiple datasets with shared structures but individual distortions.
method Entropic Optimal Transport (EOT) eigenmaps, leveraging leading singular vectors of EOT plan matrix.
result Proves theoretical guarantees and favorable properties for aligning and embedding datasets.

The study uses unsupervised machine learning to identify top European football teams.

problem Selecting teams for the new European football Super League.
method Used Laplacian eigenmaps clustering on performance data.
result Successfully identified four clusters of teams based on performance metrics.

Neumann eigenmaps improve landmark-based diffusion map embeddings.

problem Landmark-based diffusion map embeddings can be computationally inefficient and unstable.
method NeuMaps use a renormalized Neumann Laplacian for eigendecomposition, incorporating landmarks as a subgraph.
result NeuMaps offer a computationally efficient and stable embedding method.

LDLE embeds manifolds in lower dimensions with low distortion.

problem Embedding manifolds in lower dimensions with low distortion.
method Constructs local views using global eigenvectors of the graph Laplacian, registers them using Procrustes analysis, and tears manifolds apart for intrinsic dimension embedding.
result LDLE preserves distances up to a constant scale with low distortion.

PCR-LE achieves optimal rates for nonparametric regression over Sobolev spaces.

problem Nonparametric regression over Sobolev spaces with random design.
method PCR-LE using Laplacian Eigenmaps on neighborhood graphs.
result PCR-LE achieves minimax rates of convergence for both estimation and goodness-of-fit testing.

We analyze the performance of a class of manifold-learning algorithms that find their output by minimizing a quadratic form under some normalization constraints. This class consists of Locally Linear Embedding (LLE), Laplacian Eigenmap, Local Tangent Space Alignment (LTSA), Hessian Eigenmaps (HLLE), and Diffusion maps.…

2008-06-16abs ↗pdf ↗

Heat kernels map RCD spaces to Riemannian manifolds.

problem Mapping RCD spaces to Riemannian manifolds using heat kernels.
method Using heat kernels to map RCD spaces into L2L^2 space and then normalizing to achieve isometric immersions.
result Compact RCD spaces with isometrically heat kernel immersions are isometric to unweighted smooth Riemannian manifolds.

The paper connects eigenvalue problems for various operators and establishes inequalities and asymptotic formulas for heat traces.

problem Eigenvalue problems and heat trace asymptotics for different operators.
method Establishes connections and inequalities for eigenvalues and heat traces.
result Eigenvalue inequalities and three-term asymptotic formulas for heat traces of various operators.

The paper extends manifold learning to arbitrary norms, improving molecular motion mapping.

problem Improving manifold learning for non-Euclidean norms.
method Determines the limiting differential operator for graph Laplacians using any norm.
result A modified Laplacian eigenmaps algorithm using Earthmover's distance outperforms Euclidean methods in molecular motion mapping.

Study spectral properties of graph Laplacian for manifold data.

problem Understanding spectral properties of graph Laplacian for manifold data.
method Non-asymptotic error bounds on spectral properties of empirical graph Laplacian.
result Eigenvalues and eigenspaces of empirical graph Laplacian are close to Laplace-Beltrami operator of manifold.

A generalization of the Euler-Plateau problem to account for the energy contribution due to twisting of the bounding loop is proposed. Euler-Lagrange equations are derived in a parameterized setting and a bifurcation analysis is performed. A pair of dimensionless parameters govern bifurcations from a flat, circular gro…

2014-05-07abs ↗pdf ↗

Study evaluates graph-based semi-supervised learning under noisy label conditions.

problem Evaluation of semi-supervised learning algorithms under noisy label conditions.
method Compared graph-based semi-supervised algorithms under varying labeled data and label noise conditions.
result Laplacian Eigenmaps performed better than label propagation under noisy conditions.

In this paper, we establish universal inequalities for eigenvalues of the clamped plate problem on compact submanifolds of Euclidean spaces, of spheres and of real, complex and quaternionic projective spaces. We also prove similar results for the biharmonic operator on domains of Riemannian manifolds admitting spherica…

2010-01-27abs ↗pdf ↗

A new spline method for manifold learning using Hessian-based curvature penalties.

problem Learning manifolds with curvature penalties in high dimensions.
method Generalizes thin-plate splines to flat manifolds using Hessian matrices, minimizing square error with curvature constraints.
result Existence and uniqueness of the spline solution, expressed as Green's functions and Hessian approximations.