paper-with-me

홈 › Papers

Learning to Schedule Learning rate with Graph Neural Networks

2021-09-29 · ICLR 2022 4 · Yuanhao Xiong, Li-Cheng Lan, Xiangning Chen, Ruochen Wang, Cho-Jui Hsieh

Recent decades have witnessed great development of stochastic optimization in training deep neural networks. Learning rate scheduling is one of the most important factors that influence the performance of stochastic optimizers like Adam. Traditional methods seek to find a relatively proper scheduling among a limited number of pre-defined rules and might not accommodate a particular target problem. Instead, we propose a novel Graph-Network-based Scheduler (GNS), aiming at learning a specific scheduling mechanism without restrictions to existing principles. By constructing a directed graph for the underlying neural network of the target problem, GNS encodes current dynamics with a graph message passing network and trains an agent to control the learning rate accordingly via reinforcement learning. The proposed scheduler can capture the intermediate layer information while being able to generalize to problems of varying scales. Besides, an efficient reward collection procedure is leveraged to speed up training. We evaluate our framework on benchmarking datasets, Fashion-MNIST and CIFAR10 for image classification, and GLUE for language understanding. GNS shows consistent improvement over popular baselines when training CNN and Transformer models. Moreover, GNS demonstrates great generalization to different datasets and network structures.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Benchmarkingimage-classificationImage ClassificationSchedulingStochastic Optimization

Methods 이 논문이 사용한 방법론

Multi-Head Attention 설명 없음
Attention 설명 없음
Linear Layer A Linear Layer is a projection $\mathbf{XW + b}$.
Residual Connection 설명 없음
Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…
Dropout Dropout is a regularization technique for neural networks that drops a unit (along with connections) at training time with a specified probability $p$ (a common value is…
Dense Connections Dense Connections, or Fully Connected Connections, are a type of layer in a deep neural network that use a linear operation where every input is connected to every output…
Absolute Position Encodings Absolute Position Encodings are a type of position embeddings for [Transformer-based models] where positional encodings are…

Similar Papers 제목 키워드 기반

GCNScheduler: Scheduling Distributed Computing Applications using Graph Convolutional Networks

2021-10-22 · Mehrdad Kiamari, Bhaskar Krishnamachari

We consider the classical problem of scheduling task graphs corresponding to complex applications on distributed computing systems. A number of heuristics have been previously proposed to optimize task scheduling with re…

Distributed ComputingScheduling

ScheduleNet: Learn to solve multi-agent scheduling problems with reinforcement learning

2021-06-06 · Junyoung Park, Sanjar Bakhtiyar, Jinkyoo Park

We propose ScheduleNet, a RL-based real-time scheduler, that can solve various types of multi-agent scheduling problems. We formulate these problems as a semi-MDP with episodic reward (makespan) and learn ScheduleNet, a …

Decision MakingGraph AttentionJob Shop Schedulingreinforcement-learning+2

Learning to schedule job-shop problems: Representation and policy learning using graph neural network and reinforcement learning

2021-06-02 · Junyoung Park, Jaehyeong Chun, Sang Hun Kim, Youngkook Kim 외

We propose a framework to learn to schedule a job-shop problem (JSSP) using a graph neural network (GNN) and reinforcement learning (RL). We formulate the scheduling process of JSSP as a sequential decision-making proble…

Decision MakingGraph Neural NetworkGraph Representation LearningReinforcement Learning (RL)+3

Delay-Oriented Distributed Scheduling Using Graph Neural Networks

2021-11-13 · Zhongyuan Zhao, Gunjan Verma, Ananthram Swami, Santiago Segarra

In wireless multi-hop networks, delay is an important metric for many applications. However, the max-weight scheduling algorithms in the literature typically focus on instantaneous optimality, in which the schedule is se…

Scheduling

Bandwidth Optimal Pipeline Schedule for Collective Communication

2023-05-29 · Liangyu Zhao, Arvind Krishnamurthy

We present a strongly polynomial-time algorithm to generate bandwidth optimal allgather/reduce-scatter on any network topology, with or without switches. Our algorithm constructs pipeline schedules achieving provably the…