Research map / Learning theory and algorithms / Prediction and decision losses
Simple Classification Using Binary Data
Deanna Needell, Rayan Saab, Tina Woolf
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| add more layers to the one-bit classifier (ablation) | One-bit layered classifier · Synthetic Gaussian clouds, complex geometries | classification rate | Improved |
| increase number of hyperplanes m | One-bit layered classifier · Synthetic six Gaussian clouds | classification rate | Improved |
| increase m to at least 150 | One-bit layered classifier · Extended YaleB | classification rate: above 95% for m >= 150 | Improved |
Closest papers by meaning
- The Computational Complexity of Concise Hypersphere Classification (ICML 2023 · similarity 0.84)
- Learning Optimal Classification Trees Using a Binary Linear Program Formulation (AAAI 2019 · similarity 0.82)
- Binary Classification from Positive-Confidence Data (NeurIPS 2018 · similarity 0.82)
- Optimal Binary Classification Beyond Accuracy (NeurIPS 2022 · similarity 0.82)
- Binary Classification with Karmic, Threshold-Quasi-Concave Metrics (ICML 2018 · similarity 0.82)
- Logarithmic Time One-Against-Some (ICML 2017 · similarity 0.82)
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.
