Unified treatment of eigenvalue processes using Riemannian geometry.
problem Eigenvalue processes in various settings.
method Riemannian submersion and gradient flow of isospectral orbits.
result Eigenvalue processes are projections of Brownian motion through Riemannian submersions.
Physics-informed GP regression solves eigenvalue problems by identifying non-trivial eigenspaces.
problem Solving eigenvalue problems of linear operators with trivial solutions.
method Constructing a transfer function-type indicator using physics-informed Gaussian Process posterior.
result The posterior covariance is non-trivial only for eigenvalues of the operator, indicating non-trivial eigenspaces.
Extended bounds on small eigenvalues for pseudo-Laplacians on hyperbolic surfaces.
problem Bounding small eigenvalues of pseudo-Laplacians on hyperbolic surfaces.
method Extended Otal-Rosas bound and Colin de Verdière's spectral theory to hyperbolic surfaces with multiple cusps.
result Extended bounds on small eigenvalues for pseudo-Laplacians.
Study on geodesics and eigenvalues on random hyperbolic surfaces with cusps.
problem Counting short geodesics and small eigenvalues on random hyperbolic surfaces.
method Rescaling and convergence to a Poisson point process.
result The probability of having at least k=o(n) arbitrarily small eigenvalues tends to 1 as no∞. Paper finds principal eigenvalue for infinity Laplacian in metric spaces.
problem Finding the principal eigenvalue of the infinity Laplacian in metric spaces.
method Direct PDE approach and Perron's method to establish existence of solutions.
result Existence of solutions to the infinity eigenvalue problem in metric spaces.
By introducing a weight function to the Laplace operator, Bakry and Émery defined the "drift Laplacian" to study diffusion processes. Our first main result is that, given a Bakry-Émery manifold, there is a naturally associated family of graphs whose eigenvalues converge to the eigenvalues of the drift Laplacian as the …
Unified approach to Laplace and Steklov eigenvalues via n-harmonic maps.
problem Eigenvalue problems on manifolds of arbitrary dimension.
method Unified description using n-harmonic maps. result Uncovering two new features of Steklov eigenvalues.
We study the (massless) Dirac operator on a 3-sphere equipped with Riemannian metric. For the standard metric the spectrum is known. In particular, the eigenvalues closest to zero are the two double eigenvalues +3/2 and -3/2. Our aim is to analyse the behaviour of eigenvalues when the metric is perturbed in an arbitrar…
Study Steklov eigenvalues on hyperbolic triangle-tiling graphs.
problem Analyzing Steklov eigenvalues on specific hyperbolic graph structures.
method Introduced a graph roughly isometric to hyperbolic plane, used discretization to transfer bounds.
result Steklov eigenvalues tend to zero proportionally to the inverse of the domain size.
Proposes a Gaussian process for Koopman mode decomposition.
problem Estimating Koopman mode decomposition quantities and latent variables.
method Unsupervised Gaussian process for simultaneous estimation.
result Efficient parameter estimation through low-rank approximations.
Study reveals how spectral bias affects learnability on real-world data.
problem Understanding how well complex datasets can be learned using kernel methods.
method Use eigenvalues and eigenfunctions from idealized data to reveal spectral bias on real-world data.
result Bound learnability on real-world data using symmetries of realistic kernels.
Paper separates financial time series into fast and slow components.
problem Multiscale behavior in financial time series data.
method Uses variance and tail stationarity criteria as generalized eigenvalue problems.
result Identifies slow and fast components in asset returns and prices.
Study on eigenvalue distribution of correlated time series, showing deformation of Marchenko-Pastur distribution.
problem Eigenvalue distribution of Wishart matrix with temporal correlation.
method Analysis of moments and convergence to deformed Marchenko-Pastur distribution for Gaussian process with temporal correlation.
result Eigenvalue distribution converges to deformed Marchenko-Pastur distribution with longer tail and higher peak.
In this paper, we would like to give an answer to \textbf{Problem 1} below issued firstly in [J. Mao, Eigenvalue estimation and some results on finite topological type, Ph.D. thesis, IST-UTL, 2013]. In fact, by imposing some conditions on the mean curvature of the initial hypersurface and the coefficient function of th…
New method trains neural networks in spectral domain for improved performance.
problem Training deep neural networks in the space of nodes.
method Trains neural networks in the spectral domain, modifying eigenvalues and eigenvectors of transfer operators.
result Superior performance compared to standard methods, especially when adjusting eigenvalues.
Proposes a faster Isomap algorithm by reducing eigenvalue decomposition complexity.
problem High computational complexity of Isomap, especially in eigenvalue decomposition stage.
method Introduces a projection operator to reduce the complexity of the eigenvalue decomposition stage to linear order.
result Reduces Isomap's computational complexity to linear order while preserving structural information.
Sharp eigenvalue estimates for submanifolds of asymptotically hyperbolic spaces.
problem Estimating eigenvalues of the p-Laplacian on submanifolds of asymptotically hyperbolic manifolds.
method Sharp upper and lower bounds derived using conformal techniques and properties of submanifolds.
result Lower bounds on the first eigenvalue for minimal and bounded mean curvature submanifolds.
Stable algebraic filters improve neural network performance.
problem Improving neural network stability to deformations.
method Analyzed stability of algebraic filters and neural networks under deformations of the homomorphism.
result Stable algebraic filters have frequency responses whose derivative is inversely proportional to frequency.
New scalable geometric framework for SPD matrices.
problem Costly spectral computations in SPD matrix analysis.
method Efficient computation of extreme generalized eigenvalues through Hilbert and Thompson geometries of the semidefinite cone.
result Existence and uniqueness of a novel iterative mean of SPD matrices.
Study shows fundamental gap of horoconvex domains in hyperbolic space has no positive lower bound.
problem Understanding the fundamental gap of horoconvex domains in hyperbolic space.
method Analysis of fundamental gap of geodesic balls as radius goes to infinity.
result Product of fundamental gap and square of diameter has no positive lower bound for horoconvex domains.
Geometric framework for SPD matrices preserving subspace structures.
problem Processing SPD-valued data with preserved subspace structures.
method Thompson geometry of the semidefinite cone, extreme generalized eigenvalues, geodesic space structure.
result Novel inductive mean of SPD matrices based on Thompson geometry.
Random feature model shows slow self-correction of generalization gap.
problem Slow deterioration of generalization error in random feature model.
method Examined the dynamic behavior of gradient descent in the model's resonance regime.
result Gradient descent exhibits a self-correction mechanism, reducing generalization gap over time.
New framework estimates eigenvalues of kernel matrices without full matrix construction.
problem Estimating eigenvalues of large kernel matrices efficiently.
method Eigenvalue quantile estimation framework for kernel matrices with quick decay.
result Validates framework with empirical evidence and proves interlacing theorem.
Studying SGD on deep neural networks using diffusion maps.
problem Understanding why SGD performs well in deep learning.
method Data-driven approach using diffusion maps to analyze SGD dynamics.
result SGD dynamics may mainly live on a low-dimensional manifold in high-dimensional parameter space.
This paper is a tutorial for eigenvalue and generalized eigenvalue problems. We first introduce eigenvalue problem, eigen-decomposition (spectral decomposition), and generalized eigenvalue problem. Then, we mention the optimization problems which yield to the eigenvalue and generalized eigenvalue problems. We also prov…
The paper compares Steklov and Laplacian eigenvalues on graphs.
problem Understanding the relationship between Steklov and Laplacian eigenvalues on graphs.
method Analyzing eigenvalues and discussing rigidity.
result Obtained Lichnerowicz-type estimates and combinatorial estimates for Steklov eigenvalues.
Numerous methods for computing conformal mesh paramterizations has been developed due to the vast applications in the field of geometry processing. Spectral conformal parameterization (SCP) is one of these methods to computing a quality conformal parameterization based on the spectral technique. SCP focus on a generali…
We consider isotropic Lévy processes on a compact Riemannian manifold, obtained from an Rd-valued Lévy process through rolling without slipping. We prove that the Feller semigroups associated with these processes extend to strongly continuous contraction semigroups on Lp, for 1≤p<∞, and that t…
The paper improves bounds on regret in Gaussian process bandits.
problem Sequential optimization of expensive, possibly non-convex functions with noisy feedback.
method Analyzes maximal information gain and decay rates of GP kernel eigenvalues to improve regret bounds.
result General bounds on maximal information gain and improved regret bounds for various settings, including Matérn kernels.
In this paper, two interesting eigenvalue comparison theorems for the first non-zero Steklov eigenvalue of the Laplacian have been established for manifolds with radial sectional curvature bounded from above. Besides, sharper bounds for the first non-zero eigenvalue of the Wentzell eigenvalue problem of the weighted La…
This work simplifies Gaussian process regression for multiple outputs.
problem Exponential computational complexity in Gaussian process regression.
method Approximating the covariance kernel using eigenvalues and functions.
result Significant reduction in training and regression complexity.
This paper provides an algorithm for simulating improper (or noncircular) complex-valued stationary Gaussian processes. The technique utilizes recently developed methods for multivariate Gaussian processes from the circulant embedding literature. The method can be performed in O(nlog2n) operations, where…
Study on GEPs with generative priors, showing optimal statistical rates and proposing an iterative algorithm.
problem Generalized eigenvalue problems with generative priors.
method Assumption of Lipschitz continuous generative model, Projected Rayleigh Flow Method (PRFM).
result PRFM converges linearly to an estimated vector achieving the optimal statistical rate.
The paper explores inequalities between eigenvalues on Riemannian manifolds.
problem Investigating relationships between eigenvalues on Riemannian manifolds.
method Constructing gradient estimates for a first eigenfunction to derive inequalities.
result Obtained some relationships between weighted p-Laplacian first eigenvalues. Active data collection improves convergence rates in operator learning.
problem Improving convergence rates in operator learning with linear target and stochastic input.
method Active data collection strategies with mean-zero stochastic process and continuous covariance kernels.
result Achieves arbitrarily fast error convergence rates with eigenvalue decay of covariance kernels.
Eigenvalues of Steklov eigenproblems change predictably with boundary tweaks.
problem Understanding how Steklov eigenvalues respond to boundary changes.
method Analyzing smooth boundary perturbations of Steklov eigenvalues.
result Steklov eigenvalues are generically simple under such perturbations.
Study compares eigenvalues on spherically symmetric manifolds to Euclidean balls.
problem Comparing eigenvalues on spherically symmetric manifolds to Euclidean balls.
method Examines Dirichlet Laplace eigenvalues on balls of spherically symmetric manifolds and Euclidean space.
result Eigenvalues on spherically symmetric manifolds are smaller for small radii, but larger for hyperbolic spaces.
The paper sets lower bounds for Laplacian eigenvalues and clamped plate problem eigenvalues.
problem Eigenvalues of the Laplace operator and clamped plate problem.
method Sharp lower bounds for Laplacian eigenvalues and clamped plate problem eigenvalues.
result Sharp lower bounds for Laplacian eigenvalues and clamped plate problem eigenvalues.
Paper finds how Steklov eigenvalues change on graphs and trees.
problem Understanding how Steklov eigenvalues vary on graphs and trees.
method Analyzes monotonicity of Steklov eigenvalues on graphs and trees.
result Extends Steklov eigenvalue results to higher eigenvalues and trees.
Eigenvalue estimate for shrinkers in mean curvature flow.
problem Eigenvalue estimates on shrinkers for mean curvature flow.
method Generalized earlier work of Ding and Xin to noncompact cases.
result Eigenvalue estimate holds on every properly embedded shrinker.
In this paper we study eigenvalues of the closed eigenvalue problem of the Witten-Laplacian on an n-dimensional compact Riemannian manifold. Estimates for eigenvalues are given. As applications, we give a sharp upper bound for the kth eigenvalue and for isoparametric minimal hypersurfaces in the unit sphe…
For a bounded domain Ω with a piecewise smooth boundary in an n-dimensional Euclidean space Rn, we study eigenvalues of the Dirichlet eigenvalue problem of the Laplacian. First we give a general inequality for eigenvalues of the Laplacian. As an application, we study lower order eigenvalues of the Lap…
A new type of quadrature is developed. The Gaussian quadrature, for a given measure, finds optimal values of a function's argument (nodes) and the corresponding weights. In contrast, the Lebesgue quadrature developed in this paper, finds optimal values of function (value-nodes) and the corresponding weights. The Gaussi…
The paper provides estimates for eigenvalues of elliptic differential problems.
problem Computing eigenvalue estimates for elliptic differential problems.
method Analytical computation of eigenvalues for specific types of elliptic differential equations.
result Universal estimates of eigenvalues and gaps between consecutive eigenvalues are derived.
The paper compares eigenvalues of Dirichlet, Neumann, and Laplacian on graphs.
problem Eigenvalue comparisons on graphs.
method Analytical comparisons and discussions of eigenvalues and their applications.
result Extensions of eigenvalue estimates for Dirichlet and Neumann eigenvalues.
Sharp bounds derived for the first two Steklov eigenvalues of exterior domains.
problem Finding bounds for the first two eigenvalues of Steklov eigenvalue problems on exterior domains.
method Sharp lower and upper bounds derived using the support function and distance function to the origin of the boundary.
result Sharp bounds for the first two eigenvalues of Steklov eigenvalue problems on exterior domains.
Let $\om $ be a bounded domain in an n-dimensional Euclidean space Rn. We study eigenvalues of an eigenvalue problem of a system of elliptic equations: $$ \{\aligned &Δ{\mathbf u}+ α{\rm grad}(\text{div}{\mathbf u})=-σ{\mathbf u}, \ \text{in $Ω$}, &{\mathbf u}|_{\partial Ω}={\mathbf 0}. \aligned . $$ Estimate…
We consider a stochastic volatility asset price model in which the volatility is the absolute value of a continuous Gaussian process with arbitrary prescribed mean and covariance. By exhibiting a Karhunen-Loève expansion for the integrated variance, and using sharp estimates of the density of a general second-chaos var…