Solving the k-sparse eigenvalue problem with reinforcement learning

DOI10.4208/CSIAM-AM.2020-0220MaRDI QIDQ6941305zbMATH OpenFDO

Authors Li Zhou, Lihao Yan, M. A. Caprio, Weiguo Gao, Chao Yang

Publication date 19 August 2025

Published in CSIAM Transactions on Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4208/CSIAM-AM.2020-0220

zbMATH Keywords

approximate Q-learningeigenvector localizationhigh performance computinglarge-scale eigenvalue problemquantum many-body problemreinforcement learningstochastic sampling

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Pattern recognition, speech recognition (68T10)

Cites work

• \({\mathcal Q}\)-learning
• A greedy algorithm for computing eigenvalues of a symmetric matrix with localized eigenvectors
• Area laws and efficient descriptions of quantum many-body states
• Feature-based methods for large scale dynamic programming
• Generalized power method for sparse principal component analysis
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• Optimal solutions for sparse principal component analysis
• Reinforcement learning. An introduction
• Solving the k-sparse eigenvalue problem with reinforcement learning
• The Full Configuration Interaction Quantum Monte Carlo Method through the Lens of Inexact Power Iteration

Cited in

(1)

• Solving the k-sparse eigenvalue problem with reinforcement learning

This page was built for publication: Solving the \(k\)-sparse eigenvalue problem with reinforcement learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6941305)