arXiv (All)
open access
Finite-Query Coherent Projection of Black-Box Conditional Predictions
Local conditional predictions from a black box need not admit a common joint distribution. We study two aspects of their coherent projection: finite-access precision and directional fidelity. For arbitrary deterministic binary conditional tables, we establish matching expected minimax excess conditi
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
- Efficiently Listing Projected Trees, and Equivalence of Listing and Enumeration#259613
- Refinement as a Service: Algorithmic Predictor Refinement#1248695
- Representable but Unlearned: Encoding Rank and the Interaction-Prediction Floor#1131050
- Compressing Value Predictions for Learning-Augmented Metrical Task Systems#1118292
- Certifying fermionic Gaussian states (and a little more) with optimal precision dependence#1064777
Record · ID 1423499
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