Accelerating Matrix Diagonalization through Decision Transformers with Epsilon-Greedy Optimization
This paper introduces a novel framework for matrix diagonalization, recasting it as a sequential decision-making problem and applying the power of Decision Transformers (DTs). Our approach determines optimal pivot selection during diagonalization with the Jacobi algorithm, leading to significant speedups compared to the traditional max-element Jacobi method. To bolster robustness, we integrate an epsilon-greedy strategy, enabling success in scenarios where deterministic approaches fail. This work demonstrates the effectiveness of DTs in complex computational tasks and highlights the potential of reimagining mathematical operations through a machine learning lens. Furthermore, we establish the generalizability of our method by using transfer learning to diagonalize matrices of smaller sizes than those trained.
Code (0)
등록된 구현이 없습니다.
Tasks
Decision MakingSequential Decision MakingTransfer LearningSimilar Papers 제목 키워드 기반
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 …
Robust Blind Source Separation by Soft Decision-Directed Non-Unitary Joint Diagonalization
Approximate joint diagonalization of a set of matrices provides a powerful framework for numerous statistical signal processing applications. For non-unitary joint diagonalization (NUJD) based on the least-squares (LS) c…
blind source separationMatrix 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…
Diagonalization 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…
Leveraging Joint-Diagonalization in Transform-Learning NMF
Non-negative matrix factorization with transform learning (TL-NMF) is a recent idea that aims at learning data representations suited to NMF. In this work, we relate TL-NMF to the classical matrix joint-diagonalization (…