방법 비교

	확률적 경사 하강법(Stochastic Gradient Descent, SGD)	랜덤 포레스트
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	1951	2001
창시자	Robbins, H. & Monro, S.	Breiman, L.
유형	First-order iterative optimization algorithm	Ensemble (bagging of decision trees)
원전	Robbins, H. & Monro, S. (1951). A Stochastic Approximation Method. The Annals of Mathematical Statistics, 22(3), 400–407.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
별칭	SGD, online gradient descent, incremental gradient descent, mini-batch gradient descent	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
관련	3	4
요약	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.	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.