X-RLflow: Graph Reinforcement Learning for Neural Network Subgraphs Transformation
원문 초록
Tensor graph superoptimisation systems perform a sequence of subgraph substitution to neural networks, to find the optimal computation graph structure. Such a graph transformation process naturally falls into the framework of sequential decision-making, and existing systems typically employ a greedy search approach, which cannot explore the whole search space as it cannot tolerate a temporary loss of performance. In this paper, we address the tensor graph superoptimisation problem by exploring an alternative search approach, reinforcement learning (RL). Our proposed approach, X-RLflow, can learn to perform neural network dataflow graph rewriting, which substitutes a subgraph one at a time. X-RLflow is based on a model-free RL agent that uses a graph neural network (GNN) to encode the target computation graph and outputs a transformed computation graph iteratively. We show that our approach can outperform state-of-the-art superoptimisation systems over a range of deep learning models and achieve by up to 40% on those that are based on transformer-style architectures.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
A Survey of Continual Reinforcement Learning
Actor-Critic Deep Reinforcement Learning for Solving Job Shop Scheduling Problems
Adaptive Action Duration with Contextual Bandits for Deep Reinforcement Learning in Dynamic Environments
Flow-Based Single-Step Completion for Efficient and Expressive Policy Learning
Deep RL-based Trajectory Planning for AoI Minimization in UAV-assisted IoT
High-Throughput Distributed Reinforcement Learning via Adaptive Policy Synchronization
토론
이 논문과 연결된 포럼 글이 아직 없습니다.