방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 베이즈 가우시안 과정× | 베이지안 최적화× | |
|---|---|---|
| 분야≠ | 머신러닝 | 최적화 |
| 계열≠ | Machine learning | Process / pipeline |
| 기원 연도≠ | 1978–2006 | 1975 (foundational); 2012 (ML standard) |
| 창시자≠ | O'Hagan, A.; Neal, R. M.; Rasmussen, C. E. & Williams, C. K. I. | Mockus (1975); popularised for ML by Snoek, Larochelle & Adams (2012) |
| 유형≠ | Probabilistic kernel model | Sequential model-based black-box optimization |
| 원전≠ | Rasmussen, C. E., & Williams, C. K. I. (2006). Gaussian Processes for Machine Learning. MIT Press. ISBN: 978-0-262-18253-9 | Snoek, J., Larochelle, H., & Adams, R.P. (2012). Practical Bayesian Optimization of Machine Learning Algorithms. Advances in Neural Information Processing Systems (NeurIPS), 25. link ↗ |
| 별칭 | GP regression, GPR, Gaussian process model, GP classifier | Bayesçi Optimizasyon (Hyperparameter Tuning), surrogate-based optimization, sequential model-based optimization, SMBO |
| 관련≠ | 3 | 2 |
| 요약≠ | A Bayesian Gaussian Process (GP) places a probability distribution directly over functions, using a kernel to encode similarity between inputs. After observing data, Bayes' rule converts this prior into a posterior that yields not just point predictions but calibrated uncertainty estimates at every new input — making it one of the most principled probabilistic models in machine learning. | Bayesian Optimization is a sequential, model-based strategy for finding the optimum of expensive black-box functions with as few evaluations as possible. Rooted in the work of Mockus (1975) and brought to mainstream machine-learning practice by Snoek, Larochelle, and Adams (2012), it fits a probabilistic surrogate model — typically a Gaussian Process — to past observations and uses an acquisition function to decide where to probe next, balancing exploration of unknown regions with exploitation of promising ones. |
| ScholarGate데이터셋 ↗ |
|
|