Towards Faster Matrix Diagonalization with Graph Isomorphism Networks and the AlphaZero Framework
In this paper, we introduce innovative approaches for accelerating the Jacobi method for matrix diagonalization, specifically through the formulation of large matrix diagonalization as a Semi-Markov Decision Process and small matrix diagonalization as a Markov Decision Process. Furthermore, we examine the potential of utilizing scalable architecture between different-sized matrices. During a short training period, our method discovered a significant reduction in the number of steps required for diagonalization and exhibited efficient inference capabilities. Importantly, this approach demonstrated possible scalability to large-sized matrices, indicating its potential for wide-ranging applicability. Upon training completion, we obtain action-state probabilities and transition graphs, which depict transitions between different states. These outputs not only provide insights into the diagonalization process but also pave the way for cost savings pertinent to large-scale matrices. The advancements made in this research enhance the efficacy and scalability of matrix diagonalization, pushing for new possibilities for deployment in practical applications in scientific and engineering domains.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Matrix Diagonalization as a Board Game: Teaching an Eigensolver the Fastest Path to Solution
Matrix diagonalization is at the cornerstone of numerous fields of scientific computing. Diagonalizing a matrix to solve an eigenvalue problem requires a sequential path of iterations that eventually reaches a sufficient…
Mathematical representation of the structure of neuron-glia networks
Network representations of the nervous system have been useful for the understanding of brain phenomena such as perception, motor coordination, and memory. Although brains are composed of both neurons and glial cells, ne…
MathZero, The Classification Problem, and Set-Theoretic Type Theory
AlphaZero learns to play go, chess and shogi at a superhuman level through self play given only the rules of the game. This raises the question of whether a similar thing could be done for mathematics -- a MathZero. Math…
ClassificationGeneral ClassificationVocal Bursts Type PredictionEfficient State Space Model via Fast Tensor Convolution and Block Diagonalization
Existing models encounter bottlenecks in balancing performance and computational efficiency when modeling long sequences. Although the state space model (SSM) has achieved remarkable success in handling long sequence tas…
Computational EfficiencyDisentanglementMambamodelDiagonalization without Diagonalization: A Direct Optimization Approach for Solid-State Density Functional Theory
We present a novel approach to address the challenges of variable occupation numbers in direct optimization of density functional theory (DFT). By parameterizing both the eigenfunctions and the occupation matrix, our met…