2008
DOI: 10.1007/978-3-540-69384-0_100
|View full text |Cite
|
Sign up to set email alerts
|

On Using Reinforcement Learning to Solve Sparse Linear Systems

Abstract: Abstract. This paper describes how reinforcement learning can be used to select from a wide variety of preconditioned solvers for sparse linear systems. This approach provides a simple way to consider complex metrics of goodness, and makes it easy to evaluate a wide range of preconditioned solvers. A basic implementation recommends solvers that, when they converge, generally do so with no more than a 17% overhead in time over the best solver possible within the test framework. Potential refinements of, and ext… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
8
0

Year Published

2009
2009
2020
2020

Publication Types

Select...
3
3
2

Relationship

1
7

Authors

Journals

citations
Cited by 14 publications
(8 citation statements)
references
References 18 publications
0
8
0
Order By: Relevance
“…Armstrong et al (2006) use an agent-based model that rewards good actions and punishes bad actions based on computation time. Kuefler and Chen (2008) follow a very similar approach that also takes success or failure into account. Carchrae andBeck (2004, 2005) monitor the solution quality during search.…”
Section: Static and Dynamic Featuresmentioning
confidence: 99%
“…Armstrong et al (2006) use an agent-based model that rewards good actions and punishes bad actions based on computation time. Kuefler and Chen (2008) follow a very similar approach that also takes success or failure into account. Carchrae andBeck (2004, 2005) monitor the solution quality during search.…”
Section: Static and Dynamic Featuresmentioning
confidence: 99%
“…There have been some advances to apply machine-learning methods within the context of linear solvers. So far, work has focused on using machine learning to either select the best solver-preconditioner setup from a set of preconditioners and/or linear solvers for a given linear problem (Holloway & Chen, 2007;Kuefler & Chen, 2008;Xu & Zhang, 2005;George et al, 2008;Yamada et al, 2018;Huang et al, 2016;Peairs & Chen, 2011), to help improve efficiency for Block-Jacobi type preconditioners (Götz & Anzt, 2018), to reduce the time-to-solution by interspersing linear solver iterations with neural-network based correction steps (Rizzuti et al, 2019), or to replace the linear solver entirely (Tompson et al, 2017;Yang, Yang, & Xiao, 2016;Ladický et al, 2015). This paper will try a fundamentally new approach by using supervised machine learning to derive the preconditioner directly.…”
Section: Introductionmentioning
confidence: 99%
“…The accuracy of the chosen transport model and the efficiency of the corresponding solver/preconditioner pair depend on these physical properties. Numerous studies have been carried out in the computer science and mathematics communities addressing the use of machine learning algorithms for choosing optimal solvers for linear systems [1,2,3,4,5]. None of these works, however, specifically target particle transport problems, and the authors are unaware of any such study addressing transport solvers.…”
Section: Introductionmentioning
confidence: 99%