The smallest eigenvalues and the associated eigenvectors (i.e., eigenpairs) of a graph Laplacian matrix have been widely used in spectral clustering and community detection. However, in real-life applications the number of clusters or communities (say, ) is generally unknown a-priori. Consequently, the majority of t…
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,742 papers · 148 categories
Trend · papers per month
15 results for “Eigenpairs”
The smallest eigenvalues and the associated eigenvectors (i.e., eigenpairs) of a graph Laplacian matrix have been widely used for spectral clustering and community detection. However, in real-life applications the number of clusters or communities (say, ) is generally unknown a-priori. Consequently, the majority of …
In this paper, we determine a representative agent model based on risk-neutral information. The main idea is that the pricing kernel is transition independent, which is supported by the well-known capital asset pricing theory. Determining the representative agent model is closely related to the eigenpair problem of a s…
Minimax Rates for the Estimation of Eigenpairs of Weighted Laplace-Beltrami Operators on Manifoldsstat.ML
The paper analyzes rates of approximation for eigenpairs of Laplace-Beltrami operators on manifolds.
problem Estimating eigenpairs of elliptic differential operators from manifold samples.
method Analyzes minimax rates for eigenvalue and eigenvector estimation using graph Laplacians.
result The minimax rate for -sense approximation is .
We compared the regular Singular Value Decomposition (SVD), truncated SVD, Krylov method and Randomized PCA, in terms of time and space complexity. It is well-known that Krylov method and Randomized PCA only performs well when k << n, i.e. the number of eigenpair needed is far less than that of matrix size. We compared…
This paper discusses the sensitivity of the long-term expected utility of optimal portfolios for an investor with constant relative risk aversion. Under an incomplete market given by a factor model, we consider the utility maximization problem with long-time horizon. The main purpose is to find the long-term sensitivit…
Let be a noncompact, finite area hyperbolic surface of type . Let denote the Laplace operator on . As varies over the {\it moduli space} of finite area hyperbolic surfaces of type , we study, adapting methods of Lizhen Ji \cite{Ji} and Scott Wolpert \cite{Wo}, the…
Latent variable models with hidden binary units appear in various applications. Learning such models, in particular in the presence of noise, is a challenging computational problem. In this paper we propose a novel spectral approach to this problem, based on the eigenvectors of both the second order moment matrix and t…
Long-Term Growth Rate of Expected Utility for Leveraged ETFs: Martingale Extraction Approachq-fin.MF
This paper studies the long-term growth rate of expected utility from holding a leveraged exchanged-traded fund (LETF), which is a constant proportion portfolio of the reference asset. Working with the power utility function, we develop an analytical approach that employs martingale extraction and involves finding the …
Neural networks solve eigen-problems in differential equations.
problem Finding eigenpairs of self-adjoint operators.
method Using neural networks to approximate eigenfunctions and eigenvalues.
result Demonstrates potential of neural networks in solving complex eigen-problems.
Defines tensor eigenvalues and singular values without basis, simplifying analysis.
problem Defines tensor eigenvalues and singular values without basis.
method Intrinsic definition of tensor eigenvalues and singular values using concepts from pure mathematics.
result Shows the relationship between tensor analysis and pure mathematics.
New GL-GP models learn covariance respecting domain geometry.
problem Suboptimal results from nonparametric regression on restricted domains.
method Graph Laplacian based Gaussian Processes (GL-GPs) with Nyström extension.
result Performance gains in various applications.
The Delta method is a classical procedure for quantifying epistemic uncertainty in statistical models, but its direct application to deep neural networks is prevented by the large number of parameters . We propose a low cost variant of the Delta method applicable to -regularized deep neural networks based on th…
Our work connects parameter magnitudes and Hessian eigenspaces in deep neural nets.
problem Understanding the relationship between parameter magnitudes and Hessian curvature in deep learning models.
method Developed a matrix-free algorithm based on sketched SVDs to measure similarity between parameter masks and Hessian eigenspaces.
result Top Hessian eigenvectors tend to be concentrated around larger parameters, indicating a connection between parameter magnitudes and loss curvature.
A simple method for estimating PMF on large supports, preserving structure and suppressing noise.
problem Nonparametric estimation of multi-modal, heavy-tailed PMF on large discrete support.
method Data-dependent low-pass filtering on a line graph Laplacian.
result Smooth, multi-modal estimate of PMF that preserves coarse structure and suppresses noise.