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

114228341455 · May 202619922001200920172026
48 results for spectral bounds

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.

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.

This paper proves a generalization bound for complex-valued neural networks scaling with spectral complexity.

problem Ensuring the performance of complex-valued neural networks on unseen data.
method Theoretical derivation using Maurey Sparsification Lemma and Dudley Entropy Integral, empirical validation on various datasets.
result The spectral complexity of weight matrices is a significant factor in the generalization ability of complex-valued neural networks.

Estimates spectral projections restricted to uniformly embedded submanifolds.

problem Estimating spectral projections on submanifolds of manifolds with nonpositive curvature.
method Estimates the L2(M)oLq(Σ)L^2(M) o L^q(Σ) norm of spectral projection operators.
result Sharp spectral projection estimates for small spectral windows.

Method constrains spectral gaps of hyperbolic spin surfaces using identities and semidefinite programming.

problem Bounding Laplacian and Dirac spectra of hyperbolic spin manifolds and orbifolds.
method Infinite family of spectral identities, semidefinite programming, and Selberg trace formula.
result Upper bounds on spectral gaps nearly saturated by specific orbifolds.

A coupling method and an analytic one allow us to prove new lower bounds for the spectral gap of reversible diffusions on compact manifolds. Those bounds are based on the a notion of curvature of the diffusion, like the coarse Ricci curvature or the Bakry--Emery curvature-dimension inequalities. We show that when this …

2011-05-30abs ↗pdf ↗

Bounds on spectral gaps of hyperbolic 3-manifolds and orbifolds.

problem Constraining the spectra of Laplace operators on hyperbolic manifolds and orbifolds.
method Linear programming and spectral identities derived from the conformal bootstrap and Selberg trace formula.
result Upper bounds on the first and second Laplacian eigenvalues, and spectral gaps of hyperbolic 3-manifolds and orbifolds.

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.

The paper derives upper bounds on eigenvalues of Laplace-Beltrami operator on hyperbolic surfaces.

problem Finding upper bounds on eigenvalues of Laplace-Beltrami operator on hyperbolic surfaces.
method Using spectral decompositions and consistency conditions derived from quadruple overlap integrals in terms of triple overlap integrals.
result Derives upper bounds on eigenvalues, nearly saturated by the Bolza surface.

Study surfaces with nonnegative curvature in spectral sense, proving inequalities and bounds.

problem Closed orientable surfaces with nonnegative curvature in spectral sense.
method Spectral condition and associated conformal metrics to prove inequalities and bounds.
result Isoperimetric inequalities, area growth theorems, and diameter bounds for surfaces.

Equivalence of norms on manifolds with curvature bounds established.

problem Establishing equivalence of norms on manifolds with bounded sectional curvature.
method Using spectral projector and thickness condition for subsets.
result Constant in equivalence depends only on manifold dimension, curvature bounds, and frequency threshold.

Study extends bounds on sample covariance matrices with general dependence.

problem Quantitative bounds on sample covariance matrices with i.i.d. columns.
method Extends previous work on deterministic equivalent to rectangular random matrices with general dependence structure.
result Proves quantitative bounds involving dimensions and spectral parameter, including closer proximity to real positive semi-line.

This paper presents a margin-based multiclass generalization bound for neural networks that scales with their margin-normalized "spectral complexity": their Lipschitz constant, meaning the product of the spectral norms of the weight matrices, times a certain correction factor. This bound is empirically investigated for…

2017-06-26abs ↗pdf ↗

Simple proof that stable minimal hypersurfaces in R^4 are hyperplanes.

problem Proving stable minimal hypersurfaces in R^4 are hyperplanes.
method Using spectral Ricci curvature bounds and Green kernel estimates.
result Complete, two-sided stable minimal hypersurfaces in R^4 are hyperplanes.

In this paper we propose a family of tractable kernels that is dense in the family of bounded positive semi-definite functions (i.e. can approximate any bounded kernel with arbitrary precision). We start by discussing the case of stationary kernels, and propose a family of spectral kernels that extends existing approac…

2015-06-07abs ↗pdf ↗

New theorem improves spectral gap for sampling from mixture distributions.

problem Sampling from multimodal distributions with simulated tempering.
method Introduced a decomposition theorem for the restricted spectral gap of simulated tempering.
result Lower bound on the restricted spectral gap for mixture distributions.

The paper analyzes graph Laplacians on manifolds with curvature bounds and applies to non-collapsed spaces.

problem Analyzing spectral properties of graph Laplacians on manifolds with curvature constraints.
method Quantitative bounds on eigenvalues and eigenfunctions of graph Laplacians constructed from random variables on manifolds with uniform lower Ricci curvature bounds.
result Spectral convergence of graph Laplacians on manifolds with curvature bounds and in non-collapsed spaces.

Extends spectral torus band inequalities for compact manifolds with scalar curvature bounds.

problem Proving upper bounds for the width of compact manifolds with boundary.
method Utilizes spacetime harmonic functions, μ-bubbles, and spinorial Callias operators.
result Generalizes Schoen-Yau black hole existence theorem to higher dimensions.

Study spectral distribution of twisted Laplacian on high genus hyperbolic surfaces.

problem Estimating spectral distribution of twisted Laplacian on hyperbolic surfaces.
method Estimate spectral distribution by supremum norm of harmonic form; show small supremum norm for high genus surfaces; prove uniform Weyl law.
result Prove uniform Weyl law for real parts of spectrum on high genus hyperbolic surfaces.

The paper defines surface area for graphs and derives spectral estimates.

problem Understanding connectivity measures and spectral properties of graphs.
method Introducing surface area concepts related to inverse degree and deriving spectral bounds.
result An upper bound on the second eigenvalue for planar graphs.

Sharp lower bound for Hodge Laplacian on Kähler hyperbolic manifolds.

problem Finding a sharp lower bound for the spectrum of the Hodge Laplacian.
method Explicitly expressed in terms of the supremum norm of the 1-form.
result Explicit spectral lower bounds for bounded symmetric domains.

Spectral algorithms on manifolds using diffusion kernels improve convergence rates.

problem The limitations of existing spectral algorithms in RKHSs for data on manifolds.
method Integrating manifold structure into spectral algorithms using heat kernel diffusion spaces.
result Spectral algorithms converge to the target function and its derivatives in a strong sense, with rates dependent on manifold intrinsic dimension.

This paper explores saturation effects in spectral algorithms over large dimensions.

problem Saturation effects in spectral algorithms over large dimensions.
method Improved minimax lower bound and gradient flow with early stopping strategy.
result Exact convergence rates of spectral algorithms in large dimensional settings.

Study spectral learning for odeco tensors, addressing initialization bottlenecks.

problem Recovering orthogonally decomposable tensors under noise.
method Investigates perturbation bounds, non-convex optimization, and initialization strategies.
result Initialization is the main bottleneck for efficient algorithms.

Explicitly bounds the spectral gap for Schottky subgroups of SL(2,Z).

problem Finding uniform bounds for spectral gaps of Schottky subgroups.
method Establishes explicit lower bounds for the second eigenvalue of the Laplace-Beltrami operator.
result Uniform and explicit lower bounds for the second eigenvalue of congruence coverings.

We approximate the spectral data (eigenvalues and eigenfunctions) of compact Riemannian manifold by the spectral data of a sequence of (computable) discrete Laplace operators associated to some graphs immersed in the manifold. We give an upper bound on the error that depends on upper bounds on the diameter and the sect…

2013-01-16abs ↗pdf ↗

Study shows infinite Hofer diameter for Lagrangian orbits in cotangent bundles.

problem Determining boundedness of spectral metric on Lagrangian orbit spaces.
method Utilized wrapped Floer cohomology to define spectral invariant and pseudo-metric.
result Proved infinite Hofer diameter for Lagrangian orbits in cotangent bundles.

The paper proves criticality criteria and spectral splitting theorems for manifolds with Ricci bounds.

problem Understanding criticality and splitting theorems for manifolds with spectral Ricci bounds.
method Proving criticality criteria and spectral splitting theorems for manifolds with more than one end and spectral Ricci bounds.
result New insights into Li-Wang's theory and applications to stable and δ-stable minimal hypersurfaces.

We derive a lower bound to the spectral threshold of the Dirichlet Laplacian in tubular neighbourhoods of constant radius about complete surfaces. This lower bound is given by the lowest eigenvalue of a one-dimensional operator depending on the radius and principal curvatures of the reference surface. Moreover, we show…

2016-02-16abs ↗pdf ↗

Study confirms learning rates for vector-valued spectral algorithms, proving consistency.

problem Theoretical confirmation of learning rates for vector-valued spectral algorithms.
method Rigorous analysis of learning rates for various vector-valued spectral algorithms, including kernel ridge regression and gradient descent.
result Upper and lower bounds on learning rates for vector-valued spectral algorithms, proving minimax optimality in various scenarios.

Study rigidity of spectral gap on Finsler manifolds with specific curvature bounds.

problem Rigidity of spectral gap on Finsler manifolds with Ricci curvature bound.
method Analysis of spectral gap, splitting phenomena, and needle decomposition.
result Rigidity results for spectral gap, logarithmic Sobolev, and Bakry-Ledoux inequalities.

Study compares spectral properties of a specific tensor in geometry.

problem Comparing spectral properties of a specific tensor in geometry.
method Diameter and global weighted volume comparison with a positive lower bound on the NN-Bakry-Emery Ricci tensor.
result Established diameter and volume comparisons for tensors with positive lower bounds.

Partial convexification improves tractability of low-rank spectral optimization problems.

problem Minimizing linear objectives subject to matrix inequalities and low-rank constraints.
method Partial convexification of the domain set, deriving rank bounds, and developing a column generation algorithm.
result The partial convexification LSOP-R is equivalent to the original LSOP under certain conditions and yields high-quality solutions.