Comparer des méthodes
Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.
| Word2Vec semi-supervisé× | Apprentissage par transfert avec Word2Vec× | |
|---|---|---|
| Domaine | Apprentissage profond | Apprentissage profond |
| Famille | Machine learning | Machine learning |
| Année d'origine≠ | 2013–2015 | 2013-2014 |
| Auteur d'origine≠ | Mikolov, T. et al. (Word2Vec); semi-supervised framing via Collobert & Weston and subsequent NLP literature | Mikolov, T. et al. (Word2Vec); transfer-learning application popularised by Kim, Y. |
| Type≠ | Semi-supervised representation learning | Transfer learning / embedding initialization |
| Source fondatrice≠ | Mikolov, T., Chen, K., Corrado, G., & Dean, J. (2013). Efficient Estimation of Word Representations in Vector Space. In Proceedings of ICLR 2013. link ↗ | Mikolov, T., Sutskever, I., Chen, K., Corrado, G. S., & Dean, J. (2013). Distributed representations of words and phrases and their compositionality. Advances in Neural Information Processing Systems (NIPS), 26, 3111-3119. link ↗ |
| Alias | Word2Vec with semi-supervised learning, semi-supervised word embeddings, Word2Vec SSL, unsupervised pretraining with Word2Vec | Word2Vec transfer learning, pre-trained Word2Vec embeddings, Word2Vec embedding initialization, Word2Vec fine-tuning |
| Apparentées≠ | 6 | 5 |
| Résumé≠ | Semi-supervised Word2Vec trains dense word representations on a large unlabeled corpus using Word2Vec (skip-gram or CBOW), then uses those embeddings as fixed or fine-tunable input features for a downstream classifier trained on a small labeled dataset. This two-stage process lets models benefit from abundant unlabeled text when labeled data is scarce. | Transfer Learning with Word2Vec uses word embeddings pre-trained on large text corpora via the Skip-gram or CBOW objectives introduced by Mikolov et al. (2013) to initialize the embedding layer of a downstream NLP model. This approach transfers distributional semantic knowledge to tasks where labeled data is scarce, consistently outperforming random initialization. |
| ScholarGateJeu de données ↗ |
|
|