Simplified PAC-Bayesian margin bounds.
From MaRDI portal
Recommendations
Cited in
(24)- A theory of learning with similarity functions
- Tighter PAC-Bayes bounds through distribution-dependent priors
- A theory of learning from different domains
- Learning to classify with missing and corrupted features
- On PAC-Bayesian bounds for random forests
- Optimality of SVM: novel proofs and tighter bounds
- Learning a priori constrained weighted majority votes
- PAC-Bayes bounds for supervised classification
- Generalization Error in Deep Learning
- Data dependent priors in PAC-Bayes bounds
- Human action segmentation and recognition using discriminative semi-Markov models
- A PAC-Bayesian margin bound for linear classifiers
- Gradient methods never overfit on separable data
- On the proliferation of support vectors in high dimensions*
- Margin-based generalization for classifications with input noise
- PAC-Bayes bounds with data dependent priors
- On the VC dimension of bounded margin classifiers
- A tighter generalization bound for reservoir computing
- Erratum to: ``Risk bounds for the majority vote: from a PAC-Bayesian analysis to a learning algorithm
- New equivalences between interpolation and SVMs: kernels and structured features
- Tight PAC-Bayesian risk certificates for contrastive learning
- Comparison theorems for the minimum eigenvalue of a random positive-semidefinite matrix
- Learning-to-optimize with PAC-Bayesian guarantees: theoretical considerations and practical implementation
- Stochastic feature mapping for PAC-Bayes classification
This page was built for publication: Simplified PAC-Bayesian margin bounds.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5305852)
