On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes

DOI10.1016/j.tcs.2005.10.015zbMath1086.68115OpenAlexW2074760215MaRDI QIDQ817830

Jürgen Forster, Hans Ulrich Simon

Publication date: 20 March 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.10.015

zbMATH Keywords

matrix rigiditydimension boundslinear arrangementsmargin bounds

Mathematics Subject Classification ID

Computational learning theory (68Q32) Pattern recognition, speech recognition (68T10)

Related Items (4)

The unbounded-error communication complexity of symmetric functions ⋮ Sign rank versus Vapnik-Chervonenkis dimension ⋮ Unbounded-Error Classical and Quantum Communication Complexity ⋮ Learning Complexity vs Communication Complexity

Cites Work

• Probabilistic communication complexity
• The Johnson-Lindenstrauss lemma and the sphericity of some graphs
• Improved lower bounds on the rigidity of Hadamard matrices
• The variation of the spectrum of a normal matrix
• Extensions of Lipschitz mappings into a Hilbert space
• Matrix Analysis
• 10.1162/153244303321897681
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes