Eigenvalue and Generalized Eigenvalue Problems: Tutorial
- URL: http://arxiv.org/abs/1903.11240v3
- Date: Sat, 20 May 2023 11:09:17 GMT
- Title: Eigenvalue and Generalized Eigenvalue Problems: Tutorial
- Authors: Benyamin Ghojogh, Fakhri Karray, Mark Crowley
- Abstract summary: This paper is a tutorial for eigenvalue and generalized eigenvalue problems.
We first introduce eigenvalue problem, eigen-decomposition (spectral decomposition), and generalized eigenvalue problem.
- Score: 12.323996999894002
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: 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 provide examples from machine learning, including principal
component analysis, kernel supervised principal component analysis, and Fisher
discriminant analysis, which result in eigenvalue and generalized eigenvalue
problems. Finally, we introduce the solutions to both eigenvalue and
generalized eigenvalue problems.
Related papers
- Improving Expressive Power of Spectral Graph Neural Networks with Eigenvalue Correction [55.57072563835959]
spectral graph neural networks are characterized by filters.
We propose an eigenvalue correction strategy that can free filters from the constraints of repeated eigenvalue inputs.
arXiv Detail & Related papers (2024-01-28T08:12:00Z) - Application of machine learning regression models to inverse eigenvalue
problems [0.0]
We study the numerical solution of inverse eigenvalue problems from a machine learning perspective.
Two different problems are considered: the inverse Strum-Liouville eigenvalue problem for symmetric potentials and the inverse transmission eigenvalue problem for spherically symmetric refractive indices.
arXiv Detail & Related papers (2022-12-08T14:15:01Z) - New Power Method for Solving Eigenvalue Problems [0.0]
We present a new power method to obtain solutions of eigenvalue problems.
The method can determine not only the dominant or lowest eigenvalues but also all eigenvalues without the need for a deflation procedure.
arXiv Detail & Related papers (2022-10-31T22:26:11Z) - Sign and Basis Invariant Networks for Spectral Graph Representation
Learning [75.18802152811539]
We introduce SignNet and BasisNet -- new neural architectures that are invariant to all requisite symmetries and hence process collections of eigenspaces in a principled manner.
Our networks are theoretically strong for graph representation learning -- they can approximate any spectral graph convolution.
Experiments show the strength of our networks for learning spectral graph filters and learning graph positional encodings.
arXiv Detail & Related papers (2022-02-25T23:11:59Z) - Isogeometric Analysis of Bound States of a Quantum Three-Body Problem in
1D [0.0]
We represent the wavefunctions by linear combinations of B-spline basis functions and solve the problem as a matrix eigenvalue problem.
The eigenvalue gives the eigenstate energy while the eigenvector gives the coefficients of the B-splines that lead to the eigenstate.
We demonstrate through various numerical experiments that IGA provides a promising technique to solve the three-body problem.
arXiv Detail & Related papers (2022-02-21T04:27:31Z) - QUBO transformation using Eigenvalue Decomposition [0.5439020425819]
This paper utilizes the eigenvalue decomposition of the underlying Q matrix to alter and improve the search process.
We show significant performance improvements on problems with dominant eigenvalues.
arXiv Detail & Related papers (2021-06-19T16:58:15Z) - Eigen Analysis of Self-Attention and its Reconstruction from Partial
Computation [58.80806716024701]
We study the global structure of attention scores computed using dot-product based self-attention.
We find that most of the variation among attention scores lie in a low-dimensional eigenspace.
We propose to compute scores only for a partial subset of token pairs, and use them to estimate scores for the remaining pairs.
arXiv Detail & Related papers (2021-06-16T14:38:42Z) - Minimax Estimation of Linear Functions of Eigenvectors in the Face of
Small Eigen-Gaps [95.62172085878132]
Eigenvector perturbation analysis plays a vital role in various statistical data science applications.
We develop a suite of statistical theory that characterizes the perturbation of arbitrary linear functions of an unknown eigenvector.
In order to mitigate a non-negligible bias issue inherent to the natural "plug-in" estimator, we develop de-biased estimators.
arXiv Detail & Related papers (2021-04-07T17:55:10Z) - Analysis of Truncated Orthogonal Iteration for Sparse Eigenvector
Problems [78.95866278697777]
We propose two variants of the Truncated Orthogonal Iteration to compute multiple leading eigenvectors with sparsity constraints simultaneously.
We then apply our algorithms to solve the sparse principle component analysis problem for a wide range of test datasets.
arXiv Detail & Related papers (2021-03-24T23:11:32Z) - Structured eigenvalue problems in electronic structure methods from a
unified perspective [0.0]
The quaternion matrix eigenvalue problem and the linear response (Bethe-Salpeter) eigenvalue problem for excitation energies are frequently encountered structured eigenvalue problems.
We show that the identification of Lie group structures for their eigenvectors provides a framework to design diagonalization algorithms.
arXiv Detail & Related papers (2020-09-02T15:20:15Z) - Eigendecomposition-Free Training of Deep Networks for Linear
Least-Square Problems [107.3868459697569]
We introduce an eigendecomposition-free approach to training a deep network.
We show that our approach is much more robust than explicit differentiation of the eigendecomposition.
Our method has better convergence properties and yields state-of-the-art results.
arXiv Detail & Related papers (2020-04-15T04:29:34Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.