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

Krystian Król

dblp:263/8566 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 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
Deep learning architectures and training · 62% Language models and text generation · 38%

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

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
mixture of experts
1.522024
Mixture of Tokens: Continuous MoE through Cross-Example Aggregation · NeurIPS 2024
Scaling Laws for Fine-Grained Mixture of Experts · ICML 2024
Natural language and speech › Language models and text generation › efficient language model
efficient language model architectures
0.812024
Mixture of Tokens: Continuous MoE through Cross-Example Aggregation · NeurIPS 2024
Natural language and speech › Language models and text generation
large language model
0.812024
Scaling Laws for Fine-Grained Mixture of Experts · ICML 2024
Machine learning › Deep learning architectures and training
scaling laws
0.812024
Scaling Laws for Fine-Grained Mixture of Experts · ICML 2024
Machine learning › Deep learning architectures and training
transformer
0.212024
Mixture of Tokens: Continuous MoE through Cross-Example Aggregation · NeurIPS 2024

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

transition tuning · 0.8scaling laws · 0.8mixture of tokens · 0.8cross-example aggregation · 0.8
YearPublicationVenuePosition
2024 Scaling Laws for Fine-Grained Mixture of Experts
abstract
Mixture of Experts (MoE) models have emerged as a primary solution for reducing the computational cost of Large Language Models. In this work, we analyze their scaling properties, highlighting certain arbitrary assumptions present in the existing literature. In particular, we introduce a new hyperparameter, granularity, the modification of which allows for the optimal adjustment of the size of experts. Subsequently, we present scaling laws for fine-grained MoE, taking into account the number of training tokens, model size, and granularity. Using these scaling laws, we derive the optimal training configuration for a given computational budget. Furthermore, in contrast with previous works, we demonstrate that the gap in efficiency between dense and MoE models grows as we scale up the model size and training budget.
Jan Ludziejewski, Jakub Krajewski, Kamil Adamczewski, Maciej Pióro, Michal Krutul, Szymon Antoniak, Kamil Ciebiera, Krystian Król, Tomasz Odrzygózdz, Piotr Sankowski, Marek Cygan, Sebastian Jaszczur
ICML8
2024 Mixture of Tokens: Continuous MoE through Cross-Example Aggregation
abstract
Mixture of Experts (MoE) models based on Transformer architecture are pushing the boundaries of language and vision tasks. The allure of these models lies in their ability to substantially increase the parameter count without a corresponding increase in FLOPs. Most widely adopted MoE models are discontinuous with respect to their parameters - often referred to as *sparse*. At the same time, existing continuous MoE designs either lag behind their sparse counterparts or are incompatible with autoregressive decoding. Motivated by the observation that the adaptation of fully continuous methods has been an overarching trend in Deep Learning, we develop Mixture of Tokens (MoT), a simple, continuous architecture that is capable of scaling the number of parameters similarly to sparse MoE models. Unlike conventional methods, MoT assigns mixtures of tokens from different examples to each expert. This architecture is fully compatible with autoregressive training and generation. Our best models not only achieve a 3x increase in training speed over dense Transformer models in language pretraining but also match the performance of state-of-the-art MoE architectures. Additionally, a close connection between MoT and MoE is demonstrated through a novel technique we call *transition tuning*.
Szymon Antoniak, Michal Krutul, Maciej Pióro, Jakub Krajewski, Jan Ludziejewski, Kamil Ciebiera, Krystian Król, Tomasz Odrzygózdz, Marek Cygan, Sebastian Jaszczur
NeurIPS7