On Complexity Issues of Online Learning Algorithms
From MaRDI portal
Publication:5281195
DOI10.1109/TIT.2010.2079010zbMath1368.68288MaRDI QIDQ5281195
Publication date: 27 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2010.2079010
68T05: Learning and adaptive systems in artificial intelligence
62L20: Stochastic approximation
68W27: Online algorithms; streaming algorithms
Related Items
Unnamed Item, ERM scheme for quantile regression, Approximation analysis of learning algorithms for support vector regression and quantile regression, Online learning for quantile regression and support vector regression, Logistic classification with varying gaussians, Concentration estimates for learning with \(\ell ^{1}\)-regularizer and data dependent hypothesis spaces, Learning with varying insensitive loss, Derivative reproducing properties for kernel methods in learning theory, Conditional quantiles with varying Gaussians, Rates of convergence of randomized Kaczmarz algorithms in Hilbert spaces, Convergence of online mirror descent, Fast and strong convergence of online learning algorithms, On grouping effect of elastic net