arXiv (All)
open access
Efficient Robust Learning at the Information-Theoretic Limit
In an important recent work, Blanc (2026) gave an algorithm for robustly learning Boolean concept classes with respect to a fixed distribution that outputs a (randomized) classifier achieving the optimal error of $η+ \varepsilon$ where $η$ is the noise rate. In contrast, it is well known that determ
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
- Distributionally robust linear regression through the lens of adversarial training#1144416
- Sharp margin-based generalization bounds for realizable SVM#1011560
- Robust Privacy: Inference-Stage Privacy through Certified Robustness#617942
- Robust Privacy: Inference-Stage Privacy through Certified Robustness#617442
- Robust Utility Maximization with Intractable Claims under Distributional Ambiguity: A Random Distributionally Robust Optimization Approach#147121
Record · ID 1011384
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