{"id":"4c921220-11a4-492a-9f4f-4a9ca465f409","arxiv_id":"2501.07700","paper_version":4,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":5,"one_line_summary":"Adaptive collocation point selection for PINNs via QR-DEIM residual snapshots reduces relative L2 error on wave, convection, Allen-Cahn, and Burgers' benchmarks.","lead":"This paper introduces two ways to choose where a physics-informed neural network enforces a PDE during training, using a numerical linear algebra tool called QR-DEIM. The methods adaptively concentrate training points in difficult regions, and they report lower errors than existing adaptive sampling strategies on four benchmark equations.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Unequal baseline point budgets in Table 1 undermine the controlled comparison on which the central claim rests.","rationale":"The reader identified 'uneven baseline point budgets' as a secondary issue but chose the SVD/QR-pivot heuristic as the weakest assumption. I agree that the heuristic lacks theoretical grounding, but the more immediately load-bearing concern is the fairness of the empirical comparison. The central claim is explicitly comparative: QR-DEIM methods 'consistently yield lower errors than existing techniques.' A comparative claim requires a controlled comparison. Table 1 reveals that the baselines are not run under equal collocation-point budgets: RAR-G and RAR-D spend most of training with 1,000 points, while QR-DEIM always has 2,000; PINNACLE grows to 11,000. This violates the paper's stated goal of isolating the sampling strategy. The confound is severe because PINN accuracy generally improves with more collocation points, so the baselines are disadvantaged (or, in PINNACLE's case, advantaged) for reasons orthogonal to the algorithm being tested. The concrete test—rerunning with equal budgets—is straightforward and would settle whether the claim holds. The reader's chosen weakest assumption, by contrast, is harder to test directly and is not necessarily wrong: many adaptive heuristics in PINNs lack error bounds yet work empirically. Given that the paper's own evidence is the primary support for the claim, the budget confound is the most load-bearing unresolved issue. I therefore recommend keeping the CONDITIONAL verdict: the paper should release code and rerun the baselines under a fixed point budget before the comparative claim can be accepted. My agreement with the reader is partial because we both flag the budget issue, but I elevate it over the SVD heuristic as the decisive risk.","tokens_in":17199,"tokens_out":8595,"duration_ms":83619,"concrete_test":"Re-run all four benchmark experiments holding the number of collocation points fixed at 2,000 for every method at every training stage. For RAR-G and RAR-D, initialize with 2,000 points and add zero points per update (or add a pruning mechanism to keep the budget fixed); for PINNACLE, cap the total at 2,000 points. Use the same network, optimizer, learning-rate schedule, validation-based checkpointing, and 10-run protocol as in Section 2.3. Then compare the mean relative L2 errors in Table 2. If QR-DEIM/QR-DEIM-R no longer achieve lower errors on all four benchmarks, the reported advantage is an artifact of unequal point budgets; if they still win, the central claim survives this confound.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper's central claim, stated in the abstract and Section 4, is that QR-DEIM and QR-DEIM-R 'consistently yield lower errors than existing techniques.' To support this, the experiments must isolate the sampling strategy from other factors, and Section 2.3 explicitly says 'To isolate the effects of the sampling strategies.' However, Table 1 shows that the baseline methods do not use the same number of collocation points as QR-DEIM/QR-DEIM-R. QR-DEIM and QR-DEIM-R initialize with 2,000 points and maintain a fixed budget of 2,000 via pruning. In contrast, RAR-G and RAR-D start with only 1,000 points and add 10 per update every 1,000 iterations; over a 100,000-iteration run they only reach 2,000 points at the final update. PINNACLE also starts at 1,000 and adds 100 per update, growing to 11,000 points. Thus, during most of training, RAR-G and RAR-D operate with half the collocation points of the proposed methods, while PINNACLE eventually operates with many more. The text's statement 'We use 2,000 collocation points for all of our benchmark PDEs' is contradicted by Table 1. If the baselines are not given the same point budget, the observed accuracy differences may reflect the number of collocation points rather than the sampling strategy, directly undermining the comparative claim. This is a concrete, checkable confound, not a theoretical objection: the central claim would require equal point budgets to be verified.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes two adaptive collocation point selection strategies for physics-informed neural networks, based on the QR-DEIM algorithm and a randomized variant. The methods build a residual snapshot matrix over a separate snapshot set during training, use an SVD to identify dominant residual modes, and select new collocation points via QR column pivoting, while pruning converged training points. The authors evaluate the methods on the wave, convection, Allen-Cahn, and Burgers' equations, compare against fixed and adaptive baselines, and report mean relative L2 errors over ten runs, together with ablations on the energy threshold, rank, snapshot count, and snapshot period. The central claim is that the proposed strategies consistently achieve lower errors than existing techniques.","tokens_in":17557,"tokens_out":6576,"duration_ms":61757,"significance":"If the empirical claim holds, the paper makes a useful contribution by importing reduced-order modeling tools into PINN collocation sampling, with a concrete algorithm and extensive ablations. The experimental protocol has strengths: ten runs per configuration, a common test grid, validation-based model selection, and ablations over several hyperparameters. The main limitations are that the comparison does not hold the collocation point budget constant across baselines, that the margins on two of the four benchmarks are small relative to the reported standard deviations, and that the results are restricted to one-dimensional problems with a single optimizer and network architecture. The proposed heuristic is plausible but is not supported by an error bound or convergence analysis; its value rests on the empirical evidence.","major_comments":[{"comment":"The stated goal 'To isolate the effects of the sampling strategies' is not met because the baseline methods are not given the same collocation point budget as the proposed methods. RAR-G and RAR-D begin with 1,000 points and add 10 every 1,000 iterations, so over a 100,000-iteration run they reach 2,000 points only at the final update; PINNACLE starts at 1,000 and adds 100 per update, ending at 11,000 points. The proposed QR-DEIM methods maintain a fixed budget of 2,000 points throughout. The sentence 'We use 2,000 collocation points for all of our benchmark PDEs' is therefore contradicted by Table 1. As a result, the accuracy differences in Table 2 may reflect the number of collocation points rather than the sampling strategy. Please rerun the comparison with matched point budgets, or provide an explicit control showing that the budget difference does not drive the reported improvements.","section":"Section 2.3, Table 1"},{"comment":"The central claim that QR-DEIM and QR-DEIM-R 'consistently yield lower errors than existing techniques' is not supported by appropriate statistical evidence. On the Allen-Cahn benchmark, QR-DEIM-R gives 3.85e-03 (1.87e-03) versus RAR-G at 5.14e-03 (9.35e-04); on Burgers' equation, QR-DEIM gives 5.96e-04 (7.07e-05) versus RAR-D at 7.31e-04 (1.78e-04). In both cases the difference is smaller than the combined standard deviation with n=10, so the advantage may not be statistically significant. The paper reports only means and standard deviations and does not perform significance tests or effect-size calculations. Please add such analyses or temper the 'consistently' claim for benchmarks where the improvement is marginal.","section":"Table 2, Section 4"}],"minor_comments":[{"comment":"The notation 'min {i = 1,...,P | ...}' should be phrased as 'the smallest i in {1,...,P} such that ...' to avoid ambiguity about whether the set is over i or over a condition.","section":"Section 2.2, Eq. (15)"},{"comment":"The statement 'We observe similar patterns of robustness across the other benchmark problems' is not accompanied by tables or figures for the other problems; please provide the data or explicitly label this as a qualitative observation.","section":"Section 3.5"},{"comment":"The runtime comparison with baseline adaptive methods is informal; reporting measured wall-clock times for each method would make the claim 'roughly in the middle of the spectrum' concrete.","section":"Section 3.6"},{"comment":"Adding error bars or shaded regions across the ten runs would help the reader assess whether the temporal concentration behavior is consistent.","section":"Figures 3 and 5"},{"comment":"The manuscript does not include a reproducibility statement or code release; providing code and random seeds would strengthen the empirical claims.","section":"General"}],"recommendation":"major_revision","confidential_remarks":"The stress-test concern about unequal collocation-point budgets is valid and is the main obstacle to publication. The paper's strengths are a clear methodology and careful ablations, but the comparative evaluation needs to be redone with matched budgets, and the small margins on Allen-Cahn and Burgers need statistical support. The paper is within scope for a machine-learning venue, but the current version is unlikely to be acceptable without these changes."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"First, the novel bit: this is the first use of QR-DEIM for forward PINN collocation sampling. The authors take residual snapshots over training, do an SVD, and use QR column pivoting to pick new points, plus a pruning rule that removes converged points. There is also a randomized variant that cuts update cost. That is a reasonable, well-motivated idea, and the writing is clear.\n\nWhat the paper does well: the experimental protocol is careful in several ways - 10 runs per method, same test grid, validation-based model selection, and ablations on epsilon, rank, snapshot count, and period. The adaptive behavior is visually plausible: the method concentrates points where the shock or front is. The randomized variant tracks the full QR-DEIM results closely, which is good evidence the randomization is not hurting.\n\nThe soft spots are real, and one is load-bearing. Section 2.3 says \"We use 2,000 collocation points for all of our benchmark PDEs,\" but Table 1 shows RAR-G and RAR-D start with 1,000 and add 10 per update every 1,000 iterations. Over a 100,000-iteration run they only reach 2,000 at the final update, so for most of training they have half as many collocation points as QR-DEIM. PINNACLE starts at 1,000 and adds 100 per update, growing to 11,000 points. That means the comparisons do not isolate the sampling strategy, despite the stated intention. The accuracy gap between QR-DEIM and RAR-G/D could partly be the point count. This needs to be fixed by recomputing with equal point budgets, for example by giving RAR-G/D 2,000 initial points or matching total compute.\n\nThe other issues are minor by comparison. No code is released, which matters because PINN sampling papers live or die on reproducibility of the exact schedule. The theoretical grounding is thin - there is no error bound connecting residual subspace selection to solution error - but the paper does not claim one, and the ablations show robustness to hyperparameters. The benchmarks are all 1D, so calling the method \"generalizable\" is overreach, but that is a scope limit, not a flaw.\n\nWho is this for? PINN practitioners who want an adaptive sampling method that tracks temporal dynamics. It deserves a serious referee, but the manuscript needs a revision that fixes the point budget confound and releases code.\n\nMy recommendation: send to peer review, with the explicit expectation that the comparison be redone under equal point budgets. If the advantage survives that, it is a useful contribution.","headline":"A well-run empirical study of a genuinely new QR-DEIM sampling scheme, but the headline accuracy advantage is not clean because baseline point budgets differ.","tokens_in":18045,"tokens_out":2395,"would_cite":true,"duration_ms":21601,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper claims that adaptive collocation point selection driven by QR-DEIM on residual snapshots consistently lowers PINN errors on wave, convection, Allen-Cahn, and Burgers' equations compared with fixed and existing adaptive sampling…","keywords":["physics-informed neural networks","partial differential equations","QR-DEIM","adaptive collocation point selection","residual-based sampling","reduced-order modeling","randomized SVD"],"falsifier":"On a benchmark with a known solution, after training for a fixed number of iterations, compare the QR-DEIM-selected snapshot points against points with the largest pointwise residual magnitudes and against random points; if the QR-DEIM points do not yield a lower validation error when added as collocation points, or if they systematically miss regions where the error is largest, the central claim fails.","tokens_in":17031,"feed_emoji":"🎯","tokens_out":6579,"duration_ms":55901,"temperature":0.7,"pith_summary":"Physics-informed neural networks solve PDEs by minimizing a residual loss on a set of collocation points, and the choice of those points strongly affects accuracy. This paper argues that fixed sampling, and even existing adaptive schemes that react to the current residual, miss useful information about how the residual evolves during training. It proposes two adaptive strategies, QR-DEIM and its randomized variant QR-DEIM-R, which build a matrix of residual snapshots over a training window, extract its dominant left singular vectors, and use QR column pivoting to select new collocation points that best represent the residual dynamics. On the wave, convection, Allen-Cahn, and Burgers' equations, both strategies consistently achieve lower relative $\\ell^2$ errors than fixed, resampling, and residual-based adaptive baselines, and the randomized variant does so at a lower per-update cost.","feed_headline":"Adaptive QR-DEIM collocation cuts PINN errors on four PDEs","feed_subtitle":"Residual snapshot dynamics guide new training points, beating fixed and existing adaptive methods on key benchmarks.","key_machinery":"The central object is the residual snapshot matrix $R \\in \\mathbb{R}^{N_{\\text{snapshot}} \\times P}$, whose columns are pointwise PDE residuals evaluated over a fixed snapshot set during $P$ training iterations. The method computes its SVD $R = V \\Sigma W^{\\mathsf T}$, keeps the leading $k$ left singular vectors where $k$ satisfies an energy threshold, and applies QR decomposition with column pivoting to $V_k^{\\mathsf T}$. The pivot indices select the snapshot points that form the new training points, mirroring how QR-DEIM selects interpolation indices for nonlinear model reduction. The accompanying convergence-degree vector $d = \\log_2(\\hat{r}_{\\text{old}} / \\hat{r}_{\\text{new}})$ prunes training points whose residuals have decreased most, and QR-DEIM-R replaces the SVD with a randomized SVD and pivoting with a column-norm-weighted random sample, reducing the update complexity.","core_discovery":"The paper's central claim is that the leading singular vectors of a residual snapshot matrix, combined with QR column pivoting, identify the space-time locations at which a PINN most needs new collocation points, and that acting on this information at regular intervals yields more accurate solutions than either fixed sampling or residual-based adaptive methods that only look at the current residual field. Concretely, after every P training iterations the method evaluates the PDE residual at a separate snapshot set, stacks these evaluations into a matrix, truncates its SVD to the modes capturing a specified energy fraction, and applies pivoted QR to the transposed mode matrix to select the snapshot points whose indices become new training points. It simultaneously removes training points whose residuals have decayed most, keeping the set size fixed. A randomized variant replaces the SVD and pivot selection with randomized linear algebra to cut update costs. Across four benchmark PDEs the method is reported to consistently yield lower mean relative $\\ell^2$ errors than uniform, Hammersley, resampling, RAR-G, RAR-D, RAD, R3, and PINNACLE baselines.","pith_inferences":["If the dominant left singular vectors of residual snapshots are indeed a good proxy for where error concentrates, the same snapshot-subspace strategy could be ported to other neural PDE solvers, such as those using different loss weightings or operator learning, with minimal changes.","The observed early-time concentration for the convection equation resembles the effect of causality-weighted training, but here it arises purely from the sampling rule; an explicit comparison against causal training would reveal whether the two mechanisms are complementary or redundant.","The method's robustness to $\\varepsilon$ and $k$ across 1D benchmarks suggests it may generalize to 2D or 3D problems, but the paper only tests 1D; testing on a 2D problem with a known solution would be the natural next step.","Since the pruning rule only removes points whose residual has decreased, it cannot detect regions where the residual is stagnating; a stagnation-aware criterion might further improve the update policy."],"forward_implications":["PINN users can adopt QR-DEIM or QR-DEIM-R without changing architecture, loss, or optimizer; the sampling strategy is the only modification.","The methods automatically concentrate points in early-time regions for wave and convection problems and near sharp fronts for Allen-Cahn and Burgers, suggesting they can replace manual time-marching or domain decomposition.","The randomized variant's lower update cost makes it the scalable choice for larger snapshot sets or higher-dimensional PDEs, while matching the accuracy of the full QR-DEIM on the tested benchmarks.","Both methods reach lower validation loss in fewer iterations than fixed sampling, so the modest per-iteration overhead can be offset by faster convergence.","The energy threshold $\\varepsilon$ and target rank $k$ have weak influence on accuracy over tested ranges, so default hyperparameters transfer across the four benchmarks."],"supporting_citations":[{"why":"Provides the QR-DEIM selection operator with pivoted QR, used in Algorithm 1 to choose new collocation point indices.","marker":"[22]"},{"why":"Introduces DEIM for nonlinear model reduction, the framework that the QR-DEIM variant builds on.","marker":"[21]"},{"why":"Supplies the randomized SVD that QR-DEIM-R uses to approximate the leading singular vectors at lower cost.","marker":"[33]"},{"why":"Defines the RAR-G, RAR-D, and RAD baselines and the candidate-pool protocols that QR-DEIM is compared against.","marker":"[8]"},{"why":"Defines the R3 sampling strategy, a comparison baseline whose retain-resample-release idea is contrasted with the paper's pruning.","marker":"[19]"},{"why":"Defines PINNACLE, the NTK-based adaptive sampling baseline.","marker":"[20]"},{"why":"Introduces the PINN formulation whose residual loss and collocation points are the object of the study.","marker":"[3]"},{"why":"Introduces residual-based adaptive refinement in PINNs, the ancestor of the adaptive methods compared here.","marker":"[2]"}],"fun_headline_variants":["QR-DEIM adaptive collocation lowers PINN errors on four PDEs","Residual SVD guides new PINN training points, cuts error","Randomized QR-DEIM makes PINN collocation updates cheaper","Adaptive PINN collocation: singular vectors beat fixed sampling","QR-DEIM selects PINN points from residual snapshots, wins"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that the snapshot points singled out by QR-DEIM's pivoted QR on the residual's dominant modes are the locations where adding collocation points will actually reduce the network's error, a connection the paper verifies only empirically on four one-dimensional benchmarks.","fun_headline_variants_meta":{"raw":{"variants":["QR-DEIM adaptive collocation lowers PINN errors on four PDEs","Residual SVD guides new PINN training points, cuts error","Randomized QR-DEIM makes PINN collocation updates cheaper","Adaptive PINN collocation: singular vectors beat fixed sampling","QR-DEIM selects PINN points from residual snapshots, wins"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.00027,"raw_usage":{"total_tokens":1627,"prompt_tokens":948,"completion_tokens":679,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":564,"completion_tokens_details":{"reasoning_tokens":586}},"tokens_in":564,"tokens_out":679,"duration_ms":6638,"temperature":1.0,"reasoning_tokens":586,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-10T20:36:27.627268+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"On a benchmark with a known solution, after training for a fixed number of iterations, compare the QR-DEIM-selected snapshot points against points with the largest pointwise residual magnitudes and against random points; if the QR-DEIM points do not yield a lower validation error when added as collocation points, or if they systematically miss regions where the error is largest, the central claim fails.","supporting_citations":[{"cited_title":"DeepXDE: A deep learning library for solving differential equations,","cited_arxiv_id":null,"evidence_quote":"Introduces residual-based adaptive refinement in PINNs, the ancestor of the adaptive methods compared here."},{"cited_title":"A new selection operator for the discrete em- pirical interpolation method—improved a priori error bound and exten- sions,","cited_arxiv_id":null,"evidence_quote":"Provides the QR-DEIM selection operator with pivoted QR, used in Algorithm 1 to choose new collocation point indices."},{"cited_title":"Nonlinear model reduc- tion via discrete empirical interpolation,","cited_arxiv_id":null,"evidence_quote":"Introduces DEIM for nonlinear model reduction, the framework that the QR-DEIM variant builds on."},{"cited_title":"A comprehensive study of non-adaptive and residual-based adaptive sampling for physics- informed neural networks,","cited_arxiv_id":null,"evidence_quote":"Defines the RAR-G, RAR-D, and RAD baselines and the candidate-pool protocols that QR-DEIM is compared against."},{"cited_title":"Miti- gating propagation failures in physics-informed neural networks us- ing retain-resample-release (R3) sampling,","cited_arxiv_id":null,"evidence_quote":"Defines the R3 sampling strategy, a comparison baseline whose retain-resample-release idea is contrasted with the paper's pruning."},{"cited_title":"PIN- NACLE: PINN adaptive collocation and experimental points selection,","cited_arxiv_id":null,"evidence_quote":"Defines PINNACLE, the NTK-based adaptive sampling baseline."},{"cited_title":"Physics-informed neu- ral networks: A deep learning framework for solving forward and inverse problems involving nonlinear partial differential equations,","cited_arxiv_id":null,"evidence_quote":"Introduces the PINN formulation whose residual loss and collocation points are the object of the study."}],"review_version":1}