Oracling Reading Room
Read this room to do something
This is not a bibliography. It is a working route through the ideas required to build an Oracle that knows what it predicts, what it does not know, which candidates are admissible, which trade-offs remain, and what should happen next.
Start with the core route. Open the deeper shelves only when the current Oracle exposes a concrete failure: poor calibration, unknown feasibility, unstable trade-offs, redundant experiments, or a decision that should be deferred.
Core route: 90 minutes
| Order | Paper | Read for | Oracling output |
|---|---|---|---|
| 01 | On Calibration of Modern Neural Networks — Guo et al., 2017 | why confidence is not automatically probability | a calibration check per trait |
| 02 | Deep Ensembles — Lakshminarayanan et al., 2017 | a practical uncertainty baseline | predictive distributions, not isolated point estimates |
| 03 | Predictive Entropy Search with Unknown Constraints — Hernández-Lobato et al., 2015 | learning the optimum and feasibility together | an explicit unknown-constraint state |
| 04 | Differentiable Expected Hypervolume Improvement — Daulton et al., 2020 | choosing batches without collapsing objectives into one score | a Pareto-aware acquisition policy |
| 05 | Selective Classification for Deep Neural Networks — Geifman and El-Yaniv, 2017 | trading coverage for controlled risk | a principled review_required or abstain path |
After this route, write one page that names the traits, hard constraints, uncertainty representation, Pareto logic, and abstention rule of the Oracle. If any of those five fields is missing, the system is not decision-ready.
Shelf 01 — calibrated uncertainty
On Calibration of Modern Neural Networks
Paper and code references · Guo, Pleiss, Sun, and Weinberger · ICML 2017
Simple and Scalable Predictive Uncertainty Estimation using Deep Ensembles
Paper · Lakshminarayanan, Pritzel, and Blundell · NeurIPS 2017
Conformalized Quantile Regression
Paper · Romano, Patterson, and Candès · NeurIPS 2019
Simple and Principled Uncertainty Estimation with Deterministic Deep Learning via Distance Awareness
Paper · Liu et al. · NeurIPS 2020
Shelf 02 — constraints and feasibility
Predictive Entropy Search for Bayesian Optimization with Unknown Constraints
Paper · Hernández-Lobato et al. · ICML 2015
Scalable Constrained Bayesian Optimization
Paper · Eriksson and Poloczek · AISTATS 2021
Shelf 03 — Pareto decisions, not hidden scores
Differentiable Expected Hypervolume Improvement for Parallel Multi-Objective Bayesian Optimization
Paper · Daulton, Balandat, and Bakshy · NeurIPS 2020
Practical Bayesian Optimization of Machine Learning Algorithms
Paper · Snoek, Larochelle, and Adams · NeurIPS 2012
Shelf 04 — next experiment and model criticism
On the role of model uncertainties in Bayesian optimisation
Paper · Foldager et al. · UAI 2023
Active Learning Literature Survey
Survey · Burr Settles · 2009
Shelf 05 — abstention and human review
Selective Classification for Deep Neural Networks
Paper · Geifman and El-Yaniv · NeurIPS 2017
Reading-to-implementation map
| If the Oracle fails here | Read first | Implement or test next |
|---|---|---|
| confidence is unreliable | Guo et al.; Romano et al. | reliability diagram, expected calibration error, interval coverage by subgroup |
| uncertainty stays low out of domain | Deep Ensembles; Liu et al. | ensemble disagreement, distance-aware baseline, applicability stress test |
| feasibility is partly unknown | Hernández-Lobato et al.; Eriksson and Poloczek | explicit constraint models, unknown state, constrained acquisition |
| one score hides trade-offs | Daulton et al. | Pareto set, reference-point sensitivity, hypervolume contribution |
| proposed experiments are redundant | Settles; Foldager et al. | acquisition ablation, diversity constraint, information-value audit |
| the system should sometimes refuse | Geifman and El-Yaniv | abstention threshold, risk–coverage curve, review queue |
Reading discipline
Use the shared Evidence Reading Workflow to capture each paper, retain page-bound annotations, and publish only reviewed claims into the calyr.aí catalog.
For every paper adopted into the method catalog, record:
- the Oracle failure it is meant to address;
- its assumptions and the conditions under which they fail;
- the smallest reproducible baseline;
- the metric that would falsify its usefulness;
- the evidence level achieved by the local implementation;
- the exact decision contract field it changes.
Do not import a method because it is sophisticated. Import it only when it improves a traceable decision, detects a failure, or selects a more informative next action.
Boundaries that must stay visible
- prediction is not decision;
- confidence is not calibrated probability;
- uncertainty is not evidence;
- preference is not constraint;
- a Pareto set is not a single optimum;
- novelty is not information value;
- a proposed experiment is not a validated result;
- abstention is a valid output, not a system failure.
Return to the method
Apply these readings through the Oracling Method Contract. The contract defines what the Oracle must expose; this room explains why those fields and failure states exist.