paper-with-me

홈 › Papers

DiPaCo: Distributed Path Composition

2024-03-15 · Arthur Douillard, Qixuan Feng, Andrei A. Rusu, Adhiguna Kuncoro, Yani Donchev, Rachita Chhaparia, Ionel Gog, Marc'Aurelio Ranzato, Jiajun Shen, Arthur Szlam

Progress in machine learning (ML) has been fueled by scaling neural network models. This scaling has been enabled by ever more heroic feats of engineering, necessary for accommodating ML approaches that require high bandwidth communication between devices working in parallel. In this work, we propose a co-designed modular architecture and training approach for ML models, dubbed DIstributed PAth COmposition (DiPaCo). During training, DiPaCo distributes computation by paths through a set of shared modules. Together with a Local-SGD inspired optimization (DiLoCo) that keeps modules in sync with drastically reduced communication, Our approach facilitates training across poorly connected and heterogeneous workers, with a design that ensures robustness to worker failures and preemptions. At inference time, only a single path needs to be executed for each input, without the need for any model compression. We consider this approach as a first prototype towards a new paradigm of large-scale learning, one that is less synchronous and more modular. Our experiments on the widely used C4 benchmark show that, for the same amount of training steps but less wall-clock time, DiPaCo exceeds the performance of a 1 billion-parameter dense transformer language model by choosing one of 256 possible paths, each with a size of 150 million parameters.

📄 PDF Abstract BibTeX arXiv:2403.10616

Code (0)

등록된 구현이 없습니다.

Tasks

Language ModellingModel Compression

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Similar Papers 제목 키워드 기반

Siren Federate: Bridging document, relational, and graph models for exploratory graph analysis

2025-04-10 · Georgeta Bordea, Stephane Campinas, Matteo Catena, Renaud Delbru

Investigative workflows require interactive exploratory analysis on large heterogeneous knowledge graphs. Current databases show limitations in enabling such task. This paper discusses the architecture of Siren Federate,…

Knowledge Graphs

QoS-aware Big Service Composition using Distributed Co-Evolutionary Algorithm

2021-09-14 · Concurrency and Computation Practice and Experience 2021 9 · Avik Dutta, Chandrashekar Jatoth, G R Gangadharan, Ugo Fiore

Big services are collections of interrelated web services across virtual and physical domains, processing Big Data. Existing service selection and composition algorithms fail to achieve the global optimum solution in a r…

DiversityMultiobjective OptimizationService Composition

DoA-Aided MMSE Channel Estimation for Wireless Communication Systems

2023-12-11 · Franz Weißer, Nurettin Turan, Wolfgang Utschick

This paper investigates the combination of parametric channel estimation with minimum mean square error (MMSE) estimation. We propose a direction-of-arrival (DoA)-aided two-stage channel estimation technique that utilize…

Distributed physics-informed neural networks via domain decomposition for fast flow reconstruction

2026-02-05 · Yixiao Qian, Jiaxu Liu, Zewei Xia, Song Chen 외 arxiv

Physics-Informed Neural Networks (PINNs) offer a powerful paradigm for flow reconstruction, seamlessly integrating sparse velocity measurements with the governing Navier-Stokes equations to recover complete velocity and …

Distributed Bayesian Matrix Decomposition for Big Data Mining and Clustering

2020-02-10 · Chihao Zhang, Yang Yang, Wei zhang, Shihua Zhang

Matrix decomposition is one of the fundamental tools to discover knowledge from big data generated by modern applications. However, it is still inefficient or infeasible to process very big data using such a method in a …

ClusteringDistributed Computing