Online learning: A comprehensive survey

SCH Hoi, D Sahoo, J Lu, P Zhao - Neurocomputing, 2021 - Elsevier
Online learning represents a family of machine learning methods, where a learner attempts
to tackle some predictive (or any type of decision-making) task by learning from a sequence …

Machine learning for streaming data: state of the art, challenges, and opportunities

HM Gomes, J Read, A Bifet, JP Barddal… - ACM SIGKDD …, 2019 - dl.acm.org
Incremental learning, online learning, and data stream learning are terms commonly
associated with learning algorithms that update their models given a continuous influx of …

A survey of on-device machine learning: An algorithms and learning theory perspective

S Dhar, J Guo, J Liu, S Tripathi, U Kurup… - ACM Transactions on …, 2021 - dl.acm.org
The predominant paradigm for using machine learning models on a device is to train a
model in the cloud and perform inference using the trained model on the device. However …

Convergence rate of distributed ADMM over networks

A Makhdoumi, A Ozdaglar - IEEE Transactions on Automatic …, 2017 - ieeexplore.ieee.org
We propose a new distributed algorithm based on alternating direction method of multipliers
(ADMM) to minimize sum of locally known convex functions using communication over a …

Exact and stable covariance estimation from quadratic sampling via convex programming

Y Chen, Y Chi, AJ Goldsmith - IEEE Transactions on …, 2015 - ieeexplore.ieee.org
Statistical inference and information processing of high-dimensional data often require an
efficient and accurate estimation of their second-order statistics. With rapidly changing data …

The ideal continual learner: An agent that never forgets

L Peng, P Giampouras, R Vidal - … Conference on Machine …, 2023 - proceedings.mlr.press
The goal of continual learning is to find a model that solves multiple learning tasks which are
presented sequentially to the learner. A key challenge in this setting is that the learner may" …

The noisy power method: A meta algorithm with applications

M Hardt, E Price - Advances in neural information …, 2014 - proceedings.neurips.cc
We provide a new robust convergence analysis of the well-known power method for
computing the dominant singular vectors of a matrix that we call noisy power method. Our …

A stochastic PCA and SVD algorithm with an exponential convergence rate

O Shamir - International conference on machine learning, 2015 - proceedings.mlr.press
We describe and analyze a simple algorithm for principal component analysis and singular
value decomposition, VR-PCA, which uses computationally cheap stochastic iterations, yet …

Streaming pca: Matching matrix bernstein and near-optimal finite sample guarantees for oja's algorithm

P Jain, C **, SM Kakade… - … on learning theory, 2016 - proceedings.mlr.press
In this paper we provide improved guarantees for streaming principal component analysis
(PCA). Given A_1,\ldots, A_n∈\mathbbR^ d\times d sampled independently from …

Federated principal component analysis

A Grammenos, R Mendoza Smith… - Advances in neural …, 2020 - proceedings.neurips.cc
We present a federated, asynchronous, and $(\varepsilon,\delta) $-differentially private
algorithm for $\PCA $ in the memory-limited setting.% Our algorithm incrementally computes …