Large-width bounds for learning half-spaces on distance spaces
From MaRDI portal
(Redirected from Publication:1752445)
Recommendations
- Learning half-spaces on general infinite spaces equipped with a distance function
- Large width nearest prototype classification on general distance spaces
- Learning bounds via sample width for classifiers on finite metric spaces
- Using the doubling dimension to analyze the generalization of learning algorithms
- Learning by distances
Cites work
- 10.1162/153244303321897690
- A hybrid classifier based on boxes and nearest neighbors
- A probabilistic approach to case-based inference
- Encyclopedia of Distances
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- Learnability and the Vapnik-Chervonenkis dimension
- Learning bounds via sample width for classifiers on finite metric spaces
- Maximal margin classification for metric spaces
- Multi-category classifiers and sample width
- Nearly optimal classification for semimetrics
- Neural Network Learning
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
Cited in
(9)- Halfspace learning, linear programming, and nonmalicious distributions
- Estimating the optimal margins of embeddings in Euclidean half spaces
- Large width nearest prototype classification on general distance spaces
- Primal and dual combinatorial dimensions
- Learning bounds via sample width for classifiers on finite metric spaces
- Learning half-spaces on general infinite spaces equipped with a distance function
- A Uniform Lower Error Bound for Half-Space Learning
- Nearly optimal classification for semimetrics
- Using the doubling dimension to analyze the generalization of learning algorithms
This page was built for publication: Large-width bounds for learning half-spaces on distance spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1752445)
