Sample compression for real-valued learners
From MaRDI portal
Cites work
- A Real generalization of discrete AdaBoost
- A decision-theoretic generalization of on-line learning and an application to boosting
- A geometric approach to sample compression
- Adaptive game playing using multiplicative weights
- Balancing cyclic \(R\)-ary Gray codes
- Boosting methods for regression
- Boosting the margin: a new explanation for the effectiveness of voting methods
- Boosting. Foundations and algorithms.
- Bounds on the Number of Examples Needed for Learning Functions
- Combinatorial variability of Vapnik-Chervonenkis classes with applications to sample compression schemes
- Combinatorics of random processes and sections of convex bodies
- Computational limitations on learning from examples
- Convergence of stochastic processes
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- Density and dimension
- Efficient algorithms for learning functions with bounded variation
- Efficient Regression in Metric Spaces via Approximate Lipschitz Extension
- Ensemble approaches for regression: a survey
- Entropy and the combinatorial dimension
- Equivalence of models for polynomial learnability
- Externally definable sets and dependent pairs
- Greedy function approximation: A gradient boosting machine.
- scientific article; zbMATH DE number 3883309 (Why is no real title available?)
- scientific article; zbMATH DE number 67631 (Why is no real title available?)
- scientific article; zbMATH DE number 3446442 (Why is no real title available?)
- scientific article; zbMATH DE number 893887 (Why is no real title available?)
- Learnability and the Vapnik-Chervonenkis dimension
- Learning Integer Lattices
- Neural Network Learning
- On the existence of linear weak learners and applications to boosting
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- PAC-Bayesian compression bounds on the prediction error of learning algorithms for classification
- Probability Inequalities for Sums of Bounded Random Variables
- Robust regression by boosting the median.
- Sample Compression Schemes for VC Classes
- Scale-sensitive dimensions, uniform convergence, and learnability
- Shifting: one-inclusion mistake bounds and sample compression
- Teaching and Compressing for Low VC-Dimension
- Unlabeled compression schemes for maximum classes
- Valid Generalisation from Approximate Interpolation
This page was built for publication: Sample compression for real-valued learners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7034387)
