paper-with-me

Papers

RLFlow: Optimising Neural Network Subgraph Transformation with World Models

2022-05-03 · Sean Parker, Sami Alabed, Eiko Yoneki

Training deep learning models takes an extremely long execution time and consumes large amounts of computing resources. At the same time, recent research proposed systems and compilers that are expected to decrease deep learning models runtime. An effective optimisation methodology in data processing is desirable, and the reduction of compute requirements of deep learning models is the focus of extensive research. In this paper, we address the neural network sub-graph transformation by exploring reinforcement learning (RL) agents to achieve performance improvement. Our proposed approach RLFlow can learn to perform neural network subgraph transformations, without the need for expertly designed heuristics to achieve a high level of performance. Recent work has aimed at applying RL to computer systems with some success, especially using model-free RL techniques. Model-based reinforcement learning methods have seen an increased focus in research as they can be used to learn the transition dynamics of the environment; this can be leveraged to train an agent using a hallucinogenic environment such as World Model (WM), thereby increasing sample efficiency compared to model-free approaches. WM uses variational auto-encoders and it builds a model of the system and allows exploring the model in an inexpensive way. In RLFlow, we propose a design for a model-based agent with WM which learns to optimise the architecture of neural networks by performing a sequence of sub-graph transformations to reduce model runtime. We show that our approach can match the state-of-the-art performance on common convolutional networks and outperforms by up to 5% those based on transformer-style architectures

📄 PDF Abstract BibTeX arXiv:2205.01435

Code (1)

seanjparker/rlflow 공식 구현 tf

Tasks

Deep LearningModel-based Reinforcement Learningreinforcement-learningReinforcement Learning (RL)

Similar Papers 제목 키워드 기반

X-RLflow: Graph Reinforcement Learning for Neural Network Subgraphs Transformation

2023-04-28 · Guoliang He, Sean Parker, Eiko Yoneki

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 framewo…

Decision MakingGraph Neural Networkreinforcement-learningReinforcement Learning+2

Controllable Flow Matching for Online Reinforcement Learning

2025-11-10 · Bin Wang, Boxiang Tao, Haifeng Jing, Hongbo Dou 외 arxiv

Model-based reinforcement learning (MBRL) typically relies on modeling environment dynamics for data efficiency. However, due to the accumulation of model errors over long-horizon rollouts, such methods often face challe…

Reinforcement Learning

HMSG: Heterogeneous Graph Neural Network based on Metapath Subgraph Learning

2021-09-07 · Xinjun Cai, Jiaxing Shang, Fei Hao, Dajiang Liu 외

Many real-world data can be represented as heterogeneous graphs with different types of nodes and connections. Heterogeneous graph neural network model aims to embed nodes or subgraphs into low-dimensional vector space f…

AttributeGraph Neural NetworkLink PredictionNode Classification+1

5* Knowledge Graph Embeddings with Projective Transformations

2020-06-08 · Mojtaba Nayyeri, Sahar Vahdati, Can Aykul, Jens Lehmann

Performing link prediction using knowledge graph embedding models has become a popular approach for knowledge graph completion. Such models employ a transformation function that maps nodes via edges into a vector space i…

Graph EmbeddingKnowledge Graph CompletionKnowledge Graph EmbeddingKnowledge Graph Embeddings+3

PassNet: Scaling Large Language Models for Graph Compiler Pass Generation

2026-05-28 · Yiqun Liu, Yingsheng Wu, Ruqi Yang, Enrong Zheng 외 arxiv

Modern tensor compilers such as TorchInductor deliver substantial speedups on mainstream models, yet face a systematic performance ceiling on long-tail workloads -- our profiling shows that 43% of real-world subgraphs ex…