{"id":"ce987ad1-c533-4398-8480-ff22fb1d7590","arxiv_id":"2501.01929","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":2,"one_line_summary":"Recovery guarantees are established for weighted ℓ1 minimization over wavelet dictionaries in three inverse problems, with sample complexity ranging from roughly the dimension squared times sparsity to polylogarithmic in the dimension.","lead":"This paper proves sample-complexity and error bounds for compressed sensing in three inverse problems: deconvolution with a Bessel kernel, elliptic PDE source recovery, and ill-posed Fourier sampling motivated by MRI. It extends the authors' earlier framework and shows which random sampling densities make sparse signals recoverable from few noisy measurements.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The load-bearing risk is that Theorem 2.4's uniform-noise case is quoted from [9] with a weakened truncation hypothesis, and the nonuniform case reduces to it; if [9, Prop. 5.8] does not support that weakening, all three application theorems lose their foundation.","rationale":"The paper is a well-structured application of the authors' abstract framework. The verifications for deconvolution, elliptic source recovery and MRI are detailed and appear coherent: Lemma 3.1, Lemma 4.2, and Lemma 5.3 establish balancing and quasi-diagonalization, and Lemmas 3.4, 4.2, and 5.4 give coherence bounds that match the abstract assumptions. The deconvolution section explicitly acknowledges that its sample complexity is not a subsampling result (Remark 3.3), so that is not a hidden flaw. The MRI section delivers a genuine subsampling bound m ~ j0 s modulo logs, and Remark 5.7 honestly records the extra regularity needed on the signal tail. The reader's weakest_assumption about nonuniform noise is a legitimate modeling caveat, but it is not an internal inconsistency: condition (4) is exactly what the reweighted proof needs, and the paper states sufficient regularity conditions for it. The truly load-bearing issue is that the engine of the paper, Theorem 2.4, is not proved here. Section 6.1 reduces the nonuniform case to the uniform case, which is quoted from the companion paper [9] with a modified truncation hypothesis. Since every application theorem invokes Theorem 2.4, a failure of that modification would invalidate the headline results. This is consistent with the reader's rationale (conditional verdict), though the reader's formal weakest_assumption field points to the noise/tail model rather than the delegation. A self-contained proof of the uniform case, or an independent verification of [9, Prop. 5.8], would settle the concern.","tokens_in":33436,"tokens_out":25241,"duration_ms":234532,"concrete_test":"Obtain the proof of [9, Theorem 3.11] and Proposition 5.8, and trace every use of sup_t ||F_t|| <= CF. Verify that each use is covered either by the coherence bound on vectors in ell^2(Lambda_{<=j0}) or by the truncation bound on the specific tail Phi*P^perp_{<=j0} x†. If any step bounds ||F_t Phi* z|| for a candidate difference z that is not in Lambda_{<=j0} and not parallel to P^perp_{<=j0}x†, then Theorem 2.4 needs the dropped assumption restored; otherwise record the replacement as a lemma in this paper so the result becomes self-contained.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Section 6.1's proof of Theorem 2.4 delegates the uniform-noise case entirely to [9, Theorem 3.11], with the change that the hypothesis sup_t ||F_t|| <= CF is dropped and replaced by sup_t ||F_t Phi* P^perp_{<=j0} x†|| <= r, justified by an appeal to [9, Prop. 5.8]. The nonuniform noise case is then obtained by reweighting F'_t = f_nu(t)^(-1/2) F_t and applying the uniform result with density 1. Consequently every recovery guarantee in Sections 3-5 (Theorems 3.2, 3.5, 4.3, 5.6) inherits the validity of this unproved extension. The risk is concrete: the uniform proof may use boundedness of F_t not only to control the truncation tail of the true signal, but also in concentration/covering arguments that bound ||F_t Phi* z|| for a finite net of candidate differences z; the new assumption only controls F_t on the single vector Phi*P^perp x† and on the finite-dimensional subspace Lambda_{<=j0} via the coherence bound. If [9, Prop. 5.8] requires sup_t ||F_t|| on the net, the stated sample complexity (6) is not justified.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper develops an abstract compressed sensing recovery framework for ill-posed inverse problems and applies it to three concrete settings: deconvolution with a Bessel kernel, a sparse inverse source problem for an elliptic PDE, and a moderately ill-posed Fourier sampling problem motivated by MRI. The central abstract result, Theorem 2.4, gives weighted l1 recovery bounds under quasi-diagonalization, coherence, balancing, and noise assumptions, in both uniform and nonuniform noise models. Sections 3, 4, and 5 verify the required assumptions for the three applications and state explicit sample complexity and error bounds, with Section 3 additionally deriving rates for cartoon-like images. Proofs of the application-level verifications are collected in Section 6, and wavelet background is provided in Appendix A.","tokens_in":33732,"tokens_out":18941,"duration_ms":174006,"significance":"If the abstract theorem is fully established, this paper offers a useful unified treatment of sparse recovery for several ill-posed inverse problems, with carefully verified assumptions and explicit sample complexities. The deconvolution result with an optimized nonuniform sampling density, the elliptic source recovery without translation equivariance, and the MRI-motivated Fourier sampling analysis are nontrivial and go beyond the companion paper's Radon transform focus. The paper is also explicit about constants and dependencies, and Section 3.6 gives a concrete rate for cartoon-like images. The main caveat is that the abstract uniform-noise case of Theorem 2.4 is not proved in the manuscript but delegated to the authors' companion paper; because all three applications inherit this result, the significance is contingent on that external proof.","major_comments":[{"comment":"The uniform-noise case of Theorem 2.4 is stated to follow from [9, Theorem 3.11] after dropping the assumption sup_t ||F_t|| <= C_F and replacing it with sup_t ||F_t Phi* P^perp_{<=j0} x^dagger|| <= r. The justification is a reference to [9, Proposition 5.8] and [9, Remark 5.9], but neither the statement nor the proof of that proposition is included in this manuscript. Since the nonuniform-noise case is then derived by reducing it to the uniform case via the reweighted operators F'_t = f_nu(t)^{-1/2} F_t, every recovery guarantee in Theorems 3.2, 3.5, 4.3, and 5.6 depends on this unproved extension. This is a load-bearing point: the modification concerns exactly the truncation-error hypothesis, and it is not self-evident from the finite-net arguments in [9] that the bound on Phi^*P^perp_{<=j0}x^dagger alone suffices. I ask the authors to include a complete proof of the weakened uniform-noise theorem, or at least to reproduce the relevant statement and proof of [9, Proposition 5.8] in an appendix.","section":"Section 6.1, proof of Theorem 2.4"},{"comment":"Lemma 5.3 requires N >= theta^{-1/b} C^{1/(2b)} 2^{j0}, but Section 5.3 writes N = C_0 2^{j0} with C_0 = theta^{-1/b} C^{1/b}, and Theorem 5.6 states N = C^{1/b}2^{j0} without the theta factor. The exponent on C and the theta dependence are inconsistent between the lemma and its application. This does not affect the recovery theorem if the constants are allowed to absorb the discrepancy, but the statements should be made uniform.","section":"Section 5.4 / Lemma 5.3, Theorem 5.6"}],"minor_comments":[{"comment":"In equation (11), the displayed operator norm should have domain l2(Lambda_{<=j0}), not H1, since the operator being bounded is P^perp U Phi^* iota_{<=j0} from l2(Lambda_{<=j0}) to H.","section":"Definition 2.10"},{"comment":"The proof states that F_0 phi_{j,n} = 0 for all dictionary elements, but this is not true for the low-frequency scaling functions in the dictionary; the low-frequency part is said to be handled analogously, so the statement should be restricted to the wavelet components or justified for the scaling functions as well.","section":"Lemma 5.4"},{"comment":"The measurement model writes y_k := (1+|t_k|^2)^{-b/2} \\hat u^dagger(t_k) + epsilon_k, but the forward operator F_t is defined via the normalized frame elements \\tilde\\psi_t = exp(2pi i t \\cdot x)/|B_R|^{1/2}; the normalization factor |B_R|^{-1/2} appears to be missing from the displayed formula for y_k.","section":"Theorem 5.6"},{"comment":"The value j0 := floor(2/(1+2b) log(1/beta)) is used as a scale index, but j0 should be a nonnegative integer; the floor notation is present, yet the subsequent sample complexity statement could state more explicitly that all estimates hold up to rounding.","section":"Section 3.6"}],"recommendation":"major_revision","confidential_remarks":"The central issue is the delegation of the modified uniform-noise theorem to the companion paper [9]. The application chapters are detailed and appear internally coherent, but the abstract theorem is the foundation of all three applications. If [9] is truly forthcoming and its Proposition 5.8 indeed covers the weakened hypothesis, the paper may be acceptable after a short appendix; otherwise the gap is substantial. I would encourage the editor to require a self-contained proof of Theorem 2.4 in the revision."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: this is a solid, honest applications paper, but the load-bearing theorem is quoted from the authors' own companion paper [9], and the specific weakening of the truncation hypothesis is not proved here. The reader's conditional verdict is the right one.\n\nWhat's actually new: the balancing property (Definition 2.10) and the optimized sampling densities, plus detailed verification of the abstract conditions for three problems: Bessel-kernel deconvolution, elliptic inverse source, and a moderately ill-posed Fourier sampling model inspired by MRI. The MRI result gives polylog sample complexity in wavelet sparsity under ill-posedness, which is the standout contribution. Sections 3 and 4 are honest that they are not subsampling results (Remark 3.3 explicitly says so), and the cartoon-like image bound is a nice concrete application.\n\nWhat the paper does well: the verification lemmas are concrete and checkable. Lemma 3.4's exponential sampling density, Lemma 4.2's coherence via interpolation, and Lemma 5.4's Fourier decay estimate are all real work. The paper is careful about noise models and states the nonuniform assumptions (3)-(4) explicitly.\n\nSoft spots, in order. First, the central abstract Theorem 2.4's uniform-noise case is not proved here: Section 6.1 just says it follows from [9, Theorem 3.11] with a modified truncation assumption, appealing to [9, Prop. 5.8] and Remark 5.9. The stress-test concern—that the original proof may have used sup_t ||F_t|| beyond controlling the truncation tail, e.g., in covering arguments—is plausible and not answered by this text. I can't point to an actual error, but the submission makes the referee's job impossible without [9]. Second, the nonuniform noise bound (3) is strong: it requires the noise to shrink where sampling is unlikely, and condition (4) is a smoothness/tail assumption on the signal, not a consequence of sparsity. Remark 5.7 shows it reduces to H^{1-b} regularity of the tail for MRI, which is reasonable but still an assumption. Third, the deconvolution and PDE results are not subsampling: sample complexity is essentially the size of the truncated wavelet space (up to logs), as the authors admit. That's not a flaw, but it limits the practical punch of Sections 3–4.\n\nBottom line: the paper is a serious application of an abstract framework, with genuine new content in the balancing property and the MRI theorem. The referee needs a copy of [9] and should verify the weakened hypothesis. If the companion paper holds up, this is a good-to-publish contribution. If not, the application theorems collapse to the companion's assumptions. I'd send it to a competent referee, but flag the dependency prominently.","headline":"A serious applications paper with a real MRI theorem, but the central abstract result is quoted from an unavailable companion paper, so the conditional verdict is right.","tokens_in":34236,"tokens_out":2665,"would_cite":true,"duration_ms":25754,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["42C40","94A20","35R30"],"pacs":[],"model":"deepseek-v4-flash","headline":"Three ill-posed inverse problems—deconvolution, elliptic source recovery, and MRI-style Fourier sampling—are shown to admit stable sparse recovery with explicit sample complexity.","keywords":["compressed sensing","inverse problems","sparse recovery","wavelets","quasi-diagonalization","coherence","sample complexity","magnetic resonance imaging"],"falsifier":"Compute the actual $\\|F_t\\phi_{j,n}\\|$ for a concrete compactly supported wavelet basis (for example, Daubechies-8) on the lattice $Z$ and compare with the bound $B_0 2^{-bj}(1+|t|^2)^{1/2}$; a counterexample violating this inequality at some scale would invalidate Lemma 5.4 and hence Theorem 5.6. Alternatively, simulate the weighted $\\ell^1$ recovery for a signal whose tail is sparse but not $H^{1-b}$-regular and check whether the error exceeds the right-hand side of Theorem 5.6.","tokens_in":33219,"feed_emoji":"","tokens_out":6526,"duration_ms":54739,"temperature":0.7,"pith_summary":"This paper claims that one abstract compressed-sensing framework, originally built for the sparse Radon transform, governs three distinct ill-posed inverse problems: deconvolving a wavelet-sparse signal from pointwise samples of a blurred version, recovering a sparse source term of an elliptic partial differential equation from pointwise samples of its solution, and reconstructing a wavelet-sparse signal from ill-posed Fourier samples of the kind motivated by magnetic resonance imaging. For each problem the authors verify two structural conditions—quasi-diagonalization of the forward map and a coherence bound tied to the sampling density—and then read off recovery guarantees from a single theorem. They also introduce a balancing property that controls the error of truncating the measurement range to a finite band, and they show that choosing the sampling density to match the coherence profile improves sample complexity. A sympathetic reader should take away a unified explanation of when sparse recovery survives ill-posedness, with the ill-posedness parameter entering explicitly in the bounds.","feed_headline":"Stable sparse recovery proven for deconvolution, source recovery, and MRI","feed_subtitle":"One abstract theorem turns blur, PDE, and Fourier sampling into explicit sample-complexity bounds.","key_machinery":"The load-bearing mechanism is the pair of structural estimates known here as quasi-diagonalization and coherence. Quasi-diagonalization (Assumption 2.1) says the forward map $F$ behaves, on the wavelet dictionary $(\\phi_{j,n})$, like a diagonal operator that attenuates scale $j$ by $2^{-bj}$, so the parameter $b$ quantifies ill-posedness. The coherence bound (Assumption 2.2) ties each measurement operator $F_t$ to the sampling density $f_\\nu$ via $\\|F_t\\phi_{j,n}\\|\\le B\\sqrt{f_\\nu(t)}2^{dj}$; when the density is chosen proportional to the minimal function $g_\\nu=\\sup_{j,n}2^{2dj}\\|F_t\\phi_{j,n}\\|^2$, the constant $B$ is controlled and sample complexity improves. The balancing property (Definition 2.10), $\\|P^\\perp U\\Phi^*\\iota_{\\le j_0}\\|\\le \\theta 2^{-2bj_0}$, controls the error of projecting the natural forward map $U$ onto the measurable band, and Proposition 2.11 shows that quasi-diagonalization of $U$ plus balancing of $P$ yields weak quasi-diagonalization of the truncated map $F=P\\circ U$. These three conditions feed directly into Theorem 2.4.","core_discovery":"The central discovery is Theorem 2.4: if the forward map $F$ satisfies the quasi-diagonalization bound $c\\sum_{(j,n)} 2^{-2bj}|x_{j,n}|^2 \\le \\|F\\Phi^*x\\|_{L^2_\\mu}^2 \\le C\\sum 2^{-2bj}|x_{j,n}|^2$ and the coherence bound $\\|F_t\\phi_{j,n}\\| \\le B\\sqrt{f_\\nu(t)}2^{dj}$ with $0\\le d\\le b$, then the minimizer $\\hat x$ of the constrained weighted $\\ell^1$ program with weight $W=\\operatorname{diag}(2^{bj})$ reconstructs the wavelet coefficients of the signal with error $\\|W^{-\\zeta}(x^\\dagger-\\hat x)\\|_2 \\le C_1\\sigma_s(W^{-\\zeta}P_{\\le j_0}x^\\dagger)_1/\\sqrt{s}$ plus explicit noise and truncation terms, provided the number of random samples $m$ satisfies $m\\ge C_0\\tau\\max\\{\\log^3\\tau\\log M_{\\le j_0},\\log(1/\\gamma)\\}$ with $\\tau = B^2 2^{2(b-d)j_0} 2^{2(1-\\zeta)bj_0}s$. The paper then shows that the three applications satisfy these hypotheses, with the ill-posedness parameter $b$ equal to the Bessel-potential order for deconvolution, $b=2$ for the elliptic source problem, and the modulation decay $b$ for MRI-style Fourier sampling.","pith_inferences":["The same template should apply to any forward map whose wavelet-domain symbol decays like $2^{-bj}$: one can predict sample complexity $\\tau = B^2 2^{2(b-d)j_0}2^{2(1-\\zeta)bj_0}s$ without redoing the argument, so the paper effectively provides a recipe for future inverse problems.","The optimized sampling densities described in Section 2.5 are a candidate explanation for why variable-density MRI works in practice; a numerical study comparing the predicted density $(1+|t|^2)^{-1}$ with learned sampling patterns would test this directly.","The bounds do not specify how to choose $j_0$ given a noise level; optimizing the error bounds over $j_0$ could give practical guidance on the resolution level and sample count, a step the paper leaves implicit."],"forward_implications":["Sparse deconvolution with a Bessel kernel admits stable random-sampling recovery with $m\\gtrsim j_0^2 2^{2j_0}s$ samples, up to logarithmic factors; the paper notes this is not a subsampling result but a stable sampling strategy with explicit noise robustness.","For cartoon-like images the deconvolution bound becomes $\\|u^\\dagger-\\hat u\\|_{L^2}\\le C\\beta^{1/(2b+1)}\\log^2(1/\\beta)$ up to logarithmic factors when $m$ is chosen of order $\\beta^{-2(2b+3)/(2b+1)}$, connecting the abstract theorem to a concrete image class.","For the elliptic inverse source problem, wavelet-sparse sources are recoverable from pointwise samples of the solution with $b=2$ and $m\\gtrsim \\alpha^{-2}2^{2(1+\\alpha)j_0}s$, showing the framework works without translation invariance.","For MRI-style Fourier sampling, variable density $f_\\nu(t)\\propto(1+|t|^2)^{-1}$ yields recovery with $m\\gtrsim j_0 s$ up to logarithmic factors, requiring the balancing property and a regularity assumption on the high-frequency tail."],"supporting_citations":[{"why":"Supplies the abstract framework and Theorem 3.11 that Theorem 2.4 generalizes.","marker":"[9]"},{"why":"Introduces generalized sampling and the balancing-condition viewpoint used in Definition 2.10.","marker":"[6]"},{"why":"Provides the balancing property for Fourier sampling and the wavelet Fourier decay estimates used in Example 2.12.","marker":"[7]"},{"why":"Gives the coherence bound $|F\\phi_{j,n}(t)|\\le C|t|^{-1/2}$ used to motivate the nonuniform sampling density.","marker":"[34]"},{"why":"Beurling's density and separated-set frame theorem for exponentials on lattices, used to define the MRI measurement model.","marker":"[13]"},{"why":"Meyer's wavelet theory provides Littlewood-Paley characterizations and Bessel-kernel $L^p$ estimates used throughout.","marker":"[42]"},{"why":"Gilbarg-Trudinger elliptic regularity estimates used for the inverse source problem in Lemmas 4.1 and 4.2.","marker":"[28]"},{"why":"Mallat's wavelet tour supplies cartoon-like image coefficient decay used in Section 3.6.","marker":"[41]"}],"fun_headline_variants":["One theorem, three inverse problems: blur, PDE, MRI","Unified sample complexity for blur, source recovery, and MRI","Quasi-diagonalization guarantees sparse recovery in inverse problems","From blurred samples to MRI: a single recovery theory","Deconvolution, source recovery, MRI: one proof, three applications"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The recovery guarantees hold only when the noise and the truncated high-frequency tail of the signal satisfy the weighted bounds (1)-(4); in the MRI application this reduces to a regularity assumption on the tail in $H^{1-b}$, which sparsity alone does not imply.","fun_headline_variants_meta":{"raw":{"variants":["One theorem, three inverse problems: blur, PDE, MRI","Unified sample complexity for blur, source recovery, and MRI","Quasi-diagonalization guarantees sparse recovery in inverse problems","From blurred samples to MRI: a single recovery theory","Deconvolution, source recovery, MRI: one proof, three applications"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.00096,"raw_usage":{"total_tokens":4167,"prompt_tokens":1098,"completion_tokens":3069,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":714,"completion_tokens_details":{"reasoning_tokens":2984}},"tokens_in":714,"tokens_out":3069,"duration_ms":19621,"temperature":1.0,"reasoning_tokens":2984,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-10T22:14:55.621645+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute the actual $\\|F_t\\phi_{j,n}\\|$ for a concrete compactly supported wavelet basis (for example, Daubechies-8) on the lattice $Z$ and compare with the bound $B_0 2^{-bj}(1+|t|^2)^{1/2}$; a counterexample violating this inequality at some scale would invalidate Lemma 5.4 and hence Theorem 5.6. Alternatively, simulate the weighted $\\ell^1$ recovery for a signal whose tail is sparse but not $H^{1-b}$-regular and check whether the error exceeds the right-hand side of Theorem 5.6.","supporting_citations":[{"cited_title":"Alberti, Alessandro Felisi, Matteo Santacesaria, and S","cited_arxiv_id":null,"evidence_quote":"Supplies the abstract framework and Theorem 3.11 that Theorem 2.4 generalizes."},{"cited_title":"Generalized sampling and infinite -dimensional compressed sensing","cited_arxiv_id":null,"evidence_quote":"Introduces generalized sampling and the balancing-condition viewpoint used in Definition 2.10."},{"cited_title":"Hansen, and Clarice Poon","cited_arxiv_id":null,"evidence_quote":"Provides the balancing property for Fourier sampling and the wavelet Fourier decay estimates used in Example 2.12."},{"cited_title":"Analyzing the structure of multidimensional compressed sensing problems through coherence","cited_arxiv_id":"1610.07497","evidence_quote":"Gives the coherence bound $|F\\phi_{j,n}(t)|\\le C|t|^{-1/2}$ used to motivate the nonuniform sampling density."},{"cited_title":"Local harmonic analysis with some applications to d ifferential operators","cited_arxiv_id":null,"evidence_quote":"Beurling's density and separated-set frame theorem for exponentials on lattices, used to define the MRI measurement model."},{"cited_title":"Gilbarg and N.S","cited_arxiv_id":null,"evidence_quote":"Gilbarg-Trudinger elliptic regularity estimates used for the inverse source problem in Lemmas 4.1 and 4.2."},{"cited_title":"A Wavelet Tour of Signal Processing","cited_arxiv_id":null,"evidence_quote":"Mallat's wavelet tour supplies cartoon-like image coefficient decay used in Section 3.6."}],"review_version":1}