Online learning algorithms
From MaRDI portal
Publication:2505654
DOI10.1007/s10208-004-0160-zzbMath1119.68098OpenAlexW1996652862MaRDI QIDQ2505654
Publication date: 28 September 2006
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10208-004-0160-z
Learning and adaptive systems in artificial intelligence (68T05) Stochastic approximation (62L20) Stochastic learning and adaptive control (93E35)
Related Items
Online regularized learning with pairwise loss functions ⋮ Online regression with unbounded sampling ⋮ LEAST SQUARE REGRESSION WITH COEFFICIENT REGULARIZATION BY GRADIENT DESCENT ⋮ Geometry on probability spaces ⋮ Fully online classification by regularization ⋮ Limited Stochastic Meta-Descent for Kernel-Based Online Learning ⋮ Online regularized pairwise learning with non-i.i.d. observations ⋮ Distributed regression learning with coefficient regularization ⋮ Rates of convergence of randomized Kaczmarz algorithms in Hilbert spaces ⋮ Differentially private SGD with non-smooth losses ⋮ Kernel-based online gradient descent using distributed approach ⋮ New Hilbert space tools for analysis of graph Laplacians and Markov processes ⋮ Conditional mean embedding and optimal feature selection via positive definite kernels ⋮ Convergence of online pairwise regression learning with quadratic loss ⋮ Learning theory viewpoint of approximation by positive linear operators ⋮ Convergence analysis of online learning algorithm with two-stage step size ⋮ Online learning for quantile regression and support vector regression ⋮ Online Pairwise Learning Algorithms ⋮ Analysis of Online Composite Mirror Descent Algorithm ⋮ LQG Online Learning ⋮ Convergence rate of kernel canonical correlation analysis ⋮ Convergence analysis of online algorithms ⋮ Unregularized online learning algorithms with general loss functions ⋮ Learning gradients by a gradient descent algorithm ⋮ Approximation analysis of gradient descent algorithm for bipartite ranking ⋮ Efficient and fast estimation of the geometric median in Hilbert spaces with an averaged stochastic gradient algorithm ⋮ Unnamed Item ⋮ Convergence of online mirror descent ⋮ Unregularized online algorithms with varying Gaussians ⋮ Online pairwise learning algorithms with convex loss functions ⋮ ONLINE LEARNING WITH MARKOV SAMPLING ⋮ Learning rates of gradient descent algorithm for classification ⋮ Fast and strong convergence of online learning algorithms ⋮ ONLINE REGRESSION WITH VARYING GAUSSIANS AND NON-IDENTICAL DISTRIBUTIONS ⋮ Online regularized generalized gradient classification algorithms ⋮ Unnamed Item ⋮ Gradient learning in a classification setting by gradient descent ⋮ Online Classification with Varying Gaussians ⋮ Iterative gradient descent for outlier detection
