ScholarGate
Asistent

Compară metode

Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.

Amestec de Experți×Rețeaua de Atenție Grafică×XGBoost×
DomeniuÎnvățare profundăÎnvățare profundăÎnvățare automată
FamilieMachine learningMachine learningMachine learning
Anul apariției201720182016
Autorul originalShazeer, N. et al.Veličković, P. et al.Chen, T. & Guestrin, C.
TipSparse neural network architecture (conditional computation)Graph neural network (attention-based)Ensemble (gradient-boosted decision trees)
Sursa seminalăShazeer, N. et al. (2017). Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer. ICLR. arXiv:1701.06538 link ↗Veličković, P. et al. (2018). Graph Attention Networks. ICLR. link ↗Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794. DOI ↗
Denumiri alternativeUzman Karışımı (Mixture of Experts — MoE), uzman karışımı, MoE, sparse mixture of expertsGraf Dikkat Ağı (GAT), GAT, graph attention network, attention-based graph neural networkXGBoost, extreme gradient boosting, scalable tree boosting
Înrudite345
RezumatMixture of Experts (MoE) is a sparse neural-network architecture, introduced by Shazeer and colleagues in 2017 with the sparsely-gated MoE layer, in which only a subset of expert sub-networks is activated for each input. As seen in models such as Switch Transformer and Mixtral, it holds computation cost fixed even as the total parameter count grows.The Graph Attention Network (GAT), introduced by Veličković and colleagues in 2018, is a graph neural network variant that learns how much importance to assign to each neighbouring node through a self-attention mechanism. On heterogeneous neighbourhoods and relational classification it produces results superior to graph convolutional networks (GCN).XGBoost (Extreme Gradient Boosting) is a scalable tree-boosting algorithm introduced by Tianqi Chen and Carlos Guestrin in 2016. It builds a strong predictor by adding decision trees one at a time, each correcting the errors left by the trees before it, and is a powerful prediction method widely used in competitions.
ScholarGateSet de date
  1. v1
  2. 2 Surse
  3. PUBLISHED
  1. v1
  2. 2 Surse
  3. PUBLISHED
  1. v1
  2. 1 Surse
  3. PUBLISHED

Mergi la căutare Descarcă prezentarea

ScholarGateCompară metode: Mixture of Experts · Graph Attention Network · XGBoost. Preluat la 2026-06-19 de pe https://scholargate.app/ro/compare