paper-with-me

홈 › Papers

Going Forward-Forward in Distributed Deep Learning

2024-03-30 · Ege Aktemur, Ege Zorlutuna, Kaan Bilgili, Tacettin Emre Bok, Berrin Yanikoglu, Suha Orhun Mutluergil

We introduce a new approach in distributed deep learning, utilizing Geoffrey Hinton's Forward-Forward (FF) algorithm to speed up the training of neural networks in distributed computing environments. Unlike traditional methods that rely on forward and backward passes, the FF algorithm employs a dual forward pass strategy, significantly diverging from the conventional backpropagation process. This novel method aligns more closely with the human brain's processing mechanisms, potentially offering a more efficient and biologically plausible approach to neural network training. Our research explores different implementations of the FF algorithm in distributed settings, to explore its capacity for parallelization. While the original FF algorithm focused on its ability to match the performance of the backpropagation algorithm, the parallelism aims to reduce training times and resource consumption, thereby addressing the long training times associated with the training of deep neural networks. Our evaluation shows a 3.75 times speed up on MNIST dataset without compromising accuracy when training a four-layer network with four compute nodes. The integration of the FF algorithm into distributed deep learning represents a significant step forward in the field, potentially revolutionizing the way neural networks are trained in distributed environments.

📄 PDF Abstract BibTeX arXiv:2404.08573

Code (0)

등록된 구현이 없습니다.

Tasks

Deep LearningDistributed Computing

Methods 이 논문이 사용한 방법론

SPEED The monocular depth estimation (MDE) is the task of estimating depth from a single frame. This information is an essential knowledge in many computer vision tasks such as scene…

Similar Papers 제목 키워드 기반

Distributed Heuristic Forward Search for Multi-Agent Systems

2013-06-25 · Raz Nissim, Ronen Brafman

This paper describes a number of distributed forward search algorithms for solving multi-agent planning problems. We introduce a distributed formulation of non-optimal forward search, as well as an optimal version, MAD-A…

Mistill: Distilling Distributed Network Protocols from Examples

2021-09-29 · Patrick Krämer, Johannes Zerwas, Andreas Blenk

New applications and use-cases in data center networks require the design of Traffic Engineering (TE) algorithms that account for application-specific traffic patterns. TE makes forwarding decisions from the global state…

Distributed Differentiable Dynamic Game for Multi-robot Coordination

2022-07-18 · Yizhi Zhou, Wanxin Jin, Xuan Wang

This paper develops a Distributed Differentiable Dynamic Game (D3G) framework, which can efficiently solve the forward and inverse problems in multi-robot coordination. We formulate multi-robot coordination as a dynamic …

Graph Neural Networks Go Forward-Forward

2023-02-10 · Daniele Paliotta, Mathieu Alain, Bálint Máté, François Fleuret

We present the Graph Forward-Forward (GFF) algorithm, an extension of the Forward-Forward procedure to graphs, able to handle features distributed over a graph's nodes. This allows training graph neural networks with for…

Graph Property PredictionProperty Prediction

Robust Internal Representations for Domain Generalization

2023-09-27 · Mohammad Rostami

This paper which is part of the New Faculty Highlights Invited Speaker Program of AAAI'23, serves as a comprehensive survey of my research in transfer learning by utilizing embedding spaces. The work reviewed in this pap…

Continual LearningDomain AdaptationDomain GeneralizationFew-Shot Learning+3