arXiv (All)
open access
Extreme classification: beating chance with one training example from each class
We study a minimal classification problem: Given independent labeled observations $X\sim P$ and $Z\sim Q$ from two unknown distributions $P,Q$, and given an independent target $Y$ drawn with equal probability from $P$ or $Q$, can one classify $Y$ strictly better than chance whenever $P\neq Q$? The o
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Three Conjectures on Binary Channels for the Doubly Symmetric Binary Source#1064535
- Streaming algorithms for robust max-min diversification#1156728
- Strong Duality in Risk-Constrained Nonconvex Functional Programming#1014439
- Some Ontological Remarks on the Maxim of Identification of Indiscernibles#774611
- Sharp spectral norm concentration of sparse random tensors#1034336
Record · ID 1034871
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive