Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Învățare federată regularizată× | Învățare online× | |
|---|---|---|
| Domeniu | Învățare automată | Învățare automată |
| Familie | Machine learning | Machine learning |
| Anul apariției≠ | 2020 | 1958–2000s |
| Autorul original≠ | Li, T. et al. (FedProx); McMahan, B. et al. (FedAvg base) | Rosenblatt, F.; Littlestone, N.; Shalev-Shwartz, S. (key contributors) |
| Tip≠ | Distributed optimization with regularization | Learning paradigm (sequential model update) |
| Sursa seminală≠ | Li, T., Sahu, A. K., Zaheer, M., Sanjabi, M., Talwalkar, A., & Smith, V. (2020). Federated Optimization in Heterogeneous Networks. Proceedings of Machine Learning and Systems (MLSys), 2, 429–450. link ↗ | Shalev-Shwartz, S. (2011). Online Learning and Online Convex Optimization. Foundations and Trends in Machine Learning, 4(2), 107–194. DOI ↗ |
| Denumiri alternative | FedProx, federated learning with regularization, proximal federated learning, penalized federated optimization | incremental learning, sequential learning, streaming learning, online machine learning |
| Înrudite | 6 | 6 |
| Rezumat≠ | Regularized federated learning extends the federated learning framework by adding penalty terms to each client's local objective, anchoring local updates closer to the global model. The canonical formulation — FedProx — adds a proximal term that controls how far any single client can drift, improving convergence and stability when client data distributions differ substantially. | Online learning is a machine learning paradigm in which a model is updated incrementally as each new data point arrives, rather than being trained once on a fixed dataset. It is essential when data streams continuously, storage is limited, or the underlying distribution shifts over time. Theoretical performance is measured by cumulative regret relative to the best fixed predictor in hindsight. |
| ScholarGateSet de date ↗ |
|
|