Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Nathanaël Munier

dblp:415/4531 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Mathematical optimization · 100%
Computer graphics and multimedia
1 paper
Image and video processing · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization
inverse problems
0.912025
Jackpot: Approximating Uncertainty Domains with Adversarial Manifolds · J. Mach. Learn. Res. 2025
Mathematical optimization › control theory › system identification
parameter identification
0.912025
Jackpot: Approximating Uncertainty Domains with Adversarial Manifolds · J. Mach. Learn. Res. 2025
Mathematical optimization
uncertainty quantification
0.912025
Jackpot: Approximating Uncertainty Domains with Adversarial Manifolds · J. Mach. Learn. Res. 2025
Image and video processing › image restoration › image deblurring
blind image deblurring
0.312025
Jackpot: Approximating Uncertainty Domains with Adversarial Manifolds · J. Mach. Learn. Res. 2025
Image and video processing
image restoration
0.312025
Jackpot: Approximating Uncertainty Domains with Adversarial Manifolds · J. Mach. Learn. Res. 2025

Methods — techniques the papers use, named apart from their topics

jacobian kernel projection optimization · 1.7automatic differentiation · 1.7adversarial manifold · 1.7
YearPublicationVenuePosition
2025 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.
Nathanaël Munier, Emmanuel Soubies, Pierre Weiss
J. Mach. Learn. Res.1