Research map / Probabilistic and scientific modeling / Uncertainty and Gaussian processes
Maxitive Donsker-Varadhan Formulation for Possibilistic Variational Inference
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Derives a maxitive (possibilistic) Donsker-Varadhan variational formula with lower and upper consistency bounds, and uses it to build CBOpt, a family of Newton-like optimizers for neural network training evaluated on image classification with OOD detection.
Problem
Variational inference relies on additive measures (expectations, KL divergence, Shannon entropy), so it does not carry over directly to possibility theory, an imprecise probability framework for epistemic uncertainty.
Approach
A maxitive analogue of the Donsker-Varadhan formula gives two dual consistency bounds (lower and upper CBO) over possibility functions, whose optima bound the possibilistic posterior; restricting to exponential-family (Gaussian) candidates yields a signed Newton-like update applied to neural network training.
Key results
- On Fashion-MNIST, lCBOpt-adapt reaches the best accuracy of 0.913 and NLL of 0.252 among compared optimizers.
- On CIFAR-100, all three CBOpt variants outperform the baselines on accuracy, NLL and OOD metrics, with uCBOpt reaching 0.671 accuracy versus 0.649 for SGD and MC-D.
- On CIFAR-10, CBOpt variants reach around 0.910 accuracy, comparable to SGD and Laplace, but do not surpass SWAG or MC Dropout on OOD detection.
Surprising findings
- On CIFAR-10, CBOpt does not surpass SWAG or MC Dropout on OOD detection despite competitive in-domain accuracy.
- IVON, MC Dropout and CBOpt variants have better ECE than the CBOpt variants on CIFAR-100, where IVON and MC dropout achieve better calibration.
Limitations
- Newton-like update requires curvature condition H_s positive definite, which is hard to maintain pointwise for the lower CBO, motivating adaptive variants.
- Exponential-family treatment assumes proper closed convex log-partition and excludes the fully uninformative limit.
- Empirically limited to isotropic Gaussian candidates with a diagonal empirical-Fisher surrogate.
Experimental setup
Datasets: Fashion-MNIST CIFAR-10 CIFAR-100
Benchmarks: Fashion-MNIST EMNIST CIFAR-10 SVHN CIFAR-100 TinyImageNet
Metrics: accuracy NLL ECE FPR@95 AUROC AUPR-Out
Baselines: AdamW SGD IVON MC Dropout Laplace SWAG
Builds on: Donsker-Varadhan variational formula IVON Adam Vprop generalized variational inference
Closest papers by meaning
- Robust, Accurate Stochastic Optimization for Variational Inference (NeurIPS 2020 · similarity 0.89)
- Deterministic Variational Inference for Robust Bayesian Neural Networks (ICLR 2019 · similarity 0.89)
- Variational Inference and Model Selection with Generalized Evidence Bounds (ICML 2018 · similarity 0.89)
- Generalized Variational Inference via Optimal Transport (AAAI 2024 · similarity 0.88)
- Variational Inference with Mixtures of Isotropic Gaussians (NeurIPS 2025 · similarity 0.88)
- SoftCVI: Contrastive variational inference with self-generated soft labels (ICLR 2025 · similarity 0.88)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
