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

Trend · papers per month

265177102 · May 202619922001200920172026
48 results for spectral

Paper defines spectral triple and computes functional for nonminimal de Rham-Hodge operator.

problem Computing spectral functions for nonminimal de Rham-Hodge operators.
method Definitions and computations of spectral triple and functional.
result Computed spectral Einstein functional for even-dimensional compact manifolds.

The paper explores rigidity theorems for spectral curvature bounds in 3-manifolds.

problem Classical rigidity results in scalar curvature geometry are extended to the spectral setting.
method Warped μμ-bubble method is systematically employed to classify stable weighted minimal hypersurfaces and establish band width estimates.
result Classification theorems and band width estimates for spectral Ricci and scalar curvatures are proven.

The abstract discusses a spectral sequence for Lie algebroids.

problem The abstract tackles the spectral sequence of Lie algebroids.
method The abstract presents a spectral sequence for Lie algebroids, generalizing classical constructions.
result The spectral sequence converges to Lie algebroid cohomology for wide Lie subalgebroids and to formal Lie algebroid cohomology for Lie subalgebroids over proper submanifolds.

New spectral functionals for Dirac operators with inner fluctuations computed.

problem Spectral functionals and Dirac operators with inner fluctuations.
method Extension of spectral functionals for Dirac operators with inner fluctuations.
result Computed spectral Einstein functional for Dirac operator with inner fluctuations on even-dimensional spin manifolds.

Spectral algorithms are graph partitioning algorithms that partition a node set of a graph into groups by using a spectral embedding map. Clustering techniques based on the algorithms are referred to as spectral clustering and are widely used in data analysis. To gain a better understanding of why spectral clustering i…

2019-12-06abs ↗pdf ↗

The paper derives spectral (0,4)-tensor functionals using the noncommutative residue.

problem Deriving spectral (0,4)-tensor functionals on compact spin manifolds.
method Using four one-forms and the Dirac operator, the noncommutative residue is applied to even-dimensional compact spin manifolds.
result Spectral (0,4)-tensor functionals are extended to a general spectral triple.

Introduces spectral-domain Wasserstein distance and Gelbrich bound for elliptical processes.

problem Estimating distances and bounds for elliptical stochastic processes.
method Defines spectral-domain W2\mathcal{W}_2 Wasserstein distance and Gelbrich bound.
result Develops new spectral-domain bounds for non-elliptical processes.

Paper introduces a new multilinear functional for spectral triples and computes its properties.

problem Computing properties of spectral triples and their associated Hodge operators.
method Introduces a new multilinear functional for spectral triples and computes its properties using noncommutative residue and perturbed de-Rham Hodge operators.
result Recover two forms, torsion of the linear connection, and four forms by the noncommutative residue and perturbed de-Rham Hodge Dirac triple.

Defines and computes a generalized spectral action for Lorentz warped products.

problem Computing spectral actions for Lorentz warped products.
method Defines and computes the bimetric spectral Einstein-Hilbert action for Lorentz warped products.
result Derives a Kastler-Kalau-Walze type theorem for Lorentz warped products.

Proves new inequality linking spectral numbers of Lagrangians and their reductions.

problem Understanding spectral properties of Lagrangian submanifolds.
method Develops inverse reduction inequalities for spectral numbers.
result Proof of inequality between spectral numbers of Lagrangian and its reductions.

Laplacian Eigenvectors of the graph constructed from a data set are used in many spectral manifold learning algorithms such as diffusion maps and spectral clustering. Given a graph constructed from a random sample of a dd-dimensional compact submanifold MM in RD\mathbb{R}^D, we establish the spectral convergence rate…

2015-10-27abs ↗pdf ↗

Study constant mean curvature tori in R^3 using spectral data and Whitham deformations.

problem Parameterize spectral data of constant mean curvature tori in R^3.
method Use Whitham deformations, blowups, and spectral data analysis.
result Prove the Wente family is parameterized by the bisector of the right angle.

Constructs equivariant spectral flow for Dirac-type operators on manifolds.

problem Calculating spectral flow for Dirac-type operators on manifolds with group actions.
method Equivariant spectral flow construction for paths of Dirac-type operators on manifolds.
result Relates delocalised η-invariants and ρ-invariants for different positive scalar curvature metrics.

Bayesian framework integrates spectral deconvolution with expert reasoning for robust peak estimation.

problem Challenges in extracting meaningful peaks from noisy or complex spectra.
method Bayesian spectral deconvolution coupled with a physical-property regression layer.
result Recovery of weak peaks in poly(lactic acid) IR spectra related to degradation rates.

Spectral deconfounding improves machine learning models by reducing hidden confounding effects.

problem Machine learning models can be misled by hidden confounders, leading to unreliable predictions.
method Develops a nonlinear spectral deconfounding framework for gradient boosting that modifies boosting dynamics to slow down in confounding-aligned directions.
result Spectrally deconfounded boosting improves estimation of the target function under hidden confounding and is more scalable.

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.

Dual regularized graph Laplacian improves spectral clustering for community detection.

problem Detecting clusters in networks with improved spectral clustering methods.
method Proposes dual regularized graph Laplacian for three spectral clustering approaches.
result Theoretical analysis shows DRSC and DRSLIM yield stable consistent community detection.

The paper introduces a trilinear functional to recover torsion in spectral triples.

problem Recovering torsion in noncommutative spectral triples.
method Introduces a trilinear functional for spectral triples and demonstrates its application to recover torsion.
result The trilinear functional recovers the torsion of the linear connection in canonical spectral triples.

Defines spectral Einstein functional for manifolds with boundary.

problem Calculating the spectral Einstein functional for manifolds with boundaries.
method Defined spectral Einstein functional associated with the Dirac operator and proved a theorem for 4D manifolds.
result Proof of Kastler-Kalau-Walze type theorem for spectral Einstein functional.

The paper explores spectral sequences of complex manifolds with special metrics.

problem Understanding spectral sequences of compact complex manifolds with special metrics.
method Investigation of Frölicher spectral sequences and special metrics (balanced, SKT, Gauduchon) on manifolds.
result Found compact manifolds where spectral sequences do not degenerate at the second page, providing counterexamples and new families.

We present Spectral Inference Networks, a framework for learning eigenfunctions of linear operators by stochastic optimization. Spectral Inference Networks generalize Slow Feature Analysis to generic symmetric operators, and are closely related to Variational Monte Carlo methods from computational physics. As such, the…

2018-06-06abs ↗pdf ↗

Proves Kastler-Kalau-Walze theorem for spectral Einstein functional on low-dimensional manifolds.

problem Proving Kastler-Kalau-Walze type theorems for spectral Einstein functional.
method Defining spectral Einstein functional associated with Dirac operator and proving theorem for low-dimensional manifolds.
result Proves Kastler-Kalau-Walze type theorem for spectral Einstein functional on low-dimensional manifolds with boundary.

Bayesian parametric matrix models provide uncertainty quantification for spectral learning.

problem Uncertainty quantification in spectral learning for safety-critical applications.
method Bayesian parametric matrix models (B-PMMs) that extend PMMs to provide uncertainty estimates.
result B-PMMs achieve exceptional uncertainty calibration (ECE < 0.05) while maintaining favorable scaling.

Defines spectral Einstein functionals for sub-Dirac operators on manifolds with boundary.

problem Calculating Einstein-like functionals for sub-Dirac operators.
method Introduced spectral Einstein functional for sub-Dirac operators on manifolds with boundary.
result Proved a theorem for spectral Einstein functions on four-dimensional manifolds.

New spectral clustering method for graphs with uneven node degrees.

problem Challenges in community detection for graphs with heterogeneous degree distributions.
method Spectral clustering on spherical coordinates with degree correction.
result Improved performance in representing computer networks.