REVIEW 2 cited by
Uncertainty Baselines: Benchmarks for Uncertainty & Robustness in Deep Learning
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
High-quality estimates of uncertainty and robustness are crucial for numerous real-world applications, especially for deep learning which underlies many deployed ML systems. The ability to compare techniques for improving these estimates is therefore very important for research and practice alike. Yet, competitive comparisons of methods are often lacking due to a range of reasons, including: compute availability for extensive tuning, incorporation of sufficiently many baselines, and concrete documentation for reproducibility. In this paper we introduce Uncertainty Baselines: high-quality implementations of standard and state-of-the-art deep learning methods on a variety of tasks. As of this writing, the collection spans 19 methods across 9 tasks, each with at least 5 metrics. Each baseline is a self-contained experiment pipeline with easily reusable and extendable components. Our goal is to provide immediate starting points for experimentation with new methods or applications. Additionally we provide model checkpoints, experiment outputs as Python notebooks, and leaderboards for comparing results. Code available at https://github.com/google/uncertainty-baselines.
Forward citations
Cited by 2 Pith papers
-
Constrained Co-Design for Photonic Bayesian Neural Networks
Photonic BNN inference is a constrained variational problem; most hardware limits are trainable through, but signed mean range and some scale bounds are hard representational limits that require hardware changes.
-
A Planning Framework for Adaptive Labeling
A planning framework for adaptive labeling where a smoothed auto-differential policy gradient (Smoothed-Autodiff) selects batches to minimize final posterior uncertainty, outperforming active-learning heuristics and R...
Discussion (0). Continue with ORCID to comment.