Pith. sign in

REVIEW 4 cited by

Deep Deterministic Uncertainty: A Simple Baseline

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

arxiv 2102.11582 v3 pith:O6VXVOU7 submitted 2021-02-23 cs.LG stat.ML

classification cs.LGstat.ML
keywords uncertaintydeepdeterministicsimplebaselinecomplexcomputationallyepistemic
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Reliable uncertainty from deterministic single-forward pass models is sought after because conventional methods of uncertainty quantification are computationally expensive. We take two complex single-forward-pass uncertainty approaches, DUQ and SNGP, and examine whether they mainly rely on a well-regularized feature space. Crucially, without using their more complex methods for estimating uncertainty, a single softmax neural net with such a feature-space, achieved via residual connections and spectral normalization, *outperforms* DUQ and SNGP's epistemic uncertainty predictions using simple Gaussian Discriminant Analysis *post-training* as a separate feature-space density estimator -- without fine-tuning on OoD data, feature ensembling, or input pre-procressing. This conceptually simple *Deep Deterministic Uncertainty (DDU)* baseline can also be used to disentangle aleatoric and epistemic uncertainty and performs as well as Deep Ensembles, the state-of-the art for uncertainty prediction, on several OoD benchmarks (CIFAR-10/100 vs SVHN/Tiny-ImageNet, ImageNet vs ImageNet-O) as well as in active learning settings across different model architectures, yet is *computationally cheaper*.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Constrained Co-Design for Photonic Bayesian Neural Networks

    cs.LG 2026-08 conditional novelty 6.0 of 10

    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.

  2. Density-Informed Pseudo-Counts for Calibrated Evidential Deep Learning

    stat.ML 2026-02 conditional novelty 5.0 of 10

    DIP-EDL sets Dirichlet pseudo-counts to the product of marginal input density and learned class probabilities, concentrating on the true label distribution while sending OOD inputs to the prior.

  3. Optimizing $pp\to A\to Z^{*}h\to \ell^+\ell^- b\bar b$ Searches at the LHC in the 2HDM Type-I with Inverted Hierarchy

    hep-ph 2025-08 conditional novelty 4.0 of 10

    In 2HDM Type-I with inverted hierarchy, applying m_ll in 20-50 GeV and m_bb below 100 GeV makes A to Z* h to ll bb stand out against Drell-Yan and ttbar backgrounds.

  4. HQFNN: A Compact Quantum-Fuzzy Neural Network for Accurate Image Classification

    quant-ph 2025-06 reject novelty 4.0 of 10

    HQFNN is a quantum-fuzzy neural network that embeds fuzzy membership and defuzzification in a small simulated quantum circuit, and it is reported to outperform several specialized baselines on five small image datasets.

Pith tools