Accelerating Matrix Diagonalization through Decision Transformers with Epsilon-Greedy Optimization
<|reference_start|>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.<|reference_end|>
@article{bhatta2024accelerating,
    title={Accelerating Matrix Diagonalization through Decision Transformers with
  Epsilon-Greedy Optimization},
    author={Kshitij Bhatta, Geigh Zollicoffer, Manish Bhattarai, Phil Romero,
  Christian F. A. Negre, Anders M. N. Niklasson, Adetokunbo Adedoyin},
    journal={arXiv preprint arXiv:2406.16191},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.16191},
    primaryClass={cs.LG cs.AI cs.NA math.NA}
}