Robust algorithms via PAC-Bayes and Laplace distributions

DOI10.1007/978-3-319-21852-6_25zbMATH Open1337.62114OpenAlexW2345062845MaRDI QIDQ2805741FDOQ2805741

Authors: Asaf Noy, Koby Crammer 

Publication date: 13 May 2016

Published in: Measures of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21852-6_25

Recommendations

• 10.1162/153244304773936072
• scientific article; zbMATH DE number 1804119
• scientific article; zbMATH DE number 1931845
• Random classification noise defeats all convex potential boosters
• Robustness and generalization

Mathematics Subject Classification ID

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

Cites Work

• 10.1162/153244303765208377
• Robust Estimation of a Location Parameter
• Improved boosting algorithms using confidence-rated predictions
• Title not available (Why is that?)
• An $\ell _{1}$-Laplace Robust Kalman Smoother
• Logistic regression, AdaBoost and Bregman distances
• Random classification noise defeats all convex potential boosters
• PAC-Bayesian stochastic model selection
• A PAC-Bayesian margin bound for linear classifiers

Cited In (1)

• Title not available (Why is that?)

Uses Software

• AdaBoost.MH

This page was built for publication: Robust algorithms via PAC-Bayes and Laplace distributions

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