ScholarGate
Asistent

Uporedite metode

Pregledajte izabrane metode jednu pored druge; redovi koji se razlikuju su istaknuti.

Longformer / BigBird×Mešavina eksperata×XGBoost×
OblastDuboko učenjeDuboko učenjeMašinsko učenje
PorodicaMachine learningMachine learningMachine learning
Godina nastanka202020172016
TvoracBeltagy, Peters & Cohan (Longformer); Zaheer et al. (BigBird)Shazeer, N. et al.Chen, T. & Guestrin, C.
TipSparse-attention Transformer for long sequencesSparse neural network architecture (conditional computation)Ensemble (gradient-boosted decision trees)
Temeljni izvorBeltagy, I., Peters, M. E. & Cohan, A. (2020). Longformer: The Long-Document Transformer. arXiv. link ↗Shazeer, N. et al. (2017). Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer. ICLR. arXiv:1701.06538 link ↗Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794. DOI ↗
Drugi naziviUzun Dizi Transformer (Longformer / BigBird), uzun dizi transformer, long-document transformer, sparse-attention transformerUzman Karışımı (Mixture of Experts — MoE), uzman karışımı, MoE, sparse mixture of expertsXGBoost, extreme gradient boosting, scalable tree boosting
Srodne435
SažetakLong-sequence Transformers such as Longformer (Beltagy, Peters & Cohan, 2020) and BigBird (Zaheer et al., 2020) replace the standard Transformer's O(n²) attention with sparse attention patterns that scale linearly, O(n), with sequence length. This lets a single model attend over thousands of tokens — full documents, legal texts, or genomic sequences — that would not fit a conventional Transformer.Mixture 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.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.
ScholarGateSkup podataka
  1. v1
  2. 2 Izvori
  3. PUBLISHED
  1. v1
  2. 2 Izvori
  3. PUBLISHED
  1. v1
  2. 1 Izvori
  3. PUBLISHED

Idi na pretragu Preuzmi slajdove

ScholarGateUporedite metode: Longformer / BigBird · Mixture of Experts · XGBoost. Preuzeto 2026-06-20 sa https://scholargate.app/sr/compare