Generalization and Guarantees in Deep Learning for Inverse Problems
Characterize the generalization behavior of deep learning-based methods for inverse problems across diverse datasets and ascertain the trade-off between empirical performance and robust theoretical guarantees such as stability, robustness, and convergence.
References
Open questions remain regarding the generalization of these models across diverse datasets and the crucial balance between empirical performance and robust theoretical guarantees.
It clarifies what deep learning and modern AI can achieve through representation learning, increased capacity, wider contextual modelling, optimization, and large empirical priors, while identifying fundamental problems that remain unresolved, including limits imposed by acquisition, sampling, non-identifiability, decision objectives, and dependence on the training distribution.
Despite these results, LUD-DIF has two main limitations. First, it requires a known or approximate forward operator, limiting its use in blind inverse problems and semantic modality translation. Second, although we bound the error introduced by the weak-coupling assumption, how to reduce this error remains open. Future work may investigate transformed or latent representations, such as wavelet spaces and neural-network embeddings, to tighten the bound, together with efficient sampling and model distillation to improve scalability.