Regularized Online Learning
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.
Source record
Citations copied verbatim from the method’s source record. No claim-level verification is inferred from them.
- Xiao, L. (2010). Dual Averaging Methods for Regularized Stochastic and Online Optimization. Journal of Machine Learning Research, 11, 2543–2596. · URL
- Shalev-Shwartz, S. (2012). Online Learning and Online Convex Optimization. Foundations and Trends in Machine Learning, 4(2), 107–194. · DOI 10.1561/2200000018
Curated claims
Claims persisted in the evidence ledger, each with its own assessment.
This view does not invent a claim assessment when the ledger has none.
Related methods
Generated from the method graph and shown as machine-suggested relations — no evidence claim is inferred.