เปรียบเทียบวิธี

	โครงข่ายประสาทเทียมเชิงอนุพันธ์สามัญ (Neural ODE)	โครงข่ายประสาทเทียมแบบเวียนซ้ำ (Recurrent Neural Network - RNN)	XGBoost
สาขาวิชา	การเรียนรู้เชิงลึก	การเรียนรู้เชิงลึก	การเรียนรู้ของเครื่อง
ตระกูล	Machine learning	Machine learning	Machine learning
ปีกำเนิด	2018	1986–1990	2016
ผู้ริเริ่ม	Chen, T. Q. et al.	Rumelhart, D. E.; Elman, J. L.	Chen, T. & Guestrin, C.
ประเภท	Continuous-depth neural network (ODE-parameterised dynamics)	Sequential neural network	Ensemble (gradient-boosted decision trees)
แหล่งต้นตำรับ	Chen, T. Q., Rubanova, Y., Bettencourt, J. & Duvenaud, D. (2018). Neural Ordinary Differential Equations. Advances in Neural Information Processing Systems (NeurIPS).	Elman, J. L. (1990). Finding structure in time. Cognitive Science, 14(2), 179–211.	Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794.
ชื่อเรียกอื่น	Nöral Diferansiyel Denklem (Neural ODE), neural ordinary differential equation, continuous-depth network, ODE-Net	RNN, Elman network, Jordan network, simple recurrent network	XGBoost, extreme gradient boosting, scalable tree boosting
ที่เกี่ยวข้อง	4	3	5
สรุป	A Neural ODE, introduced by Chen and colleagues in 2018, models a hidden state as the continuous solution of an ordinary differential equation whose dynamics are parameterised by a neural network. It generalises the limiting case of residual connections, making it well suited to irregularly spaced time series and physics-based modelling.	A Recurrent Neural Network (RNN) is a class of neural network designed to process sequential data by maintaining a hidden state that carries information across time steps. Introduced in its modern form by Rumelhart et al. (1986) and further shaped by Elman (1990), RNNs became the dominant architecture for sequence modelling in NLP, speech, and time-series analysis before the rise of attention-based models.	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.