Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Younes Belkada

dblp:280/8696 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 since 2021Computer networks · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Efficient and distributed learning · 85% Language models and text generation · 15%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 33% Cloud and datacenter computing · 33% Parallel and multicore computing · 33%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed systems
fault tolerance
0.712023
Distributed Inference and Fine-tuning of Large Language Models Over The Internet · NeurIPS 2023
Parallel and multicore computing
load balancing
0.712023
Distributed Inference and Fine-tuning of Large Language Models Over The Internet · NeurIPS 2023
Cloud and datacenter computing
resource management
0.712023
Distributed Inference and Fine-tuning of Large Language Models Over The Internet · NeurIPS 2023
Machine learning › Efficient and distributed learning › inference efficiency
memory-efficient inference
0.612022
GPT3.int8(): 8-bit Matrix Multiplication for Transformers at Scale · NeurIPS 2022
Machine learning › Efficient and distributed learning
model compression
0.612022
GPT3.int8(): 8-bit Matrix Multiplication for Transformers at Scale · NeurIPS 2022
Machine learning › Efficient and distributed learning › model compression
quantization
0.612022
GPT3.int8(): 8-bit Matrix Multiplication for Transformers at Scale · NeurIPS 2022
Machine learning › Efficient and distributed learning › model inference
transformer inference
0.612022
GPT3.int8(): 8-bit Matrix Multiplication for Transformers at Scale · NeurIPS 2022
Natural language and speech › Language models and text generation
large language model fine-tuning
0.212023
Distributed Inference and Fine-tuning of Large Language Models Over The Internet · NeurIPS 2023
Natural language and speech › Language models and text generation
large language model inference
0.212023
Distributed Inference and Fine-tuning of Large Language Models Over The Internet · NeurIPS 2023

Methods — techniques the papers use, named apart from their topics

model partitioning · 1.3decentralized inference · 1.3vector-wise quantization · 0.6mixed-precision decomposition · 0.6
YearPublicationVenuePosition
2023 Distributed Inference and Fine-tuning of Large Language Models Over The Internet
abstract
Large language models (LLMs) are useful in many NLP tasks and become more capable with size, with the best open-source models having over 50 billion parameters. However, using these 50B+ models requires high-end hardware, making them inaccessible to most researchers. In this work, we investigate methods for cost-efficient inference and fine-tuning of LLMs, comparing local and distributed strategies. We observe that a large enough model (50B+) can run efficiently even on geodistributed devices in a consumer-grade network. This could allow running LLM efficiently by pooling together idle compute resources of multiple research groups and volunteers. We address two open problems: (1) how to perform inference and fine-tuning reliably if any device can disconnect abruptly and (2) how to partition LLMs between devices with uneven hardware, joining and leaving at will. In order to do that, we develop special fault-tolerant inference algorithms and load-balancing protocols that automatically assign devices to maximize the total system throughput. We showcase these algorithms in Petals — a decentralized system that runs Llama 2 (70B) and BLOOM (176B) over the Internet up to $10\times$ faster than offloading for interactive generation. We evaluate the performance of our system in simulated conditions and a real-world setup spanning two continents.
Alexander Borzunov, Max Ryabinin, Artem Chumachenko, Dmitry Baranchuk, Tim Dettmers, Younes Belkada, Pavel Samygin, Colin Raffel
NeurIPS6
2022 GPT3.int8(): 8-bit Matrix Multiplication for Transformers at Scale
abstract
Large language models have been widely adopted but require significant GPU memory for inference. We develop a procedure for Int8 matrix multiplication for feed-forward and attention projection layers in transformers, which cut the memory needed for inference by half while retaining full precision performance. With our method, a 175B parameter 16/32-bit checkpoint can be loaded, converted to Int8, and used immediately without performance degradation. This is made possible by understanding and working around properties of highly systematic emergent features in transformer language models that dominate attention and transformer predictive performance. To cope with these features, we develop a two-part quantization procedure, {\bf LLM.int8()}. We first use vector-wise quantization with separate normalization constants for each inner product in the matrix multiplication, to quantize most of the features. However, for the emergent outliers, we also include a new mixed-precision decomposition scheme, which isolates the outlier feature dimensions into a 16-bit matrix multiplication while still more than 99.9\% of values are multiplied in 8-bit. Using LLM.int8(), we show empirically it is possible to perform inference in LLMs with up to 175B parameters without any performance degradation. This result makes such models much more accessible, for example making it possible to use OPT-175B/BLOOM on a single server with consumer GPUs. We open source our software.
Tim Dettmers, Mike Lewis, Younes Belkada, Luke Zettlemoyer
NeurIPS3
2021 ClusTi: Clustering Method for Table Structure Recognition in Scanned Images
Arthur Zucker, Younes Belkada, Hanh Vu, Nam Van Nguyen
Mob. Networks Appl.2