Jackpot: Approximating Uncertainty Domains with Adversarial Manifolds
Abstract
Given a forward mapping Φ : R^N → R^M and a point x* ∈ R^N , the region x ∈ R^N , ||Φ(x) − Φ(x*)|| ≤ ε, where ε ≥ 0 is a perturbation amplitude, represents the set of all possible inputs x that could have produced the measurement Φ(x*) within an acceptable error margin. This set is related to uncertainty analysis, a key challenge in inverse problems. In this work, we develop a numerical algorithm called Jackpot (Jacobian Kernel Projection Optimization) which approximates this set with a low-dimensional adversarial manifold. The proposed algorithm leverages automatic differentation, allowing it to handle complex, high dimensional mappings such as those found when dealing with dynamical systems or neural networks. We demonstrate the effectiveness of our algorithm on various challenging large-scale, non-linear problems including parameter identification in dynamical systems and blind image deblurring.
Cite
Text
Munier et al. "Jackpot: Approximating Uncertainty Domains with Adversarial Manifolds." Journal of Machine Learning Research, 2025.Markdown
[Munier et al. "Jackpot: Approximating Uncertainty Domains with Adversarial Manifolds." Journal of Machine Learning Research, 2025.](https://mlanthology.org/jmlr/2025/munier2025jmlr-jackpot/)BibTeX
@article{munier2025jmlr-jackpot,
title = {{Jackpot: Approximating Uncertainty Domains with Adversarial Manifolds}},
author = {Munier, Nathanaël and Soubies, Emmanuel and Weiss, Pierre},
journal = {Journal of Machine Learning Research},
year = {2025},
pages = {1-41},
volume = {26},
url = {https://mlanthology.org/jmlr/2025/munier2025jmlr-jackpot/}
}