方法对比

	胶囊网络	知识蒸馏	随机森林	支持向量机（分类）
领域	深度学习	深度学习	机器学习	机器学习
方法族	Machine learning	Machine learning	Machine learning	Machine learning
起源年份	2017	2015	2001	1995
提出者	Sabour, S., Frosst, N. & Hinton, G. E.	Hinton, G., Vinyals, O. & Dean, J.	Breiman, L.	Cortes, C. & Vapnik, V.
类型	Deep learning architecture (vector capsules with dynamic routing)	Neural network compression (teacher–student)	Ensemble (bagging of decision trees)	Maximum-margin classifier (kernel method)
开创性文献	Sabour, S., Frosst, N. & Hinton, G. E. (2017). Dynamic Routing Between Capsules. Advances in Neural Information Processing Systems (NeurIPS).	Hinton, G., Vinyals, O. & Dean, J. (2015). Distilling the Knowledge in a Neural Network. NeurIPS Deep Learning Workshop.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.	Cortes, C. & Vapnik, V. (1995). Support-Vector Networks. Machine Learning, 20, 273–297.
别名	Kapsül Ağı (CapsNet), CapsNet, capsule net, dynamic routing network	Bilgi Damıtma (Knowledge Distillation), bilgi damıtma, teacher-student distillation, model distillation	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble	Destek Vektör Makinesi (SVM — Sınıflandırma), support-vector network, SVM classifier, maximum-margin classifier
相关	4	5	4	5
摘要	A Capsule Network (CapsNet) is a deep learning architecture introduced by Sara Sabour, Nicholas Frosst and Geoffrey Hinton in 2017 that organises neurons as vectors (capsules) rather than scalar activations, so that spatial hierarchy and pose (orientation) information are encoded directly. It was proposed to overcome the fragility of convolutional networks to changes in viewpoint.	Knowledge Distillation is a model-compression technique, introduced by Geoffrey Hinton and colleagues in 2015, that trains a small student model using the soft-label outputs of a large teacher model. Distilled models such as DistilBERT and TinyBERT reach roughly 97% of the larger model's performance while running far faster.	Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.	The Support Vector Machine, introduced by Corinna Cortes and Vladimir Vapnik in 1995, is a classifier that finds the optimal separating hyperplane between classes in a high-dimensional space. It chooses the boundary that leaves the widest possible margin to the nearest training points, which makes its decisions robust on new data.