On the perceptron's compression
From MaRDI portal
Publication:2106618
DOI10.1007/978-3-030-51466-2_29OpenAlexW3037931094MaRDI QIDQ2106618
Ido Nachum, Amir Yehudayoff, Itai Panasoff, Shay Moran
Publication date: 16 December 2022
Full work available at URL: https://arxiv.org/abs/1806.05403
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pegasos: primal estimated sub-gradient solver for SVM
- Boosting the margin: a new explanation for the effectiveness of voting methods
- Boosting a weak learning algorithm by majority
- Large margin classification using the perceptron algorithm
- An algorithmic theory of learning: Robust concepts and random projection
- 10.1162/15324430260185600
- Sample Compression Schemes for VC Classes
- Extensions of Lipschitz mappings into a Hilbert space
- On variants of the Johnson–Lindenstrauss lemma
- On the Generalization Ability of On-Line Learning Algorithms
- Learning the unlearnable
- Learning Theory
- 10.1162/153244303321897681
- Algorithmic Learning Theory
- Understanding Machine Learning
- PAC-Bayesian compression bounds on the prediction error of learning algorithms for classification
This page was built for publication: On the perceptron's compression
