TL;DR
RL4RLA introduces a reinforcement learning framework that automates the discovery of interpretable randomized linear algebra algorithms, leveraging curriculum design and graph-based search to outperform manual methods.
Contribution
The paper presents a novel RL-based approach that builds explicit RLA algorithms from primitives, incorporating curriculum learning and Monte Carlo Graph Search for efficient exploration.
Findings
RL4RLA rediscovered state-of-the-art RLA algorithms.
It can generate algorithms optimized for specific trade-offs.
The framework ensures verifiable and implementable symbolic algorithms.
Abstract
Randomized linear algebra (RLA) algorithms are a modern class of numerical linear algebra techniques that play an essential role in scientific computing and machine learning, with broad and growing adoption. However, their discovery remains mostly a manual process that requires deep expert knowledge and inspiration. While Reinforcement Learning (RL) offers a pathway to automation, standard approaches struggle with sparse reward landscapes and vast search spaces inherent to high-performing RLA algorithms. In this paper, we present RL4RLA, a general RL framework that automates the discovery of interpretable, symbolic RLA algorithms. Unlike black-box approaches, our method builds explicit algorithms from basic linear algebra primitives, ensuring verifiable and implementable representations. To enable efficient discovery, we introduce: (1) a numerical curriculum that progressively…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
