Research map / Learning theory and algorithms / Prediction and decision losses
The Computational Complexity of Concise Hypersphere Classification
Eduard Eiben, Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Deep Orthogonal Hypersphere Compression for Anomaly Detection (ICLR 2024 · similarity 0.83)
- Classification Fields: Arbitrarily Fine Recursive Hierarchical Clustering From Few Examples (NeurIPS 2026 · similarity 0.82)
- How to Learn a Star: Binary Classification with Starshaped Polyhedral Sets (NeurIPS 2025 · similarity 0.82)
- On Rate-Optimal Partitioning Classification from Observable and from Privatised Data (NeurIPS 2026 · similarity 0.81)
- Bridging the Gap Between Hyperdimensional Computing and Kernel Methods via the Nyström Method (AAAI 2025 · similarity 0.81)
- No Dimensional Sampling Coresets for Classification (ICML 2024 · similarity 0.81)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
