Online Regularized Classification Algorithms

DOI10.1109/TIT.2006.883632zbMATH Open1323.68450DBLPjournals/tit/YingZ06WikidataQ58759035 ScholiaQ58759035MaRDI QIDQ3548086FDOQ3548086

Authors: Yiming Ying, Ding-Xuan Zhou 

Publication date: 21 December 2008

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

Recommendations

• Online regularized generalized gradient classification algorithms
• Fully online classification by regularization
• Convergence analysis of online algorithms
• Online gradient descent learning algorithms
• Unregularized online learning algorithms with general loss functions

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Cited In (61)

• Convergence analysis for kernel-regularized online regression associated with an RRKHS
• Online regularized learning algorithm for functional data
• High probability bounds on AdaGrad for constrained weakly convex optimization
• Sparse online regression algorithm with insensitive loss functions
• Differentially private SGD with random features
• Hybrid learning based on Fisher linear discriminant
• On the Generalization Ability of On-Line Learning Algorithms
• Online regularized generalized gradient classification algorithms
• Online pairwise learning algorithms with convex loss functions
• Online regularized learning with pairwise loss functions
• Title not available (Why is that?)
• Learning theory of randomized sparse Kaczmarz method
• Generalization performance of Lagrangian support vector machine based on Markov sampling
• Kernel gradient descent algorithm for information theoretic learning
• Online learning for quantile regression and support vector regression
• Online regression with varying Gaussians and non-identical distributions
• Convergence of online mirror descent
• Learning gradients by a gradient descent algorithm
• General algorithmic frameworks for online problems
• Fast and strong convergence of online learning algorithms
• Online classification with varying Gaussians
• Learning noisy linear classifiers via adaptive and selective sampling
• Title not available (Why is that?)
• Analysis of Online Composite Mirror Descent Algorithm
• 10.1162/jmlr.2003.3.4-5.951
• Online learning algorithms
• Kernel-based online regression with canal loss
• Reproducing kernel Hilbert spaces associated with analytic translation-invariant Mercer kernels
• Convergence analysis of online algorithms
• Adaptive regularization of weight vectors
• Distributed regression learning with coefficient regularization
• Convergence of unregularized online learning algorithms
• Step size adaptation in reproducing kernel Hilbert space
• Approximation analysis of gradient descent algorithm for bipartite ranking
• Title not available (Why is that?)
• ONLINE LEARNING WITH MARKOV SAMPLING
• Unregularized online algorithms with varying Gaussians
• Online gradient descent learning algorithms
• Learning rates of gradient descent algorithm for classification
• Learning gradients via an early stopping gradient descent method
• Stability and optimization error of stochastic gradient descent for pairwise learning
• Online regularized pairwise learning with least squares loss
• Least square regression with coefficient regularization by gradient descent
• Convergence of online pairwise regression learning with quadratic loss
• Convergence analysis of online learning algorithm with two-stage step size
• Online Pairwise Learning Algorithms
• Kernel-based online gradient descent using distributed approach
• Title not available (Why is that?)
• Parsimonious online learning with kernels via sparse projections in function space
• Gradient learning in a classification setting by gradient descent
• Online logistic regression
• Online regularized pairwise learning with non-i.i.d. observations
• Unregularized online learning algorithms with general loss functions
• Title not available (Why is that?)
• Rates of convergence of randomized Kaczmarz algorithms in Hilbert spaces
• Stochastic AUC optimization with general loss
• Fully online classification by regularization
• Online regression with unbounded sampling
• Iterative gradient descent for outlier detection
• Title not available (Why is that?)
• Learning Theory

This page was built for publication: Online Regularized Classification Algorithms

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