So sánh phương pháp

	Tối ưu hóa Gradient Ngẫu nhiên (Stochastic Gradient Descent - SGD)	Hồi quy Logistic	Rừng ngẫu nhiên
Lĩnh vực	Học máy	Thống kê nghiên cứu	Học máy
Họ	Machine learning	Process / pipeline	Machine learning
Năm ra đời	1951	1958	2001
Người khởi xướng	Robbins, H. & Monro, S.	David Roxbee Cox	Breiman, L.
Loại	First-order iterative optimization algorithm	Method	Ensemble (bagging of decision trees)
Công trình gốc	Robbins, H. & Monro, S. (1951). A Stochastic Approximation Method. The Annals of Mathematical Statistics, 22(3), 400–407.	Cox, D. R. (1958). The regression analysis of binary sequences. Journal of the Royal Statistical Society, Series B, 20(2), 215–242.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
Tên gọi khác	SGD, online gradient descent, incremental gradient descent, mini-batch gradient descent	logit model, binomial logistic regression, LR	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Liên quan	3	3	4
Tóm tắt	Stochastic Gradient Descent (SGD) is a first-order iterative optimization algorithm, rooted in the stochastic approximation framework introduced by Robbins and Monro in 1951, that minimizes an objective function by updating model parameters using the gradient computed on a single randomly selected training example (or a small mini-batch) at each step. It is the core optimization engine behind modern machine learning and deep learning, enabling the training of models on datasets too large to fit in memory.	Logistic regression is a statistical method for modeling the probability of a binary outcome (disease present/absent, success/failure) as a function of continuous and categorical predictors. Developed by David Roxbee Cox (1958), it solves the problem of predicting categorical outcomes by applying a logistic transformation to constrain predictions to the [0,1] probability interval, enabling accurate risk stratification, diagnostic prediction, and causal inference in epidemiology, medicine, and social science.	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.