So sánh phương pháp
Xem các phương pháp đã chọn cạnh nhau; những hàng khác biệt được làm nổi bật.
| Học trực tuyến có điều chuẩn× | Hồi quy Logistic Chính quy× | |
|---|---|---|
| Lĩnh vực | Học máy | Học máy |
| Họ | Machine learning | Machine learning |
| Năm ra đời≠ | 2007–2013 | 1996–2005 |
| Người khởi xướng≠ | Xiao, L.; Shalev-Shwartz, S.; McMahan, H. B. et al. | Tibshirani, R. (lasso); Hoerl & Kennard (ridge); Zou & Hastie (elastic net) |
| Loại≠ | Online optimization framework with regularization | Penalized classification model |
| Công trình gốc≠ | Xiao, L. (2010). Dual Averaging Methods for Regularized Stochastic and Online Optimization. Journal of Machine Learning Research, 11, 2543–2596. link ↗ | Tibshirani, R. (1996). Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society: Series B, 58(1), 267–288. DOI ↗ |
| Tên gọi khác | FTRL, Follow-the-Regularized-Leader, online regularized optimization, regularized dual averaging | penalized logistic regression, L1 logistic regression, L2 logistic regression, elastic net logistic regression |
| Liên quan≠ | 6 | 5 |
| Tóm tắt≠ | Regularized online learning extends the online learning paradigm by incorporating a regularization penalty into each weight update, controlling model complexity while processing data one example at a time. Algorithms such as Follow-the-Regularized-Leader (FTRL) and Regularized Dual Averaging (RDA) make this approach practical at scale, enabling sparse, well-calibrated models on streaming data. | Regularized logistic regression extends standard logistic regression by adding an L1 (lasso), L2 (ridge), or elastic net penalty to the log-likelihood, shrinking coefficients toward zero and preventing overfitting. It is the default choice for binary or multinomial classification when you want interpretable, sparse, or stable coefficient estimates in high-dimensional or collinear feature spaces. |
| ScholarGateBộ dữ liệu ↗ |
|
|