Structure from Randomness in Halfspace Learning with the Zero-One Loss

DOI10.1613/jair.1.11506zbMath1496.68275OpenAlexW3105836885MaRDI QIDQ5139592

Robert J. Durrant, Ata Kabán

Publication date: 9 December 2020

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1613/jair.1.11506

zbMATH Keywords

machine learningknowledge discoverymathematical foundationsphilosophical foundations

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Uses Software

• UCI-ml

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Kernels as features: on kernels, margins, and low-dimensional mappings
• Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
• Boosting the margin: a new explanation for the effectiveness of voting methods
• Empirical margin distributions and bounding the generalization error of combined classifiers
• On the doubt about margin explanation of boosting
• An algorithmic theory of learning: Robust concepts and random projection
• Empirical processes and random projections
• Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach
• Extensions of Lipschitz mappings into a Hilbert space
• Theory of Classification: a Survey of Some Recent Advances
• On variants of the Johnson–Lindenstrauss lemma
• Bounds on the Number of Measurements for Reliable Compressive Classification
• High-Dimensional Probability
• An elementary proof of a theorem of Johnson and Lindenstrauss
• 10.1162/153244303321897690
• Living on the edge: phase transitions in convex programs with random data
• Explaining AdaBoost
• A Simple Tool for Bounding the Deviation of Random Matrices on Geometric Sets
• Compressed sensing

This page was built for publication: Structure from Randomness in Halfspace Learning with the Zero-One Loss