Precision autotuning for linear solvers via contextual bandit-based RL
Erin Carson, Xinye Chen

TL;DR
This paper introduces a reinforcement learning framework using a contextual bandit approach to adaptively tune precision in linear solvers, improving efficiency while maintaining accuracy.
Contribution
It presents the first RL-based precision autotuning method for linear solvers, demonstrating effectiveness and generalization to unseen data.
Findings
Reduces computational cost compared to double-precision baselines.
Maintains accuracy and convergence in iterative refinement.
Generalizes well to out-of-sample data.
Abstract
We propose a reinforcement learning (RL) framework for adaptive precision tuning for linear solvers, which can be extended to general algorithms. The framework is formulated as a contextual bandit problem and solved using incremental action-value estimation with a discretized state space to select optimal precision configurations for computational steps, balancing precision and computational efficiency. To verify its effectiveness, we apply the framework to iterative refinement for solving linear systems . In this application, our approach dynamically chooses precisions based on calculated features from the system while maintaining acceptable accuracy and convergence. In detail, an action-value estimator takes discretized features (e.g., approximate condition number and matrix norm) as input and outputs estimated action values, from which a policy selects the actions (chosen…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
