An algorithmic theory of learning: robust concepts and random projection
From MaRDI portal
Publication:851862
DOI10.1007/s10994-006-6265-7zbMath1470.91218OpenAlexW1516726196MaRDI QIDQ851862
Santosh Vempala, Rosa I. Arriaga
Publication date: 22 November 2006
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-006-6265-7
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On learning a union of half spaces
- The Johnson-Lindenstrauss lemma and the sphericity of some graphs
- Geometric algorithms and combinatorial optimization
- A polynomial-time algorithm for learning noisy linear threshold functions
- Efficient distribution-free learning of probabilistic concepts
- The computational complexity of propositional STRIPS planning
- Boosting the margin: a new explanation for the effectiveness of voting methods
- The geometry of graphs and some of its algorithmic applications
- Support-vector networks
- Large margin classification using the perceptron algorithm
- An algorithmic theory of learning: Robust concepts and random projection
- A neuroidal architecture for cognitive computation
- Extensions of Lipschitz mappings into a Hilbert space
- Learnability and the Vapnik-Chervonenkis dimension
- A theory of the learnable
- Learning Theory
- 10.1162/153244303321897681
- Probability Inequalities for Sums of Bounded Random Variables
- Algorithmic Learning Theory
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- The Relaxation Method for Linear Inequalities
