Mixture of experts

Machine learning technique

Part of a series on

Machine learning
and data mining

Paradigms

* Supervised learning
* Unsupervised learning
* Online learning
* Batch learning
* Meta-learning
* Semi-supervised learning
* Self-supervised learning
* Reinforcement learning
* Curriculum learning
* Rule-based learning
* Quantum machine learning

Problems

* Classification
* Generative modeling
* Regression
* Clustering
* Dimensionality reduction
* Density estimation
* Anomaly detection
* Data cleaning
* AutoML
* Association rules
* Semantic analysis
* Structured prediction
* Feature engineering
* Feature learning
* Learning to rank
* Grammar induction
* Ontology learning
* Multimodal learning

Supervised learning
(classification • regression)

* Apprenticeship learning
* Decision trees
* Ensembles
* Bagging
* Boosting
* Random forest
* k-NN
* Linear regression
* Naive Bayes
* Artificial neural networks
* Logistic regression
* Perceptron
* Relevance vector machine (RVM)
* Support vector machine (SVM)

Clustering

* BIRCH
* CURE
* Hierarchical
* k-means
* Fuzzy
* Expectation–maximization (EM)

DBSCAN
* OPTICS
* Mean shift

Dimensionality reduction

* Factor analysis
* CCA
* ICA
* LDA
* NMF
* PCA
* PGD
* t-SNE
* SDL

Structured prediction

* Graphical models
* Bayes net
* Conditional random field
* Hidden Markov

Anomaly detection

* RANSAC
* k-NN
* Local outlier factor
* Isolation forest

Artificial neural network

* Autoencoder
* Cognitive computing
* Deep learning
* DeepDream
* Feedforward neural network
* Recurrent neural network
* LSTM
* GRU
* ESN
* reservoir computing
* Restricted Boltzmann machine
* GAN
* Diffusion model
* SOM
* Convolutional neural network
* U-Net
* Transformer
* Vision
* Mamba
* Spiking neural network
* Memtransistor
* Electrochemical RAM (ECRAM)

Reinforcement learning

* Q-learning
* SARSA
* Temporal difference (TD)
* Multi-agent
* Self-play

Learning with humans

* Active learning
* Crowdsourcing
* Human-in-the-loop
* RLHF

Model diagnostics

* Coefficient of determination
* Confusion matrix
* Learning curve
* ROC curve

Mathematical foundations

* Kernel machines
* Bias–variance tradeoff
* Computational learning theory
* Empirical risk minimization
* Occam learning
* PAC learning
* Statistical learning
* VC theory

Machine-learning venues

* ECML PKDD
* NeurIPS
* ICML
* ICLR
* IJCAI
* ML
* JMLR

Related articles

* Glossary of artificial intelligence
* List of datasets for machine-learning research
* List of datasets in computer vision and image processing
* Outline of machine learning

* v
* t
* e

Mixture of experts (MoE) is a machine learning technique where multiple expert networks (learners) are used to divide a problem space into homogeneous regions.[1] It differs from ensemble techniques in that for MoE, typically only one or a few expert models are run for each input, whereas in ensemble techniques, all models are run on every input.

## Basic theory

[edit]

In mixture of experts, we always have the following ingredients, but they are constructed and combined differently.

* There are experts  f 1 , . . . , f n {\displaystyle f_{1},...,f_{n}} , each taking in the same input  x {\displaystyle x} , and produces outputs  f 1 ( x ) , . . . , f n ( x ) {\displaystyle f_{1}(x),...,f_{n}(x)} .
* There is a single weighting function (aka gating function)  w {\displaystyle w} , which takes in  x {\displaystyle x} and produces a vector of outputs  ( w ( x ) 1 , . . . , w ( x ) n ) {\displaystyle (w(x)_{1},...,w(x)_{n})} .
* θ = ( θ 0 , θ 1 , . . . , θ n ) {\displaystyle \theta =(\theta _{0},\theta _{1},...,\theta _{n})} is the set of parameters. The parameter  θ 0 {\displaystyle \theta _{0}} is for the weighting function.
* Given an input  x {\displaystyle x} , the mixture of experts produces a single combined output by combining  f 1 ( x ) , . . . , f n ( x ) {\displaystyle f_{1}(x),...,f_{n}(x)} according to the weights  w ( x ) 1 , . . . , w ( x ) n {\displaystyle w(x)_{1},...,w(x)_{n}} in some way.

Both the experts and the weighting function are trained by minimizing some form of loss function, generally by gradient descent. There is a lot of freedom in choosing the precise form of experts, the weighting function, and the loss function.

### Meta-pi network

[edit]

The meta-pi network, reported by Hampshire and Waibel,[2] uses  f ( x ) = ∑ i w ( x ) i f i ( x ) {\displaystyle f(x)=\sum _{i}w(x)_{i}f_{i}(x)} as the output. The model is trained by performing gradient descent on the mean-squared error loss  L := 1 N ∑ k ‖ y k − f ( x k ) ‖ 2 {\displaystyle L:={\frac {1}{N}}\sum _{k}\|y_{k}-f(x_{k})\|^{2}} . The experts may be arbitrary functions.

In their original publication, they were solving the problem of classifying phonemes in speech signal from 6 different Japanese speakers, 2 females and 4 males. They trained 6 experts, each being a "time-delayed neural network"[3] (essentially a multilayered convolution network over the mel spectrogram). They found that the resulting mixture of experts dedicated 5 experts for 5 of the speakers, but the 6th (male) speaker does not have a dedicated expert, instead his voice was classified by a linear combination of the experts for the other 3 male speakers.

### Adaptive mixtures of local experts

[edit]

The adaptive mixtures of local experts [4][5] uses a gaussian mixture model. Each expert simply predicts a gaussian distribution, and totally ignores the input. Specifically, the  i {\displaystyle i} -th expert predicts that the output is  y ∼ N ( μ i , I ) {\displaystyle y\sim N(\mu _{i},I)} , where  μ i {\displaystyle \mu _{i}} is a learnable parameter. The weighting function is a linear-softmax function: w ( x ) i = e k i T x + b i ∑ j e k j T x + b j {\displaystyle w(x)_{i}={\frac {e^{k_{i}^{T}x+b_{i}}}{\sum _{j}e^{k_{j}^{T}x+b_{j}}}}} The mixture of experts predict that the output is distributed according to the probability density function: f θ ( y | x ) = ln ⁡ [ ∑ i e k i T x + b i ∑ j e k j T x + b j N ( y | μ i , I ) ] = ln ⁡ [ ( 2 π ) − d / 2 ∑ i e k i T x + b i ∑ j e k j T x + b j e − 1 2 ‖ y − μ i ‖ 2 ] {\displaystyle f_{\theta }(y|x)=\ln \left[\sum _{i}{\frac {e^{k_{i}^{T}x+b_{i}}}{\sum _{j}e^{k_{j}^{T}x+b_{j}}}}N(y|\mu _{i},I)\right]=\ln \left[(2\pi )^{-d/2}\sum _{i}{\frac {e^{k_{i}^{T}x+b_{i}}}{\sum _{j}e^{k_{j}^{T}x+b_{j}}}}e^{-{\frac {1}{2}}\|y-\mu _{i}\|^{2}}\right]} It is trained by maximal likelihood estimation, that is, gradient ascent on  f ( y | x ) {\displaystyle f(y|x)} . The gradient for the  i {\displaystyle i} -th expert is

∇ μ i f θ ( y | x ) = w ( x ) i N ( y | μ i , I ) ∑ j w ( x ) j N ( y | μ j , I ) ( y − μ i ) {\displaystyle \nabla _{\mu _{i}}f_{\theta }(y|x)={\frac {w(x)_{i}N(y|\mu _{i},I)}{\sum _{j}w(x)_{j}N(y|\mu _{j},I)}}\;(y-\mu _{i})}

and the gradient for the weighting function is ∇ [ k i , b i ] f θ ( y | x ) = [ x 1 ] w ( x ) i ∑ j w ( x ) j N ( y | μ j , I ) ( f i ( x ) − f θ ( y | x ) ) {\displaystyle \nabla _{[k_{i},b_{i}]}f_{\theta }(y|x)={\begin{bmatrix}x\\\1\end{bmatrix}}{\frac {w(x)_{i}}{\sum _{j}w(x)_{j}N(y|\mu _{j},I)}}(f_{i}(x)-f_{\theta }(y|x))}

For each input-output pair  ( x , y ) {\displaystyle (x,y)} , the weighting function is changed to increase the weight on all experts that performed above average, and decrease the weight on all experts that performed below average. This encourages the weighting function to learn to select only the experts that make the right predictions for each input.

The  i {\displaystyle i} -th expert is changed to make its prediction closer to  y {\displaystyle y} , but the amount of change is proportional to  w ( x ) i N ( y | μ i , I ) {\displaystyle w(x)_{i}N(y|\mu _{i},I)} . This has a Bayesian interpretation. Given input  x {\displaystyle x} , the prior probability that expert  i {\displaystyle i} is the right one is  w ( x ) i {\displaystyle w(x)_{i}} , and  N ( y | μ i , I ) {\displaystyle N(y|\mu _{i},I)} is the likelihood of evidence  y {\displaystyle y} . So,  w ( x ) i N ( y | μ i , I ) ∑ j w ( x ) j N ( y | μ j , I ) {\displaystyle {\frac {w(x)_{i}N(y|\mu _{i},I)}{\sum _{j}w(x)_{j}N(y|\mu _{j},I)}}} is the posterior probability for expert  i {\displaystyle i} , and so the rate of change for the  i {\displaystyle i} -th expert is proportional to its posterior probability.

In words, the experts that, in hindsight, seemed like the good experts to consult, are asked to learn on the example. The experts that, in hindsight, were not, are left alone.

The combined effect is that the experts become specialized: Suppose two experts are both good at predicting a certain kind of input, but one is slightly better, then the weighting function would eventually learn to favor the better one. After that happens, the lesser expert is unable to obtain a high gradient signal, and becomes even worse at predicting such kind of input. Conversely, the lesser expert can become better at predicting other kinds of input, and increasingly pulled away into another region. This has a positive feedback effect, causing each expert to move apart from the rest and take care of a local region alone (thus the name "local experts").

### Hierarchical MoE

[edit]

Hierarchical mixtures of experts[6][7] uses multiple levels of gating in a tree. Each gating is a probability distribution over the next level of gatings, and the experts are on the leaf nodes of the tree. They are similar to decision trees.

For example, a 2-level hierarchical MoE would have a first order gating function  w i {\displaystyle w_{i}} , and second order gating functions  w j | i {\displaystyle w_{j|i}} and experts  f j | i {\displaystyle f_{j|i}} . The total prediction is then  ∑ i w i ( x ) ∑ j w j | i ( x ) f j | i ( x ) {\displaystyle \sum _{i}w_{i}(x)\sum _{j}w_{j|i}(x)f_{j|i}(x)} .

### Variants

[edit]

The mixture of experts, being similar to the gaussian mixture model, can also be trained by the expectation-maximization algorithm, just like gaussian mixture models. Specifically, during the expectation step, the "burden" for explaining each data point is assigned over the experts, and during the maximization step, the experts are trained to improve the explanations they got a high burden for, while the gate is trained to improve its burden assignment. This can converge faster than gradient ascent on the log-likelihood.[7][8]

The choice of gating function is often a softmax gating. Other than that, [9] proposed using gaussian distributions, and [8] proposed using exponential families.

Instead of performing a weighted sum of all the experts, in hard MoE [10] only the highest ranked expert is chosen. That is,  f ( x ) = f arg ⁡ max i w i ( x ) ( x ) {\displaystyle f(x)=f_{\arg \max _{i}w_{i}(x)}(x)} . This can accelerate training and inference time.[11]

The experts can use more general forms of multivariant gaussian distributions. For example, [6] proposed  f i ( y | x ) = N ( y | A i x + b i , Σ i ) {\displaystyle f_{i}(y|x)=N(y|A_{i}x+b_{i},\Sigma _{i})} , where  A i , b i , Σ i {\displaystyle A_{i},b_{i},\Sigma _{i}} are learnable parameters. In words, each expert learns to do linear regression, with a learnable uncertainty estimate.

One can use different experts than gaussian distributions. For example, one can use Laplace distribution,[12] or Student's t-distribution.[13] For binary classification, it also proposed logistic regression experts, with f i ( y | x ) = { 1 1 + e β i T x + β i , 0 , y = 0 1 − 1 1 + e β i T x + β i , 0 , y = 1 {\displaystyle f_{i}(y|x)={\begin{cases}{\frac {1}{1+e^{\beta _{i}^{T}x+\beta _{i,0}}}},&y=0\\\1-{\frac {1}{1+e^{\beta _{i}^{T}x+\beta _{i,0}}}},&y=1\end{cases}}} where  β i , β i , 0 {\displaystyle \beta _{i},\beta _{i,0}} are learnable parameters. This is later generalized for multi-class classification, with multinomial logistic regression experts.[14]

## Deep learning

[edit]

The previous section described MoE as it was used before the era of deep learning. After deep learning, MoE found applications in running the largest models, as a simple way to perform conditional computation: only parts of the model are used, the parts chosen according to what the input is.[15]

The earliest paper that applies MoE to deep learning is "Learning Factored Representations in a Deep Mixture of Experts" (Eigen, Ranzato, Sutskever) [16] which proposes to use a different gating network at each layer in a deep neural network. Specifically, each gating is a linear-ReLU-linear-softmax network, and each expert is a linear-ReLU network.

The key design desideratum for MoE in deep learning is to reduce computing cost. Consequently, for each query, only a small subset of the experts should be queried. This makes MoE in deep learning different from classical MoE. In classical MoE, the output for each query is a weighted sum of all experts' outputs. In deep learning MoE, the output for each query can only involve a few experts' outputs. Consequently, the key design choice in MoE becomes routing: given a batch of queries, how to route the queries to the best experts.

### Sparsely-gated MoE layer

[edit]

The sparsely-gated MoE layer,[17] published by researchers from Google Brain, uses feedforward networks as experts, and linear-softmax gating. Similar to the previously proposed hard MoE, they achieve sparsity by a weighted sum of only the top-k experts, instead of the weighted sum of all of them. Specifically, in a MoE layer, there are feedforward networks f 1 , . . . , f n {\displaystyle f_{1},...,f_{n}} , and a gating network  w {\displaystyle w} . The gating network is defined by  w ( x ) = s o f t m a x ( t o p k ( W x + noise ) ) {\displaystyle w(x)=\mathrm {softmax} (\mathrm {top} _{k}(Wx+{\text{noise}}))} , where  t o p k {\displaystyle \mathrm {top} _{k}} is a function that keeps the top-k entries of a vector the same, but sets all other entries to  − ∞ {\displaystyle -\infty } . The addition of noise helps with load balancing.

The choice of  k {\displaystyle k} is a hyperparameter that is chosen according to application. Typical values are  k = 1 , 2 {\displaystyle k=1,2} . The  k = 1 {\displaystyle k=1} version is also called the Switch Transformer.[18]

As demonstration, they trained a series of models for machine translation with alternating layers of MoE and LSTM, and compared with deep LSTM models.[19] Table 3 shows that the MoE models used less inference time compute, despite having 30x more parameters.

Vanilla MoE tend to have issues of load balancing: some experts are consulted often, while other experts rarely or not at all. To encourage the gate to select each expert with equal frequency (proper load balancing) within each batch, each MoE layer has two auxiliary loss functions. This is improved by [18] into a single auxiliary loss function. Specifically, let  n {\displaystyle n} be the number of experts, then for a given batch of queries  { x 1 , x 2 , . . . , x T } {\displaystyle \\{x_{1},x_{2},...,x_{T}\\}} , the auxiliary loss for the batch is n ∑ i = 1 n f i P i {\displaystyle n\sum _{i=1}^{n}f_{i}P_{i}} Here,  f i = 1 T # ( queries sent to expert i ) {\displaystyle f_{i}={\frac {1}{T}}\\#({\text{queries sent to expert }}i)} is the fraction of time where expert  i {\displaystyle i} is ranked highest, and  P i = 1 T ∑ j = 1 T w i ( x j ) {\displaystyle P_{i}={\frac {1}{T}}\sum _{j=1}^{T}w_{i}(x_{j})} is the fraction of weight on expert  i {\displaystyle i} . This loss is minimized at  1 {\displaystyle 1} , precisely when every expert has equal weight  1 / n {\displaystyle 1/n} in all situations.

### Routing

[edit]

In sparsely-gated MoE, only the top-k experts are queried, and their outputs are weighted-summed. There are other methods.[20]

In Hash MoE,[21] routing is performed deterministically by a hash function, fixed before learning begins. For example, if the model is a 4-layered Transformer, and input is a token for word "eat", and the hash of "eat" is  ( 1 , 4 , 2 , 3 ) {\displaystyle (1,4,2,3)} , then the token would be routed to the 1st expert in layer 1, 4th expert in layer 2, etc. Despite its simplicity, it achieves competitive performance as sparsely gated MoE with  k = 1 {\displaystyle k=1} .

In soft MoE, suppose in each batch, each expert can process  p {\displaystyle p} queries, then there are  n × p {\displaystyle n\times p} queries that can be assigned per batch. Now for each batch of queries  { x 1 , x 2 , . . . , x T } {\displaystyle \\{x_{1},x_{2},...,x_{T}\\}} , the soft MoE layer computes an array  w i , j , k {\displaystyle w_{i,j,k}} , such that  ( w i , j , 1 , . . . , w i , j , T ) {\displaystyle (w_{i,j,1},...,w_{i,j,T})} is a probability distribution over queries, and the  i {\displaystyle i} -th expert's  j {\displaystyle j} -th query is  ∑ k w i , j , k x k {\displaystyle \sum _{k}w_{i,j,k}x_{k}} .[22] However, this does not work with autoregressive modelling, since the weights  w i , j , k {\displaystyle w_{i,j,k}} over one token depends on all other tokens'.[23]

Other approaches include solving it as a constrained linear programming problem,[24] making each expert choose the top-k queries it wants (instead of each query choosing the top-k experts for it),[25] using reinforcement learning to train the routing algorithm (since picking an expert is a discrete action, like in RL).[26]

### Capacity factor

[edit]

Suppose there are  n {\displaystyle n} experts in a layer. For a given batch of queries  { x 1 , x 2 , . . . , x T } {\displaystyle \\{x_{1},x_{2},...,x_{T}\\}} , each query is routed to one or more experts. For example, if each query is routed to one expert as in Switch Transformers, and if the experts are load-balanced, then each expert should expect on average  T / n {\displaystyle T/n} queries in a batch. In practice, the experts cannot expect perfect load balancing: in some batches, one expert might be underworked, while in other batches, it would be overworked.

Since the inputs cannot move through the layer until every expert in the layer has finished the queries it is assigned, load balancing is important. As a hard constraint on load balancing, there is the capacity factor: each expert is only allowed to process up to  c ⋅ T / n {\displaystyle c\cdot T/n} queries in a batch. [20] found  c ∈ [ 1.25 , 2 ] {\displaystyle c\in [1.25,2]} to work in practice.

### Applications to transformer models

[edit]

MoE layers are used in the largest transformer models, for which learning and inferring over the full model is too costly. They are typically sparsely-gated, with sparsity 1 or 2. In Transformer models, the MoE layers are often used to select the feedforward layers (typically a linear-ReLU-linear network), appearing in each Transformer block after the multiheaded attention. This is because the feedforward layers take up an increasing portion of the computing cost as models grow larger. For example, in the Palm-540B model, 90% of parameters are in its feedforward layers.[27]

As of 2023[update], models large enough to use MoE tend to be large language models, where each expert has on the order of 10 billion parameters. Other than language models, Vision MoE[28] is a Transformer model with MoE layers. They demonstrated it by training a model with 15 billion parameters.

A series of large language models from Google used MoE. GShard[29] uses MoE with up to top-2 experts per layer. Specifically, the top-1 expert is always selected, and the top-2th expert is selected with probability proportional to that experts' weight according to the gating function. Later, GLaM[30] demonstrated a language model with 1.2 trillion parameters, each MoE layer using top-2 out of 64 experts. Switch Transformers[18] use top-1 in all MoE layers.

The NLLB-200 by Meta AI is a machine translation model for 200 languages.[31] Each MoE layer uses a hierarchical MoE with two levels. On the first level, the gating function chooses to use either a "shared" feedforward layer, or to use the experts. If using the experts, then another gating function computes the weights and chooses the top-2 experts.[32]

MoE large language models can be adapted for downstream tasks by instruction tuning.[33]

In December 2023, Mistral AI released Mixtral 8x7B under Apache 2.0 license. It is a MoE language model with 46.7B parameters, 8 experts, and sparsity 2. They also released a version finetuned for instruction following.[34][35]

In March 2024, Databricks released DBRX. It is a MoE language model with 132B parameters, 16 experts, and sparsity 4. They also released a version finetuned for instruction following.[36][37]

## Further reading

[edit]

* Before deep learning era
* McLachlan, Geoffrey J.; Peel, David (2000). Finite mixture models. Wiley series in probability and statistics applied probability and statistics section. New York Chichester Weinheim Brisbane Singapore Toronto: John Wiley & Sons, Inc. ISBN 978-0-471-00626-8.
* Yuksel, S. E.; Wilson, J. N.; Gader, P. D. (August 2012). "Twenty Years of Mixture of Experts". IEEE Transactions on Neural Networks and Learning Systems. 23 (8): 1177–1193. doi:10.1109/TNNLS.2012.2200299. ISSN 2162-237X. PMID 24807516. S2CID 9922492.
* Masoudnia, Saeed; Ebrahimpour, Reza (12 May 2012). "Mixture of experts: a literature survey". Artificial Intelligence Review. 42 (2): 275–293. doi:10.1007/s10462-012-9338-y. S2CID 3185688.
* Nguyen, Hien D.; Chamroukhi, Faicel (July 2018). "Practical and theoretical aspects of mixture-of-experts modeling: An overview". WIREs Data Mining and Knowledge Discovery. 8 (4). doi:10.1002/widm.1246. ISSN 1942-4787. S2CID 49301452.
* Deep learning era
* Zoph, Barret; Bello, Irwan; Kumar, Sameer; Du, Nan; Huang, Yanping; Dean, Jeff; Shazeer, Noam; Fedus, William (2022). "ST-MoE: Designing Stable and Transferable Sparse Expert Models". arXiv:2202.08906 [cs.CL].

## See also

[edit]

* Product of experts
* Mixture models
* Mixture of gaussians
* Ensemble learning

## References

[edit]

1. ^ Baldacchino, Tara; Cross, Elizabeth J.; Worden, Keith; Rowson, Jennifer (2016). "Variational Bayesian mixture of experts models and sensitivity analysis for nonlinear dynamical systems". Mechanical Systems and Signal Processing. 66–67: 178–200. Bibcode:2016MSSP...66..178B. doi:10.1016/j.ymssp.2015.05.009.
2. ^ Hampshire, J.B.; Waibel, A. (July 1992). "The Meta-Pi network: building distributed knowledge representations for robust multisource pattern recognition" (PDF). IEEE Transactions on Pattern Analysis and Machine Intelligence. 14 (7): 751–769. doi:10.1109/34.142911.
3. ^ Alexander Waibel, Toshiyuki Hanazawa, Geoffrey Hinton, Kiyohiro Shikano, Kevin J. Lang (1995). "Phoneme Recognition Using Time-Delay Neural Networks*". In Chauvin, Yves; Rumelhart, David E. (eds.). Backpropagation. Psychology Press. doi:10.4324/9780203763247. ISBN 978-0-203-76324-7.`{{cite book}}`: CS1 maint: multiple names: authors list (link)
4. ^ Nowlan, Steven; Hinton, Geoffrey E (1990). "Evaluation of Adaptive Mixtures of Competing Experts". Advances in Neural Information Processing Systems. 3. Morgan-Kaufmann.
5. ^ Jacobs, Robert A.; Jordan, Michael I.; Nowlan, Steven J.; Hinton, Geoffrey E. (February 1991). "Adaptive Mixtures of Local Experts". Neural Computation. 3 (1): 79–87. doi:10.1162/neco.1991.3.1.79. ISSN 0899-7667. PMID 31141872. S2CID 572361.
6. ^ a b Jordan, Michael; Jacobs, Robert (1991). "Hierarchies of adaptive experts". Advances in Neural Information Processing Systems. 4. Morgan-Kaufmann.
7. ^ a b Jordan, Michael I.; Jacobs, Robert A. (March 1994). "Hierarchical Mixtures of Experts and the EM Algorithm". Neural Computation. 6 (2): 181–214. doi:10.1162/neco.1994.6.2.181. hdl:1721.1/7206. ISSN 0899-7667.
8. ^ a b Jordan, Michael I.; Xu, Lei (1995-01-01). "Convergence results for the EM approach to mixtures of experts architectures". Neural Networks. 8 (9): 1409–1431. doi:10.1016/0893-6080(95)00014-3. hdl:1721.1/6620. ISSN 0893-6080.
9. ^ Xu, Lei; Jordan, Michael; Hinton, Geoffrey E (1994). "An Alternative Model for Mixtures of Experts". Advances in Neural Information Processing Systems. 7. MIT Press.
10. ^ Collobert, Ronan; Bengio, Samy; Bengio, Yoshua (2001). "A Parallel Mixture of SVMs for Very Large Scale Problems". Advances in Neural Information Processing Systems. 14. MIT Press.
11. ^ Goodfellow, Ian; Bengio, Yoshua; Courville, Aaron (2016). "12: Applications". Deep learning. Adaptive computation and machine learning. Cambridge, Mass: The MIT press. ISBN 978-0-262-03561-3.
12. ^ Nguyen, Hien D.; McLachlan, Geoffrey J. (2016-01-01). "Laplace mixture of linear experts". Computational Statistics & Data Analysis. 93: 177–191. doi:10.1016/j.csda.2014.10.016. ISSN 0167-9473.
13. ^ Chamroukhi, F. (2016-07-01). "Robust mixture of experts modeling using the t distribution". Neural Networks. 79: 20–36. arXiv:1701.07429. doi:10.1016/j.neunet.2016.03.002. ISSN 0893-6080. PMID 27093693. S2CID 3171144.
14. ^ Chen, K.; Xu, L.; Chi, H. (1999-11-01). "Improved learning algorithms for mixture of experts in multiclass classification". Neural Networks. 12 (9): 1229–1252. doi:10.1016/S0893-6080(99)00043-X. ISSN 0893-6080. PMID 12662629.
15. ^ Bengio, Yoshua; Léonard, Nicholas; Courville, Aaron (2013). "Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computation". arXiv:1308.3432 [cs.LG].
16. ^ Eigen, David; Ranzato, Marc'Aurelio; Sutskever, Ilya (2013). "Learning Factored Representations in a Deep Mixture of Experts". arXiv:1312.4314 [cs.LG].
17. ^ Shazeer, Noam; Mirhoseini, Azalia; Maziarz, Krzysztof; Davis, Andy; Le, Quoc; Hinton, Geoffrey; Dean, Jeff (2017). "Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer". arXiv:1701.06538 [cs.LG].
18. ^ a b c Fedus, William; Zoph, Barret; Shazeer, Noam (2022-01-01). "Switch transformers: scaling to trillion parameter models with simple and efficient sparsity". The Journal of Machine Learning Research. 23 (1): 5232–5270. arXiv:2101.03961. ISSN 1532-4435.
19. ^ Wu, Yonghui; Schuster, Mike; Chen, Zhifeng; Le, Quoc V.; Norouzi, Mohammad; Macherey, Wolfgang; Krikun, Maxim; Cao, Yuan; Gao, Qin; Macherey, Klaus; Klingner, Jeff; Shah, Apurva; Johnson, Melvin; Liu, Xiaobing; Kaiser, Łukasz (2016). "Google's Neural Machine Translation System: Bridging the Gap between Human and Machine Translation". arXiv:1609.08144 [cs.CL].
20. ^ a b Zoph, Barret; Bello, Irwan; Kumar, Sameer; Du, Nan; Huang, Yanping; Dean, Jeff; Shazeer, Noam; Fedus, William (2022). "ST-MoE: Designing Stable and Transferable Sparse Expert Models". arXiv:2202.08906 [cs.CL].
21. ^ Roller, Stephen; Sukhbaatar, Sainbayar; szlam, arthur; Weston, Jason (2021). "Hash Layers For Large Sparse Models". Advances in Neural Information Processing Systems. 34. Curran Associates: 17555–17566. arXiv:2106.04426.
22. ^ Puigcerver, Joan; Riquelme, Carlos; Mustafa, Basil; Houlsby, Neil (2023). "From Sparse to Soft Mixtures of Experts". arXiv:2308.00951 [cs.LG].
23. ^ Wang, Phil (2023-10-04), lucidrains/soft-moe-pytorch, retrieved 2023-10-08
24. ^ Lewis, Mike; Bhosale, Shruti; Dettmers, Tim; Goyal, Naman; Zettlemoyer, Luke (2021-07-01). "BASE Layers: Simplifying Training of Large, Sparse Models". Proceedings of the 38th International Conference on Machine Learning. PMLR: 6265–6274. arXiv:2103.16716.
25. ^ Zhou, Yanqi; Lei, Tao; Liu, Hanxiao; Du, Nan; Huang, Yanping; Zhao, Vincent; Dai, Andrew M.; Chen, Zhifeng; Le, Quoc V.; Laudon, James (2022-12-06). "Mixture-of-Experts with Expert Choice Routing". Advances in Neural Information Processing Systems. 35: 7103–7114. arXiv:2202.09368.
26. ^ Bengio, Emmanuel; Bacon, Pierre-Luc; Pineau, Joelle; Precup, Doina (2015). "Conditional Computation in Neural Networks for faster models". arXiv:1511.06297 [cs.LG].
27. ^ "Transformer Deep Dive: Parameter Counting". Transformer Deep Dive: Parameter Counting. Retrieved 2023-10-10.
28. ^ Riquelme, Carlos; Puigcerver, Joan; Mustafa, Basil; Neumann, Maxim; Jenatton, Rodolphe; Susano Pinto, André; Keysers, Daniel; Houlsby, Neil (2021). "Scaling Vision with Sparse Mixture of Experts". Advances in Neural Information Processing Systems. 34: 8583–8595. arXiv:2106.05974.
29. ^ Lepikhin, Dmitry; Lee, HyoukJoong; Xu, Yuanzhong; Chen, Dehao; Firat, Orhan; Huang, Yanping; Krikun, Maxim; Shazeer, Noam; Chen, Zhifeng (2020). "GShard: Scaling Giant Models with Conditional Computation and Automatic Sharding". arXiv:2006.16668 [cs.CL].
30. ^ Du, Nan; Huang, Yanping; Dai, Andrew M.; Tong, Simon; Lepikhin, Dmitry; Xu, Yuanzhong; Krikun, Maxim; Zhou, Yanqi; Yu, Adams Wei; Firat, Orhan; Zoph, Barret; Fedus, Liam; Bosma, Maarten; Zhou, Zongwei; Wang, Tao (2021). "GLaM: Efficient Scaling of Language Models with Mixture-of-Experts". arXiv:2112.06905 [cs.CL].
31. ^ "200 languages within a single AI model: A breakthrough in high-quality machine translation". ai.facebook.com. 2022-06-19. Archived from the original on 2023-01-09.
32. ^ NLLB Team; Costa-jussà, Marta R.; Cross, James; Çelebi, Onur; Elbayad, Maha; Heafield, Kenneth; Heffernan, Kevin; Kalbassi, Elahe; Lam, Janice; Licht, Daniel; Maillard, Jean; Sun, Anna; Wang, Skyler; Wenzek, Guillaume; Youngblood, Al (2022). "No Language Left Behind: Scaling Human-Centered Machine Translation". arXiv:2207.04672 [cs.CL].
33. ^ Shen, Sheng; Hou, Le; Zhou, Yanqi; Du, Nan; Longpre, Shayne; Wei, Jason; Chung, Hyung Won; Zoph, Barret; Fedus, William; Chen, Xinyun; Vu, Tu; Wu, Yuexin; Chen, Wuyang; Webson, Albert; Li, Yunxuan (2023). "Mixture-of-Experts Meets Instruction Tuning:A Winning Combination for Large Language Models". arXiv:2305.14705 [cs.CL].
34. ^ AI, Mistral (2023-12-11). "Mixtral of experts". mistral.ai. Retrieved 2024-02-04.
35. ^ Jiang, Albert Q.; Sablayrolles, Alexandre; Roux, Antoine; Mensch, Arthur; Savary, Blanche; Bamford, Chris; Chaplot, Devendra Singh; Casas, Diego de las; Hanna, Emma Bou (2024-01-08), Mixtral of Experts, arXiv:2401.04088, retrieved 2024-02-04
36. ^ "Introducing DBRX: A New State-of-the-Art Open LLM". Databricks. 2024-03-27. Retrieved 2024-03-28.
37. ^ Knight, Will. "Inside the Creation of the World's Most Powerful Open Source AI Model". Wired. ISSN 1059-1028. Retrieved 2024-03-28.

*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template