A PAC-Bayesian margin bound for linear classifiers

From MaRDI portal
Publication:4677637

DOI10.1109/TIT.2002.805090zbMath1063.62092MaRDI QIDQ4677637

Ralf Herbrich, Thore Graepel

Publication date: 11 May 2005

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




Related Items

CORRELATION-BASED MULTIDIMENSIONAL SCALING FOR UNSUPERVISED SUBSPACE LEARNINGThe new interpretation of support vector machines on statistical learning theory1-bit matrix completion: PAC-Bayesian analysis of a variational approximationInvariant kernel functions for pattern analysis and machine learningKernels as features: on kernels, margins, and low-dimensional mappingsBayesian Classification of Tumours by Using Gene Expression DataBinet-Cauchy kernels on dynamical systems and its application to the analysis of dynamic scenesIncremental learning algorithm for large-scale semi-supervised ordinal regressionMaximizing upgrading and downgrading margins for ordinal regressionA reduced-rank approach to predicting multiple binary responses through machine learningPAC-Bayesian framework based drop-path method for 2D discriminative convolutional network pruningUser-friendly Introduction to PAC-Bayes BoundsNew and efficient DCA based algorithms for minimum sum-of-squares clusteringThe \(K\)-armed dueling bandits problemSupport vector machines with applicationsKernel methods in machine learningOn the rate of convergence for multi-category classification based on convex lossesA one-dimensional analysis for the probability of error of linear classifiers for normally distributed classesPAC-Bayesian compression bounds on the prediction error of learning algorithms for classificationPAC-Bayesian compression bounds on the prediction error of learning algorithms for classificationRobust Algorithms via PAC-Bayes and Laplace DistributionsA theory of learning with similarity functions