Neural Optimal Design of Experiment for Inverse Problems

John E. Darges, Babak Maboudi Afkham, Matthias Chung
12/28/2025
cs.LGstat.ML

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

We introduce Neural Optimal Design of Experiments, a learning-based framework for optimal experimental design in inverse problems that avoids classical bilevel optimization and indirect sparsity regularization. NODE jointly trains a neural reconstruction model and a fixed-budget set of continuous design variables representing sensor locations, sampling times, or measurement angles, within a single optimization loop. By optimizing measurement locations directly rather than weighting a dense grid of candidates, the proposed approach enforces sparsity by design, eliminates the need for l1 tuning, and substantially reduces computational complexity. We validate NODE on an analytically tractable exponential growth benchmark, on MNIST image sampling, and illustrate its effectiveness on a real world sparse view X ray CT example. In all cases, NODE outperforms baseline approaches, demonstrating improved reconstruction accuracy and task-specific performance.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{darges2025neural,
  title  = {Neural Optimal Design of Experiment for Inverse Problems},
  author = {John E. Darges and Babak Maboudi Afkham and Matthias Chung},
  year   = {2025},
  eprint = {2512.23763},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2512.23763v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2512.23763.svg)](https://codeofpaper.com/paper/2512.23763)

Discussion