Online Learning as Stochastic Approximation of Regularization Paths: Optimality and Almost-Sure Convergence

DOI10.1109/TIT.2014.2332531MaRDI QIDQ2986183zbMATH OpenOpenAlexFDO

Authors Pierre Tarrès, Yuan Yao

Publication date 16 May 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2014.2332531

Mathematics Subject Classification ID

Nonparametric regression and quantile regression (62G08) Learning and adaptive systems in artificial intelligence (68T05) Stochastic approximation (62L20)

Cited in

(34)

• An analysis of stochastic variance reduced gradient for linear inverse problems ^*
• A loss bound model for on-line stochastic prediction algorithms
• Learning theory of randomized sparse Kaczmarz method
• Graph-dependent implicit regularisation for distributed stochastic subgradient descent
• Sequential quantile regression for stream data by least squares
• On the Convergence of Stochastic Gradient Descent for Nonlinear Ill-Posed Problems
• On the regularizing property of stochastic gradient descent
• Stochastic subspace correction in Hilbert space
• Fast and strong convergence of online learning algorithms
• A sieve stochastic gradient descent estimator for online nonparametric regression in Sobolev ellipsoids
• Analysis of Online Composite Mirror Descent Algorithm
• Online Proximal Learning Over Jointly Sparse Multitask Networks With $\ell _{\infty, 1}$ Regularization
• Concentration bounds for temporal difference learning with linear function approximation: the case of batch data and uniform sampling
• Convergence analysis of online algorithms for vector-valued kernel regression
• Online outcome weighted learning with general loss functions
• Online local learning via semidefinite programming
• Generalization properties of doubly stochastic learning algorithms
• Online sufficient dimension reduction through sliced inverse regression
• scientific article; zbMATH DE number 1569102 (Why is no real title available?)
• scientific article; zbMATH DE number 7306853 (Why is no real title available?)
• Convergence of unregularized online learning algorithms
• scientific article; zbMATH DE number 7370542 (Why is no real title available?)
• Scalable inference in functional linear regression with streaming data
• Convergence analysis of online learning algorithm with two-stage step size
• Online regularized learning algorithm for functional data
• Online Pairwise Learning Algorithms
• Online estimation with rolling validation: adaptive nonparametric estimation with streaming data
• Online learning algorithms tackling covariate shift
• Nonparametric stochastic approximation with large step-sizes
• Unregularized online learning algorithms with general loss functions
• Sparse online regression algorithm with insensitive loss functions
• scientific article; zbMATH DE number 6860836 (Why is no real title available?)
• Harder, Better, Faster, Stronger Convergence Rates for Least-Squares Regression
• An Online Projection Estimator for Nonparametric Regression in Reproducing Kernel Hilbert Spaces

This page was built for publication: Online Learning as Stochastic Approximation of Regularization Paths: Optimality and Almost-Sure Convergence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986183)