The paper introduces DRO-NPE, a distributionally robust neural posterior estimation method that replaces the standard NPE objective with a worst‑case loss over a Wasserstein ambiguity set. It presents KL‑based metrics for miscoverage and miscalibration, demonstrating that the DRO‑NPE objective mitigates overfitting and reduces posterior overconfidence. Experiments on benchmark simulation‑based inference tasks show that DRO‑NPE consistently improves coverage and calibration while narrowing the gap between empirical and population NPE loss, especially in low‑simulation regimes.
arXiv:2506.17874v3 Announce Type: replace-cross Abstract: In many real-world applications, ensuring the robustness and stability of deep neural networks (DNNs) is crucial, particularly for image clas...
arXiv:2606. 16214v1 Announce Type: cross Abstract: Modern deep learning models remain notoriously prone to overconfidence, limiting their reliability in high-stakes applications.
arXiv:2607. 07671v1 Announce Type: new Abstract: Probabilistic circuits (PCs) can model complex joint distributions while supporting exact and efficient computation of many inference queries.
arXiv:2509. 23385v5 Announce Type: replace-cross Abstract: Simulation-based inference (SBI) is transforming experimental sciences by enabling parameter estimation in complex non-linear models from simulated data.
arXiv:2602. 09161v2 Announce Type: replace-cross Abstract: Simulation-based inference (SBI) enables amortized Bayesian inference by first training a neural posterior estimator (NPE) on prior-simulator pairs, typically through low-dimensional summary statistics, which can then be cheaply reused for fast inference by querying it on new test observations.
arXiv:2610.10116v1 Announce Type: new Abstract: Semantic segmentation networks operate on a fixed set of classes and therefore fail when out-of-distribution (OOD) objects appear during deployment, a...
arXiv:2606. 30230v1 Announce Type: cross Abstract: Learned reconstruction operators for inverse problems are typically trained under a fixed noise model, and generalize poorly when the distribution during testing differs from the one assumed during training.
arXiv:2509. 09371v2 Announce Type: replace-cross Abstract: Distributionally robust optimization (DRO) protects statistical learning against distributional shifts by optimizing the worst-case performance over a set of perturbed distributions.
arXiv:2606. 01468v1 Announce Type: cross Abstract: Due to their explicit priors and ability to model uncertainty, Bayesian methods have played a major role in dynamical latent variable modeling of single-cell neural recordings.
The paper investigates Wasserstein distributionally robust optimization (WDRO) for classification, showing that ordering hypotheses by WDRO risk aligns with robust accuracy only for a specific class of loss functions. It demonstrates that common losses like cross‑entropy can misalign robust accuracy and WDRO risk, and introduces Wasserstein distributional attacks (WDA) with a support‑search algorithm to directly evaluate robust accuracy. Experiments on CIFAR‑10, CIFAR‑100, and ImageNet reveal that WDA achieves the lowest adversarial accuracy in most settings.
The paper introduces NeVI‑Cut, a modular variational inference method for cut‑Bayes that does not require access to upstream data or models. It approximates the cut‑posterior by minimizing the expected downstream conditional Kullback‑Leibler divergence, using conditional normalizing flows as the variational family. The authors provide fixed‑data convergence rates, establish uniform KL approximation results for flow classes, and demonstrate the algorithm’s speed and accuracy on several applications.
The paper introduces MS‑WDRO, a multi‑source Wasserstein distributionally robust optimization framework for reconstructing complex network topologies from scarce target‑domain data and abundant heterogeneous source data. It fuses sources via a weighted Wasserstein barycenter, builds an ambiguity set around it, and solves a regularized Laplacian estimator using a provably convergent ADMM scheme. The authors provide finite‑sample guarantees, demonstrate that naive aggregation is suboptimal, and show through experiments on synthetic data and the ABIDE I neuroimaging dataset that MS‑WDRO outperforms seven baselines in graph recovery, sample efficiency, and diagnostic utility, especially when target samples are limited.