Robust Algorithms via PAC-Bayes and Laplace Distributions

DOI10.1007/978-3-319-21852-6_25zbMath1337.62114OpenAlexW2345062845MaRDI QIDQ2805741

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

Mathematics Subject Classification ID

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

Related Items (1)

Unnamed Item

Uses Software

• AdaBoost.MH

Cites Work

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

This page was built for publication: Robust Algorithms via PAC-Bayes and Laplace Distributions