विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| लॉन्गफ़ॉर्मर / बिगबर्ड× | XGBoost× | |
|---|---|---|
| क्षेत्र≠ | गहन अधिगम | मशीन अधिगम |
| परिवार | Machine learning | Machine learning |
| उद्भव वर्ष≠ | 2020 | 2016 |
| प्रवर्तक≠ | Beltagy, Peters & Cohan (Longformer); Zaheer et al. (BigBird) | Chen, T. & Guestrin, C. |
| प्रकार≠ | Sparse-attention Transformer for long sequences | Ensemble (gradient-boosted decision trees) |
| मौलिक स्रोत≠ | Beltagy, I., Peters, M. E. & Cohan, A. (2020). Longformer: The Long-Document Transformer. arXiv. link ↗ | Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794. DOI ↗ |
| उपनाम≠ | Uzun Dizi Transformer (Longformer / BigBird), uzun dizi transformer, long-document transformer, sparse-attention transformer | XGBoost, extreme gradient boosting, scalable tree boosting |
| संबंधित≠ | 4 | 5 |
| सारांश≠ | Long-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. | 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. |
| ScholarGateडेटासेट ↗ |
|
|