{"id":"c5463830-8ae0-4fd0-98d8-4971f820d877","arxiv_id":"2501.01621","paper_version":1,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":5,"one_line_summary":"A component-based reduced basis method with empirical quadrature hyperreduction and BRR-based online adaptive fidelity selection that achieves a user-specified RB-versus-HRBE error target.","lead":"This paper introduces a hyperreduced reduced basis element method that assembles pretrained nonlinear component models on the fly to simulate large parameterized systems. The method selects each component's reduced-quadrature fidelity online, guided by a Brezzi-Rappaz-Raviart error estimate, to meet a user-set error tolerance.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The error bound in Proposition 6 requires residual/Jacobian bounds (15)-(16) and Lipschitz condition (18) at the online configuration, none of which Algorithm 3 verifies; the abstract's 'for any topological and parametric configuration' is thus not certified.","rationale":"The paper develops a genuinely useful method with a sound conditional theory and convincing numerical evidence. However, the strongest claim—that the adaptive procedure guarantees the hyperreduction error meets a user-prescribed tolerance for any topological and parametric configuration—is supported only by Proposition 6, whose hypotheses are not verified online. The reader's weakest assumption correctly identifies this gap: Algorithm 3 checks algebraic conditions on training tolerances, but never verifies the actual residual and Jacobian bounds at the online configuration, nor the Lipschitz condition. My stress-test confirms this is the most load-bearing concern: if (15)–(16) or (18) fail for an unseen configuration, the bound (22) does not follow, and the abstract's 'for any' claim is an overstatement. The numerical experiments, while encouraging, only test a handful of configurations and cannot certify the universal claim. I did not find a deeper internal inconsistency in the proof of Proposition 6 itself; the conditional theorem is correct as stated. The paper could be improved by explicitly qualifying the guarantee as conditional on training representativity and the unverified conditions, or by adding a computable online check of the residual and Jacobian bounds. This would not change the scientific contribution but would align the abstract with what is actually established. Hence the reader's CONDITIONAL verdict is appropriate and my read does not change it.","tokens_in":30483,"tokens_out":8120,"duration_ms":77502,"concrete_test":"For a held-out configuration not used in training (e.g., Nfin = 4 with random parameters), run Algorithm 3 to convergence, then solve the full truth-quadrature RB problem (6) to obtain urb(µ). With the RQ rules selected by Algorithm 3, compute for each component c the left-hand sides of (15) and (16) at ū = urb(µ), and compare them to the δc values used by the algorithm; if any component violates the bound, the hypotheses of Proposition 6 are not satisfied and the claimed error bound (22) is not certified. Additionally, sample the ball of radius α̅ to estimate L(α̅) in (17) and check condition (18); if it fails, the BRR theorem cannot be invoked.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim (contribution 4, embodied in Proposition 6 and Corollary 7) is a guaranteed bound ||urb(µ) − eurb(µ)||_V ≤ (α̅ + ε̅)√λmax only if the component-wise inequalities (15), (16), and the Lipschitz condition (18) hold at the online RB solution ū = urb(µ). Algorithm 3 never computes these quantities. In fact, (15)–(16) are evaluated at ū = urb, the truth-quadrature RB solution, which the online phase deliberately does not solve; the algorithm only has access to eurb. The δRc and δJc values it adjusts are training tolerances from the EQP constraints (27)–(28), which are enforced on training snapshots, not on the unseen online configuration. Thus the loop's stopping check only ensures that certain algebraic inequalities involving these tolerances hold; it does not ensure that the actual online residuals and Jacobian deviations are bounded by the chosen δc. The Lipschitz condition (18) is not checked at all. Consequently, the algorithm can converge while the hypotheses of Proposition 6 are false, and the claimed bound does not follow. Section 4.1 explicitly calls the training representativity assumption the 'fundamental assumption,' but the abstract and contribution 4 state the guarantee 'for any topological and parametric configuration' without this caveat. The numerical results validate accuracy empirically on a few test configurations, but they cannot certify arbitrary configurations. This makes the headline guarantee conditional in a way the abstract does not convey.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper introduces a hyperreduced reduced basis element (HRBE) method for component-based nonlinear parametrized PDEs. Offline, the method builds a library of archetype components, each equipped with a component-wise reduced basis and a family of hyperreduced quadrature rules of varying fidelity, constructed by an extension of the empirical quadrature procedure (EQP) to the component-based setting. Online, an adaptive procedure informed by the Brezzi-Rappaz-Raviart (BRR) theorem selects the hyperreduction fidelity for each component so that the hyperreduction error in the assembled system is claimed to meet a user-prescribed tolerance. The method is demonstrated on two-dimensional nonlinear thermal fin systems with up to 225 components and 68 independent parameters, reporting accuracy and speedups. The central theoretical result is Proposition 6 and Corollary 7, which bound the difference between the RB and HRBE solutions in terms of component-wise residual and Jacobian tolerances and a Lipschitz condition.","tokens_in":30761,"tokens_out":5968,"duration_ms":58375,"significance":"If the claimed guarantee holds, the paper makes a valuable contribution: it extends component-based reduced basis methods from linear or locally nonlinear settings to globally nonlinear problems, while providing a quantitative, system-level mechanism for controlling hyperreduction error. The derivation of the BRR-based error estimate in Proposition 6 is careful and the numerical validation is thorough, including effectivity tables, parameter sweeps, and scaling studies across system sizes. The component-wise EQP training is a natural and useful extension of prior work, and the reported speedups are meaningful even without port reduction. The main gap is between the conditional theory and the unverified online algorithm; the numerical evidence is strong but does not by itself establish the 'for any topological and parametric configuration' guarantee stated in the abstract.","major_comments":[{"comment":"Algorithm 3's stopping criterion does not verify the hypotheses of Proposition 6 at the online configuration. Conditions (15) and (16) are enforced during offline training only on the training snapshots through constraints (27)–(28), and the online component-wise residual and Jacobian deviations at eurb(µ) are never computed. Condition (18) on the Lipschitz constant L(α) is not checked at all. Moreover, the algorithm applies Proposition 6 with ¯urb = urb (as stated in Section 5.2), but urb is not available online; only eurb is. Consequently, the algorithm can terminate while the assumptions of Proposition 6 are false, so the bound (22) is not certified. The numerical results in Table 5 demonstrate that the target is met on the tested configurations, but they do not support the unconditional claim in the abstract and in contribution 4 that the error tolerance is met 'for any topological and parametric configuration.'","section":"Section 5.2, Algorithm 3 and Proposition 6"},{"comment":"The replacement of σmin(Jrb(urb(µ); µ)) by σmin(eJrb(eurb(µ); µ))/2 is heuristic. The factor 1/2 relies on inequality (29), which follows from the BRR theorem only if the BRR hypotheses hold for G = Rrb and v = eurb(µ); these hypotheses are not verified by Algorithm 3. Lemma 10 bounds the difference between σmin(Jrb(eurb)) and σmin(eJrb(eurb)), but the algorithm requires control at urb(µ), not merely at eurb(µ). The numerical evidence in Tables 4 and 6 supports the approximation empirically for the cases tested, but it does not establish the 'for any configuration' guarantee claimed in the paper.","section":"Section 5.2, Eq. (29) and Lemma 10"},{"comment":"The guarantee for arbitrary topological and parametric configurations rests on the 'fundamental assumption' stated in Section 4.1 that the randomly generated training subsystems in Algorithm 1 (with Nsample = 100 and β = 0.8) sufficiently represent all potential online configurations. The paper acknowledges this assumption explicitly in Section 4.1, but the abstract and contribution 4 present the guarantee without this caveat. The authors should either weaken the claims to conditional guarantees or provide an additional mechanism for verifying or estimating the representativity and the BRR conditions online; as written, the stated certainty is not supported.","section":"Section 4.1 and abstract"}],"minor_comments":[{"comment":"In the definitions of λmin and λmax in (21), the infimum and supremum are taken over V, but the coordinate norm ∥v∥2 is only defined for functions whose generalized coordinates are available, i.e., functions in Vrb (or possibly Vh). This should be clarified, for instance by stating that the constants are computed over the truth space Vh and hence provide conservative bounds for the RB subspace.","section":"Section 3.2, Corollary 7 and Eq. (21)"},{"comment":"In inequality (20), the term δJ_{M(c)} should be δJc for consistency with the hypotheses of Proposition 6, since δJc is defined for each instantiated component c ∈ C; the same notational slip appears in the definition of ε just below the display following (20).","section":"Section 4.4, proof of Proposition 6"},{"comment":"The initial hyperreduction tolerances δc in Line 3 of Algorithm 3 are 'selected' without guidance. A sentence or small remark on how to choose these values (e.g., starting from the coarsest available tolerance and refining) would improve reproducibility.","section":"Section 5.2, Algorithm 3"},{"comment":"Table 5 reports the maximum relative errors and the text gives effectivities from 1.315 to 33.602, but the table itself has no effectivity column. Adding such a column would help the reader assess the sharpness of the error bound across system sizes.","section":"Section 6.5, Table 5"},{"comment":"The notation for the reduced quadrature rule, rendered as eQr and eQf, is unusual and slightly awkward; a tilde-based notation (e.g., \\(\\widetilde{Q}^r\\)) would be more conventional and easier to read.","section":"Throughout"}],"recommendation":"major_revision","confidential_remarks":"The paper is technically solid in its core derivations and the numerical study is convincing; the main issue is the gap between the conditional error estimate and the unverified online algorithm, which makes the headline guarantee overstrong. This is repairable within the scope of the manuscript by carefully restating the claims as conditional on the representativity assumption and on the BRR hypotheses, or by adding an online verification step. The authors are reputable and the work fits CMAME well. I see no indication of authorship or citation misconduct; self-citations to the EQP line are appropriate."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Colleague,\n\nHere's the short version: this is a good paper that deserves a serious referee. It develops a hyperreduced reduced basis element method for nonlinear component-based systems, combining component-wise empirical quadrature (EQP) with an online adaptive selection of hyperreduction fidelity informed by the Brezzi-Rappaz-Raviart theorem. The component-wise training of multi-fidelity quadrature rules and the BRR-based system-level error bound are genuinely new, and the numerical experiments on thermal fins (up to 225 components, 68 parameters) are convincing.\n\nThe strengths: the theory in Proposition 6 is derived carefully, and the numerics confirm the error behavior, including the effectivity tables. The circularity burden is low — the tolerances are user inputs, the reduced quadrature weights come from an LP/EQP optimization, and the validation is against independently solved truth systems. The paper is honest about the RB-versus-HRBE scope in Remark 11 and about the training representativity assumption in Section 4.1.\n\nThe soft spot, in proportion: the abstract's claim of meeting the error tolerance 'for any topological and parametric configuration' is stronger than what is actually certified. Algorithm 3 does not verify the Lipschitz condition (18) or the online residual/Jacobian bounds (15)-(16) at the actual configuration; it uses training tolerances δc and relies on the representative training assumption. The stress-test note is right that the bound in Proposition 6 is conditional in practice. Also, the controlled error is only between RB and HRBE, not between truth and RB. These are limitations, not fatal flaws, and they can be fixed by making the assumptions explicit in the abstract and conclusions, or by adding a verification step in Algorithm 3. The effectivity degrading for larger systems suggests the bound is conservative, but not broken.\n\nBottom line: this is for researchers in reduced-order modeling, especially component-based and nonlinear problems. It deserves a real review and, with revisions, publication. I would cite it.\n\nRecommendation: send to peer review, and push for revisions that temper the abstract and add a computational verification step or an explicit statement of the conditional nature.","headline":"A well-executed component-based ROM paper with a genuine new method; the main caveat is that the 'any configuration' guarantee in the abstract is conditional on training representativity and unverified Lipschitz assumptions, so the abstract slightly oversells.","tokens_in":31346,"tokens_out":2350,"would_cite":true,"duration_ms":23069,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["65N30","65N55"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper develops a hyperreduced reduced-basis-element method for component-based nonlinear systems that uses an online adaptive, Brezzi-Rappaz-Raviart-informed procedure to select per-component hyperreduction fidelity and guarantee a…","keywords":["reduced basis element method","hyperreduction","component-based model reduction","empirical quadrature procedure","Brezzi-Rappaz-Raviart error estimate","parameterized nonlinear PDEs","domain decomposition","thermal fin problem"],"falsifier":"Assemble hold-out thermal fin systems drawn from a distribution different from the training one (for instance, port-connection probability $\\beta \\neq 0.8$ or boundary conditions outside the $[1,250]$ K training range), run Algorithm 3 with a prescribed relative tolerance $\\epsilon=0.01$, and compute $\\sup_{\\mu \\in \\Xi_{\\text{test}}} \\|u_{rb}(\\mu)-\\tilde u_{rb}(\\mu)\\|_V / \\|u_{rb}(\\mu)\\|_V$. If any such configuration exceeds the tolerance, or if the ratio to the Corollary 7 bound exceeds one, then the representativity assumption or the assumed component-wise bounds fails and the guarantee is not unconditional.","tokens_in":30223,"feed_emoji":"🧩","tokens_out":14424,"duration_ms":129183,"temperature":0.7,"pith_summary":"This paper develops a reduced-order modeling method for component-based nonlinear systems that are too large or too topology-rich to train as a single model. The idea is to pretrain, once, a library of archetype components, each equipped with a reduced basis and a family of reduced quadrature rules of different fidelities, and then assemble a reduced model online for the particular system configuration by gluing instantiated components together. The central claim is that the hyperreduction error of the assembled system can be controlled quantitatively: an online adaptive procedure informed by the Brezzi-Rappaz-Raviart theorem selects each component's quadrature fidelity so that the error between the reduced and hyperreduced solutions stays within a user-prescribed tolerance in the solution norm, for any topological and parametric configuration that can be assembled from the library. If correct, this removes the need to retrain for each new configuration and makes many-query studies of nonlinear systems with many continuous and topology-varying parameters practical. The method is demonstrated on a nonlinear thermal fin system with up to 225 components and 68 independent parameters, where the adaptive procedure meets a 1% relative error target with about 40x speedup.","feed_headline":"Adaptive per-component hyperreduction hits user-set error targets","feed_subtitle":"Component libraries and an error-bound-guided rule pick per-part fidelity online, ~40x speedups on thermal fins.","key_machinery":"The load-bearing object is the Brezzi-Rappaz-Raviart (BRR) theorem, a nonlinear stability estimate that bounds the distance from a trial point to the nearby zero of a nonlinear map by the map's residual norm divided by the Jacobian's least singular value. The paper specializes it to component-assembled nonlinear systems in Proposition 6, yielding $\\|u_{rb}(\\mu)-\\tilde u_{rb}(\\mu)\\|_2 \\le \\bar{\\alpha} + \\bar{\\varepsilon}$ with $\\bar{\\alpha} = 2 \\sum_{c\\in C}\\sqrt{N_{M(c)}}\\,\\delta_{R_c} / (\\sigma - \\sum_{c\\in C} N_{M(c)}\\,\\delta_{J_c})$, and Corollary 7 converts this to the $V$-norm through $\\sqrt{\\lambda_{\\max}}$. Around this bound the method organizes two other pieces: a component-wise LP empirical quadrature procedure that builds, for each archetype component, a family of sparse reduced quadrature rules indexed by hyperreduction tolerances $\\delta_{b_c}$, and an online adaptive selection loop (Algorithm 3) that, using $\\sigma \\approx \\sigma_{\\min}(\\tilde J_{rb}(\\tilde u_{rb}))/2$, walks the component fidelities until the BRR condition fits the user tolerance.","core_discovery":"This work aims to establish that global nonlinearities, online-interchangeable components, and quantitative system-level error control can be combined in one reduced-order method. Previous component-based methods either assumed affine or localizable nonlinearities or lacked a way to control hyperreduction error at the system level. The paper's mechanism is a component-wise extension of LP empirical quadrature: each archetype component is trained offline with several hyperreduction tolerances, and online an adaptive loop (Algorithm 3) chooses, per component, the coarsest reduced quadrature rule such that the Brezzi-Rappaz-Raviart-based bound $\\|u_{rb}(\\mu) - \\tilde u_{rb}(\\mu)\\|_V \\leq (\\bar{\\alpha} + \\bar{\\varepsilon})\\sqrt{\\lambda_{\\max}}$ of Proposition 6 and Corollary 7 guarantees the user's tolerance. The component-wise residual and Jacobian tolerances $\\delta_{R_c}$ and $\\delta_{J_c}$ enter $\\bar{\\alpha}$, while $\\sigma$, the minimum singular value of the assembled RB Jacobian, is approximated online by half the minimum singular value of the hyperreduced Jacobian. On nonlinear thermal fin systems, the paper reports the adaptive procedure meeting a 1% relative error target, with effectivity between about 1.3 and 33.6 depending on system size.","pith_inferences":["A stress test for the method is to assemble hold-out configurations with port-connection statistics that differ from the $\\beta=0.8$ training process and check whether the component-wise residual and Jacobian bounds (15)-(16) still hold; the paper's guarantee depends on this representativity rather than on any online verification.","The same BRR-guided fidelity selection could be composed with port reduction or with online-adaptive RB selection, which the paper explicitly leaves to future work; the bounds are stated for the assembled system, so they should carry over if the port or RB spaces are enriched adaptively.","Because $\\bar{\\alpha}$ accumulates component tolerances linearly while $\\sigma$ is a single global quantity, the adaptive scheme could be made more efficient by allocating tighter tolerances to components with large $N_{M(c)}$ or large residual rather than using a common per-archetype $\\delta_c$ as in the numerical study.","For convection-dominated problems the BRR bound can become conservative, so a testable prediction is that effectivity of Algorithm 3 worsens as convective transport increases; the authors note this limitation for high-Reynolds-number flows."],"forward_implications":["A library is trained once and then reused for many topologies: the online solve time and storage scale with the number of archetypes and instantiated components, not with the truth finite-element mesh size or quadrature count.","The user can prescribe an absolute or relative error tolerance on the hyperreduction gap, and the adaptive procedure returns a per-component quadrature fidelity that meets it; in the reported tests it converged in two iterations.","Because training is component-wise, no global snapshots of a large assembled system are needed offline, so the approach extends reduced-order modeling to systems too large or too many-parametered for monolithic training.","The speedup is limited by the port degrees of freedom, which are not reduced here; the authors identify port reduction as the natural extension to reach the larger speedups reported for linear port-reduced methods."],"supporting_citations":[{"why":"Supplies the Brezzi-Rappaz-Raviart theorem that the system-level error bound in Proposition 6 is built on.","marker":"[32]"},{"why":"Establishes the LP empirical quadrature procedure for nonlinear reduced-basis problems that the component-wise hyperreduction training extends.","marker":"[31]"},{"why":"Introduces the LP empirical quadrature formulation for parametrized functions used to pose the component-wise hyperreduction optimization.","marker":"[30]"},{"why":"Provides the static condensation reduced-basis-element framework with bubble-port decomposition that the HRBE assembly inherits.","marker":"[11]"},{"why":"Introduces the reduced basis element method, the component-based construction that the hyperreduced library extends.","marker":"[8]"}],"fun_headline_variants":["Hyperreduced elements adapt per part to hit error targets","Component-wise hyperreduction with online error-bound control","Adaptive fidelity selection for component-based nonlinear ROMs","Error-bound-guided hyperreduction for modular nonlinear systems","Per-component hyperreduction that meets user error tolerances"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The guarantee rests on the training sample of 100 random subsystems being representative of every system a component will appear in, and on the per-component residual and Jacobian tolerance bounds (15)-(16), together with the Lipschitz condition (18), actually holding for the unseen online configuration; none of these are verified by the online algorithm.","fun_headline_variants_meta":{"raw":{"variants":["Hyperreduced elements adapt per part to hit error targets","Component-wise hyperreduction with online error-bound control","Adaptive fidelity selection for component-based nonlinear ROMs","Error-bound-guided hyperreduction for modular nonlinear systems","Per-component hyperreduction that meets user error tolerances"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001268,"raw_usage":{"total_tokens":5205,"prompt_tokens":978,"completion_tokens":4227,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":594,"completion_tokens_details":{"reasoning_tokens":4149}},"tokens_in":594,"tokens_out":4227,"duration_ms":27595,"temperature":1.0,"reasoning_tokens":4149,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-10T22:23:45.342472+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Assemble hold-out thermal fin systems drawn from a distribution different from the training one (for instance, port-connection probability $\\beta \\neq 0.8$ or boundary conditions outside the $[1,250]$ K training range), run Algorithm 3 with a prescribed relative tolerance $\\epsilon=0.01$, and compute $\\sup_{\\mu \\in \\Xi_{\\text{test}}} \\|u_{rb}(\\mu)-\\tilde u_{rb}(\\mu)\\|_V / \\|u_{rb}(\\mu)\\|_V$. If any such configuration exceeds the tolerance, or if the ratio to the Corollary 7 bound exceeds one, then the representativity assumption or the assumed component-wise bounds fails and the guarantee is not unconditional.","supporting_citations":[{"cited_title":"Numerical analysis for nonlinear and bifurcation problems,","cited_arxiv_id":null,"evidence_quote":"Supplies the Brezzi-Rappaz-Raviart theorem that the system-level error bound in Proposition 6 is built on."},{"cited_title":"An LP empirical quadrature procedure for reduced basis treatment of parametrized nonlinear PDEs,","cited_arxiv_id":null,"evidence_quote":"Establishes the LP empirical quadrature procedure for nonlinear reduced-basis problems that the component-wise hyperreduction training extends."},{"cited_title":"An LP empirical quadrature procedure for parametrized functions,","cited_arxiv_id":null,"evidence_quote":"Introduces the LP empirical quadrature formulation for parametrized functions used to pose the component-wise hyperreduction optimization."},{"cited_title":"A static condensation reduced basis element method: approximation and a posteriori error estimation,","cited_arxiv_id":null,"evidence_quote":"Provides the static condensation reduced-basis-element framework with bubble-port decomposition that the HRBE assembly inherits."},{"cited_title":"A reduced-basis element method,","cited_arxiv_id":null,"evidence_quote":"Introduces the reduced basis element method, the component-based construction that the hyperreduced library extends."}],"review_version":1}