Robustness and generalization
type: Item
instance of: scholarly article
title: Robustness and generalization
zbMATH Open document ID: 1242.68259
author: Huan Xu
author: Shie Mannor
published in: Machine Learning
publication date: 2012-05-23T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 62H30
Mathematics Subject Classification ID: 62G35
Mathematics Subject Classification ID: 62J07
zbMATH DE Number: 6037843
zbMATH Keywords: generalization bounds
zbMATH Keywords: robustness
zbMATH Keywords: non-IID sample
zbMATH Keywords: quantile loss
MaRDI profile type: Publication
full work available at URL: s10994-011-5268-1
OpenAlex ID: W1892947258
cites work: Scale-sensitive dimensions, uniform convergence, and learnability
cites work: The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network
cites work: 10.1162/153244303321897690
cites work: Local Rademacher complexities
cites work: Robust convex optimization
cites work: Robust solutions of uncertain linear programs
cites work: The Price of Robustness
cites work: 10.1162/153244302760200704
cites work: Theory of Classification: a Survey of Some Recent Advances
cites work: Distribution-free inequalities for the deleted and holdout error estimates
cites work: Distribution-free performance bounds for potential function rules
cites work: Q4881152
cites work: Q5822308
cites work: Extension of the PAC framework to finite and countable Markov chains
cites work: Hoeffding's inequality for uniformly ergodic Markov chains
cites work: Robust Statistics
cites work: Efficient distribution-free learning of probabilistic concepts
cites work: Learning halfspaces with malicious noise
cites work: Regression Quantiles
cites work: Rademacher penalties and structural risk minimization
cites work: Empirical margin distributions and bounding the generalization error of combined classifiers
cites work: A fast dual algorithm for kernel logistic regression
cites work: Q3496342
cites work: Markov chains and stochastic stability
cites work: Learning theory: stability is sufficient for generalization and necessary and sufficient for consistency of empirical risk minimization
cites work: Q4692741
cites work: Q3093392
cites work: Consistency of Support Vector Machines and Other Regularized Kernel Classifiers
cites work: Q4864293
cites work: Weak convergence and empirical processes. With applications to statistics
cites work: Q4770512
cites work: The Time Change Method and SDEs with Nonnegative Drift
cites work: Robustness and regularization of support vector machines
cites work: Robust Regression and Lasso
cites work: Consistency and localizability
cites work: The generalization performance of ERM algorithm with strongly mixing observations
DOI: 10.1007/S10994-011-5268-1
Recommended article: Robustifying learnability
Recommended article: 10.1162/153244302760200704
Recommended article: Robustness of general dichotomies
Recommended article: Robustness Theory and Application
Recommended article: Robustness and the robust estimate
Recommended article: Estimating robustness
Recommended article: Robustness, fidelity and prediction-looseness of models
Recommended article: Q4576293
Recommended article: Q4892247
description: scientific article; zbMATH DE number 6037843