For every reproducing kernel Hilbert space $\mathcal{H}_K$ with bounded kernel $K$, we prove that the linear sampling widths $g_m^{\text{lin}}$ and Gelfand widths $c_n$ in the uniform norm satisfy $$ g_m^{\text{lin}}(B_{\mathcal H_K})_\infty \leq \frac{m+1}{m-n+1}\, c_n(B_{\mathcal H_K})_\infty\quad , \quad m\ge n. $$...
While compressed-sensing regularizers enable interpretable reconstruction of 4D Flow CMR through transparent variational objectives, their hand-crafted nature is too restrictive under high acceleration. State-of-the-art learning-based approaches mitigate this, but typically encode regularization implicitly through unro...
German Shâma Wache, Sebastian Neumayer· arXiv.org· 0 citations
We study optimal sampling recovery in reproducing kernel Hilbert spaces (RKHS) in the uniform norm. For every RKHS with bounded kernel, we establish new comparisons between linear sampling widths and Gelfand widths that overcome the known square-root gap, without requiring a measure or a Christoffel-type condition. Our...
S. Neumayer, K. Pozharska, T. Ullrich· 1 citation· ⚡1
Overall, this framework shows that a controlled relaxation of convexity enables the design of learnable priors that achieve strong empirical performance while preserving mathematical guarantees.
Alexis Goujon, S. Neumayer, Stanislas Ducotterd et al.· SIAM Review· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.