Online Regularized Classification Algorithms

DOI10.1109/TIT.2006.883632MaRDI QIDQ3548086zbMATH OpenDBLPWikidataFDO

Authors Yiming Ying, Ding-Xuan Zhou

Publication date 21 December 2008

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

Full work available at URL https://doi.org/10.1109/TIT.2006.883632

Mathematics Subject Classification ID

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

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

Cited in

(64)

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

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)