{"id":"2b80e46e-419d-40e6-8e16-8edd33d4ac46","arxiv_id":"2411.14933","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"low","formal_verification":"none","parameter_count":3,"one_line_summary":"A new framework relaxes compact support to fast decay in polynomial reproduction, yielding stable and convergent quasi-interpolation with sparse basis functions via linear programming.","lead":"This paper proposes fast-decaying polynomial reproduction, a framework for approximating smooth functions with basis functions that are not compactly supported but decay quickly. It proves stability and O(h^{m+1}) convergence for Gaussian moving least squares and for a new linear-programming variant, with numerical confirmation.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The proof of Theorem 2 uses a volume-count bound (n+2)^d - (n-1)^d <= 3d(n+1)^{d-1} that is already false for d=5; the stated constant K is unsupported, though the convergence claim is repairable with a larger constant.","rationale":"We read the central claim as: any family satisfying Definition 4 yields quasi-interpolants with h-uniform weighted sums (Theorem 2) and O(h^{m+1}) convergence (Theorem 3), and the Gaussian-MLS and ell_1-LP constructions satisfy Definition 4 (Theorems 4 and 5). The overall architecture is sound: the comparison with Wendland's compactly supported local basis in Theorems 4 and 5 is correct, and the decay estimates are derived without obvious algebraic errors. The load-bearing weak point is the volume-counting inequality inside Theorem 2, which is false starting at d=5; this invalidates the stated constant K as written. Because the bound is easily repaired with a larger constant, the mathematical conclusion survives, but the proof needs correction. We also note the abstract's compact-support claim is inaccurate for the LP method, which produces sparsity rather than compact support, and no code or data are shipped. The reader's weakest assumption about growth of Wendland's C1, C2 with m is real but secondary to this proof gap. We therefore keep the CONDITIONAL verdict; the condition should include a corrected proof of Theorem 2.","tokens_in":908,"tokens_out":1077,"duration_ms":251779,"concrete_test":"Evaluate the claimed inequality at (d,n)=(5,1): 3^5 = 243 versus 3*5*2^4 = 240. If it fails as expected, redo the counting argument with the corrected bound 3d*2^{d-1}(n+1)^{d-1}, recompute the constant in Theorem 2, and verify that the subsequent steps of Theorem 3 remain valid with the enlarged constant.","verdict_should_be":"UNCHANGED","load_bearing_attack":"In Theorem 2, the stability of the whole framework is reduced to bounding the number of data sites in each annulus E_n. The proof compares volumes and claims #{x_j in E_n} <= (n+2)^d - (n-1)^d <= 3d(n+1)^{d-1}. This second inequality is not true: for n=1 it reads 3^d <= 3d*2^{d-1}, which fails for d=5 (243 vs 240) and for all larger d. Consequently the constant K in equation (5), and hence the Lebesgue-constant bound and the error constant in Theorem 3, are not justified as printed. The defect is local and repairable: a mean-value argument gives (n+2)^d - (n-1)^d <= 3d*2^{d-1}(n+1)^{d-1}, so the same stability and convergence conclusions follow with a larger d-dependent constant. Thus this is a genuine proof gap, not a refutation of the central claim. Separately, the abstract overclaims numerical verification of compact support: the ell_1 experiments show only that each evaluation uses at most Q nonzero coefficients (sparsity), not that the basis functions have compact support.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The manuscript proposes a relaxation of local polynomial reproduction in which the compact-support condition of Definition 1 is replaced by a fast-decay condition for the basis functions (Definition 4). The main theoretical results are: Theorem 2, a bound on the weighted sums \\sum_j \\|x-x_j\\|^\\ell |u_j(x)| by K q_X^\\ell; Theorem 3, an O(h_{X,\\Omega}^{m+1}) convergence estimate for quasi-interpolants that reproduce \\pi_m(R^d); Theorem 4, verifying the framework for Gaussian moving-least-squares weights; and Theorem 5, verifying it for an \\ell_1-minimization scheme. Numerical experiments in Section 6 illustrate smoothness, sparsity, Lebesgue constants, and convergence rates, including multivariate tests.","tokens_in":17289,"tokens_out":11701,"duration_ms":110964,"significance":"If the proof gaps are repaired, the paper offers a genuinely useful framework: it generalizes Wendland's local polynomial reproduction to non-compactly supported basis functions, provides explicit decay functions and constants for Gaussian MLS and \\ell_1 quasi-interpolation, and connects the RL-RBF method to a broader theory. The proofs are constructive and the convergence and stability statements are quantitative, which is a valuable feature. The numerical experiments support the main convergence and stability claims, although they do not establish compact support of the \\ell_1 basis functions.","major_comments":[{"comment":"The volume-counting inequality used to define the constant K is false as stated. The proof asserts \\#\\{x_j: x_j \\in E_n\\} \\le (n+2)^d - (n-1)^d \\le 3d(n+1)^{d-1}, but for n=1 and d=5 the rightmost inequality reads 3^5 \\le 15 \\cdot 2^4, i.e. 243 \\le 240, which fails. The sentence 'The above inequalities are held by induction on d' is not a proof and is contradicted by this counterexample. The gap is local and repairable: a mean-value estimate gives (n+2)^d - (n-1)^d \\le 3d\\,2^{d-1}(n+1)^{d-1}, so the same stability and convergence conclusions follow with a larger d-dependent constant. As printed, however, the constant K in Eq. (5), and therefore the Lebesgue-constant bound and the error constant in Theorem 3, are not justified.","section":"Section 3.1, proof of Theorem 2 and Eq. (5)"},{"comment":"There is a sign error in the Gaussian-weight case. From the preceding bound \\sum_i |\\tilde u_i(x)| / w_i(x) \\le C_1 e^{\\nu(C_2 h_{X,\\Omega}/\\delta)^2}, each coefficient must inherit the positive exponent, so the displayed inequality should contain e^{+\\nu(C_2/(\\gamma c_\\gamma))^2}, not e^{-\\nu(C_2/(\\gamma c_\\gamma))^2}. As printed, the constant C = e C_1 e^{-\\nu(C_2/(\\gamma c_\\gamma))^2} is too small and the upper bound is not derived from the preceding step. This is a load-bearing error in one of the two central instantiations, but it is easily fixed by changing the sign of that exponent, yielding C = e C_1 e^{+\\nu(C_2/(\\gamma c_\\gamma))^2}.","section":"Section 5, proof of Theorem 5"},{"comment":"The abstract states that compactness of the support has been verified numerically, but the experiments do not verify compact support. For the \\ell_1 scheme, the simplex-method argument only shows that at each evaluation point at most Q coefficients in the representation are nonzero (a vertex solution), i.e. sparsity of the representation; Figures 3, 4, and 6 illustrate basis functions over a finite grid and cannot establish that each a_j^*(x) has compact support. The overclaim should be removed or replaced by a statement about sparsity.","section":"Abstract and Section 6.1"}],"minor_comments":[{"comment":"The notation a^T D(x) a with D diagonal of entries e^{-\\nu(\\|x-x_i\\|/\\delta)^2} is inconsistent with the displayed minimization \\sum_i a_i(x)^2 / e^{-\\nu(\\|x-x_i\\|/\\delta)^2}; the quadratic form should use D(x)^{-1} or the definition of D should be changed accordingly.","section":"Section 4, Eq. (7)"},{"comment":"The symbol 'QX' in the displayed expression for a_j^*(x) appears to be a typesetting artifact; it should read \\sum_{k=1}^Q.","section":"Section 4, Eq. (9)"},{"comment":"The text describes the domain for Franke's function as [0,1]^2, but the figure captions state \\|f-z_{f,X}\\|_{L_\\infty([-1,1])}; the domain and the x-axis labeling ('25 to 30' versus node counts 676-961) need to be reconciled.","section":"Section 6.2, Figures 7 and 8"},{"comment":"The phrase 'only m+1 basis functions are different from zero' should be qualified as 'at each evaluation point for a vertex solution of the linear program'; without this qualification it could be misread as a statement of compact support.","section":"Section 6.1"},{"comment":"The paper would benefit from an explicit remark that the constants C and h_0 in Theorems 4 and 5 inherit the dependence on m, d, and the cone parameters through the constants C_1 and C_2 of Theorem 1, so the practical convergence statement may require very small fill distances for large m or d.","section":"Theorems 4 and 5"}],"recommendation":"major_revision","confidential_remarks":"The paper's central idea is sound and the two main technical defects are local and repairable, so I recommend major revision rather than rejection. Please ask the authors to fix the volume-counting inequality in Theorem 2, the sign error in Theorem 5, and the abstract's compact-support overclaim."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Briefly: the paper deserves a serious referee, but it needs a revision before the results are citable as printed. The core idea — replace compact support in local polynomial reproduction with fast decay relative to the separation radius — is a genuine generalization, and the two instantiations, Gaussian moving least squares and an ℓ1 linear-programming scheme, are worked out with explicit constants. Theorems 4 and 5 correctly adapt Wendland's local polynomial reproduction theorem, and Theorem 3's convergence statement follows cleanly from the weighted-sum bound in Theorem 2. The ℓ1 scheme is the most interesting part: the simplex vertex solution gives at most Q nonzero basis functions per evaluation point, which is a real computational benefit and a new application of sparse optimization in this setting.\n\nNow the soft spots. The proof of Theorem 2 contains a false inequality. The volume comparison gives #{xj ∈ E_n} ≤ (n+2)^d − (n−1)^d, but the next bound, ≤ 3d n^{d−1}, is not true — it already fails for d=5, n=1 (243 > 15). The stated constant K in (5) is therefore unsupported. The fix is local: a mean-value argument gives ≤ 3d(n+2)^{d−1}, and the series still converges because φ decays at least geometrically. So the stability and convergence results survive with a larger d-dependent constant, but the proof as printed has a hole.\n\nThe abstract also overclaims the numerics: the ℓ1 experiments demonstrate sparsity (at most Q nonzero coefficients per evaluation), not compact support of the basis functions. The numerical section has other v1 issues — no code or data shipped, δ set by trial and error, and some figure/text mismatches in axes and domains. These are presentation problems, not mathematical ones. The citation pattern is fine; the self-citation to [DW20] is appropriate, and Wendland's external theorem is the standard anchor.\n\nVerdict: central framework and applications are sound in spirit and mostly in detail, but Theorem 2's constant needs repair. I would send this to a competent referee rather than desk-reject; with a short revision it could become a solid paper for the approximation-theory audience.","headline":"Fast-decaying polynomial reproduction is a worthwhile generalization; Theorem 2's constant has a repairable flaw, and the ℓ1 scheme is a genuinely new contribution.","tokens_in":17809,"tokens_out":3970,"would_cite":true,"duration_ms":35701,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["41A05","41A10","41A25","65D05","65D15"],"pacs":[],"model":"deepseek-v4-flash","headline":"Replacing compactly supported basis functions by fast-decaying ones still yields stable quasi-interpolants that reproduce polynomials and converge at order $O(h^{m+1})$ on quasi-uniform node sets.","keywords":["polynomial reproduction","fast-decaying basis functions","quasi-interpolation","moving least squares","linear programming approximation","Lebesgue constant","scattered data approximation","convergence rates"],"falsifier":"Take a fixed quasi-uniform sequence of nodes in three dimensions, set polynomial degree $m=5$ with a Gaussian weight, compute the basis functions from the moving least squares system, and measure the left-hand side of the decay bound (12) as the fill distance shrinks; if that quantity grows without bound, or if the $L_\\infty$ error against a $C^6$ test function does not track $h^6$ once $h$ falls below the stated threshold, then the convergence claim of the paper is false.","tokens_in":16768,"feed_emoji":"📈","tokens_out":8467,"duration_ms":84081,"temperature":0.7,"pith_summary":"Local polynomial reproduction usually demands compactly supported basis functions, and that excludes useful global kernels such as the rescaled localized radial basis functions. The paper proposes a relaxation: instead of vanishing outside a fixed ball, each basis function only has to decay fast relative to the separation distance of the node set. With that single change, quasi-interpolants that reproduce polynomials of degree $m$ are shown to be stable and to converge at rate $O(h^{m+1})$ on quasi-uniform data. The framework is instantiated on Gaussian moving least squares and on an $\\ell^1$ linear-programming scheme, both with explicitly derived decay envelopes, and the paper reports numerical confirmation in one and two dimensions.","feed_headline":"Fast-decaying kernels hit optimal quasi-interpolation order","feed_subtitle":"Gaussian MLS and LP quasi-interpolants reach order-optimal convergence once basis decay is tied to separation distance.","key_machinery":"The machinery is the decay envelope plus an annulus-counting estimate. Definition 4 requires each basis function to be bounded by $C \\varphi(\\|x-x_j\\|/q_X)$, where $\\varphi$ has the geometric-decay ratio condition $\\lim_{n\\to\\infty} \\varphi(n+1)/\\varphi(n) < 1$. Theorem 2 partitions the domain into annuli $\\{n q_X \\le \\|x-x_j\\| \\le (n+1)q_X\\}$, counts at most $3^d (n+1)^{d-1}$ nodes in each annulus, and sums the weighted decay; the geometric ratio condition makes the series $K = 3^d C \\sum_{n=0}^\\infty (n+1)^{d+\\ell-1}\\varphi(n)$ converge. That weighted-moment estimate is the input to a Taylor-expansion proof in Theorem 3. For the two instantiations, the local polynomial reproduction theorem supplies an admissible competitor in the moving least squares or linear-programming optimization problem, which forces the optimized basis functions to inherit a Gaussian or exponential envelope with constants $C$ and $\\varphi$ stated explicitly in (12) through (17).","core_discovery":"The paper's central claim is that the essential content of local polynomial reproduction is not compact support but controlled decay: Definition 4 asks for $|u_j(x)| \\le C \\varphi(\\|x-x_j\\|/q_X)$ with $\\varphi$ decaying faster than any geometric progression. Under this condition, Theorem 2 bounds every weighted moment sum $\\sum_j \\|x-x_j\\|^\\ell |u_j(x)|$ by a constant times $q_X^\\ell$, which gives a uniform stability estimate, and Theorem 3 converts that into the optimal algebraic error bound $K h_{X,\\Omega}^{m+1}\\|f\\|_{C^{m+1}(\\Omega^*)}$ for $C^{m+1}$ functions. The two concrete methods, Gaussian moving least squares and the $\\ell^1$ linear program, are proved to satisfy Definition 4 by using a classical local polynomial reproduction basis as a feasible comparison point, yielding explicit exponential envelopes. This recovers and extends the RL-RBF convergence analysis and puts smooth global-kernel quasi-interpolants on the same footing as compactly supported ones.","pith_inferences":["Beyond the paper, one could test kernels outside the two examples, such as Matérn or inverse multiquadric functions, by checking whether their tails satisfy the Definition 4 ratio condition; the same theorems would then give rates and stability without new proofs.","The explicit constant $K$ in (5) suggests a concrete optimization problem: among admissible envelopes $\\varphi$ with a fixed budget for the Lebesgue constant, choose the one minimizing the error constant.","The $\\ell^1$ scheme's sparse vertex representation at each point hints at a connection to compressed sensing: on random node sets one could ask whether the polynomial-reproducing subset selected by the simplex method is unique and stable under noise.","For algebraic decay, the paper's threshold conditions imply a sharp stability phase transition in the exponent $k$; a systematic numerical scan across $k$ and dimension $d$ would map where the method switches from convergent to divergent."],"forward_implications":["Any method whose basis functions satisfy the decay condition of Definition 4 automatically has uniformly bounded Lebesgue constants and the same optimal order $h^{m+1}$ error, independent of how the basis functions are constructed.","Gaussian moving least squares gives a $C^\\infty$ approximant that converges at the optimal rate, addressing the usual non-convergence of fixed-parameter Gaussian approximate-approximation schemes by tying the scale $\\delta$ to the data distribution.","The $\\ell^1$ scheme produces vertex solutions of a linear program, so at each evaluation point at most $Q = \\dim \\pi_m(\\mathbb{R}^d)$ basis functions are nonzero; evaluation costs $O(N)$ to build and $O(Q)$ to apply.","The framework includes algebraic-decay kernels as a degenerate limit, with explicit thresholds on the decay exponent needed for stability and convergence.","The RL-RBF method is subsumed as a special case, so its convergence proof can be read through Definition 4 rather than through compact support."],"supporting_citations":[{"why":"Supplies the local polynomial reproduction theorem with constants $C_1,C_2,h_0$ that Theorems 4 and 5 rely on.","marker":"[Wen04]"},{"why":"Provides the stability bound and RL-RBF convergence analysis that Theorem 2 directly generalizes.","marker":"[DW20]"},{"why":"Introduces the rescaled localized radial basis function method that motivates the fast-decaying framework.","marker":"[DFQ14]"},{"why":"Gives the earlier quasi-interpolation theory for noncompactly supported functions whose decay constraints this framework extends.","marker":"[LC92]"},{"why":"Shepard's method appears as the $m=0$ special case of the moving least squares construction in equation (10).","marker":"[She68]"},{"why":"Provides the moving least squares method used as the first concrete instantiation in Section 4.","marker":"[LS81]"},{"why":"Supplies the simplex method whose vertex solutions guarantee that at most $Q$ basis functions are nonzero in the $\\ell^1$ scheme.","marker":"[Kar08]"}],"fun_headline_variants":["No compact support needed: fast decay hits optimal order","Decay, not support, drives optimal approximation order","Gaussian MLS and LP achieve optimal order via tailored decay","Controlled decay yields order-optimal quasi-interpolation","Tie basis decay to separation distance for optimal methods"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that the classical local polynomial-reproduction basis used to seed the proofs exists with constants that do not grow destructively as the target polynomial degree or the dimension grows; if they do, the fast decay rates derived become too weak to guarantee the advertised convergence.","fun_headline_variants_meta":{"raw":{"variants":["No compact support needed: fast decay hits optimal order","Decay, not support, drives optimal approximation order","Gaussian MLS and LP achieve optimal order via tailored decay","Controlled decay yields order-optimal quasi-interpolation","Tie basis decay to separation distance for optimal methods"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000231,"raw_usage":{"total_tokens":1479,"prompt_tokens":931,"completion_tokens":548,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":547,"completion_tokens_details":{"reasoning_tokens":471}},"tokens_in":547,"tokens_out":548,"duration_ms":5573,"temperature":1.0,"reasoning_tokens":471,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T14:43:27.561496+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take a fixed quasi-uniform sequence of nodes in three dimensions, set polynomial degree $m=5$ with a Gaussian weight, compute the basis functions from the moving least squares system, and measure the left-hand side of the decay bound (12) as the fill distance shrinks; if that quantity grows without bound, or if the $L_\\infty$ error against a $C^6$ test function does not track $h^6$ once $h$ falls below the stated threshold, then the convergence claim of the paper is false.","supporting_citations":[],"review_version":1}