An approach to one-bit compressed sensing based on probably approximately correct learning theory

Keyphrases

• Learning Theory 100%
• Probably Approximately Correct Learning 100%
• One-bit Compressed Sensing 100%
• Sparse Vector 50%
• Half-space 50%
• Vapnik-Chervonenkis Dimension 50%
• Separating Hyperplane 25%
• Consistent Algorithm 25%
• Statistical Complexity 25%
• Algorithmic Complexity 25%

Mathematics

• Half Space 100%
• Vapnik-Chervonenkis Dimension 100%
• Lower and upper bounds 50%
• Algorithmic Complexity 50%
• Even Vector 50%
• Hyperplane 50%

Engineering

• Hyperplane 25%