The robustness of the p-norm algorithms

DOI10.1023/A:1026319107706MaRDI QIDQ703062zbMATH OpenOpenAlexFDO

Authors Claudio Gentile

Publication date 19 January 2005

Published in Machine Learning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1026319107706

zbMATH Keywords

dual normslearning rateloss boundsOn-line learningon-line model selection

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Nonnumerical algorithms (68W05)

Recommendations

• Adaptive and self-confident on-line learning algorithms
• scientific article; zbMATH DE number 1950582
• On-line learning of linear functions
• Analysis of two gradient-based algorithms for on-line regression
• Scale-free algorithms for online linear optimization

Cited in

(20)

• Tracking the best hyperplane with a simple budget perceptron
• A primal-dual perspective of online learning algorithms
• Learning to assign degrees of belief in relational domains
• On-line learning of linear functions
• Exponential weight approachability, applications to calibration and regret minimization
• Applications of regularized least squares to pattern classification
• Robust Norm Equivalencies and Preconditioning
• Exploiting Cluster-Structure to Predict the Labeling of a Graph
• Adaptive regularization of weight vectors
• Adaptive and optimal online linear regression on ^1-balls
• scientific article; zbMATH DE number 1950582 (Why is no real title available?)
• A generalized online mirror descent with applications to classification and regression
• Implicit Regularization and Momentum Algorithms in Nonlinearly Parameterized Adaptive Control and Prediction
• Online learning based on online DCA and application to online classification
• Variance reduction on general adaptive stochastic mirror descent
• Optimistic optimisation of composite objective with exponentiated update
• Regret analysis of an online majorized semi-proximal ADMM for online composite optimization
• Statistical computational learning
• Exponentiated gradient meets gradient descent
• Possibility theoretic clustering and its preliminary application to large image segmentation

This page was built for publication: The robustness of the \(p\)-norm algorithms

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