{"id":"1eb0be20-924b-4914-bba6-bca8d670c510","arxiv_id":"2502.07129","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":2,"one_line_summary":"SB-FNN, a Fourier-neural-operator-based physics-informed solver with adaptive activations and a variance penalty, reports lower N-MSE than vanilla PINN on six systems biology models.","lead":"This paper introduces SB-FNN, a Fourier neural network variant that solves biological ODE/PDE models by minimizing a physics-informed loss with an adaptive activation function and a variance penalty for oscillatory dynamics. On six systems biology benchmarks it reports lower prediction error than vanilla PINN, though key hyperparameters and code are not provided.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Efficiency half of the central claim is unsubstantiated and appears contradicted by Table 4.3; no time-to-accuracy comparison is provided.","rationale":"The reader's weakest assumption focuses on variance-penalty hyperparameter tuning. I agree that this is a real reproducibility and selection-bias problem, but it only directly threatens the two oscillatory models and the accuracy half of the claim. The efficiency claim is broader and can be checked directly against evidence in the paper. Table 4.3 is the only efficiency measurement, and as printed it points the opposite way from the text. This is not a question of missing literature or external consensus; it is an internal inconsistency in the reported results. A conditional verdict is still appropriate because the deficiency is remediable: the authors can supply code, full hyperparameters, and wall-clock time-to-accuracy curves. However, until that evidence is provided, the central claim that SB-FNN is more efficient than PINN is not credible. I therefore keep the reader's CONDITIONAL verdict rather than upgrading it to acceptance.","tokens_in":23569,"tokens_out":11686,"duration_ms":96629,"concrete_test":"Run the released or newly provided code for SB-FNN and the PINN baseline on the same GPU with the same data sampling. For each of the six models, record the total wall-clock time needed to reach a fixed test N-MSE threshold (e.g., the SB-FNN value in Table 4.2) and also the per-epoch times over the full 50k/20k/30k/5k epoch schedule. If SB-FNN's time-to-target is not lower on at least a majority of models, the efficiency claim fails. In addition, reconcile Table 4.3 with the prose: recompute the 2D Turing per-epoch times from the training loop; if the table values are correct, the statement that PINN takes more than three times as long is wrong.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim is that SB-FNN outperforms PINN in both accuracy and efficiency. The efficiency component is the most load-bearing because it is asserted in the abstract, introduction, and conclusion, and the only supporting evidence is Table 4.3. Read as printed, that table shows SB-FNN has a larger per-epoch training time than PINN on most of the six models (Rep3: 9.07 s vs 7.10 s; SIR: 9.05 s vs 6.95 s; 2D Turing: 4.40 s vs 1.54 s if taken literally), with only 1D Turing clearly faster. The text then states that PINN takes more than three times as much time as SB-FNN on 2D Turing, which the table does not support. No total training time, no epochs-to-target-accuracy, and no convergence-time comparison are reported anywhere. Since both methods are run to the same maximum epoch counts, a slower per-epoch time implies a slower total wall-clock run unless SB-FNN converges in far fewer epochs, which is never demonstrated. Thus the efficiency claim is either contradicted by the paper's own table or unsupported by any reported measurement. Separately, the accuracy comparison is weakened by unreported alpha, tau, and lambda hyperparameters, but the efficiency issue is more fundamental because it applies to the entire headline and is internally inconsistent.","agreement_with_reader":"disagree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The manuscript proposes SB-FNN, a Fourier-neural-network-based solver for systems biology ODE/PDE initial-value problems. The method combines an embedded Fourier layer architecture, a softmax-weighted adaptive activation function, and a variance penalty intended to encourage oscillatory solutions. The paper evaluates SB-FNN against a standard PINN on six models—two repressilator variants, SIR, age-structured SIR, and 1D/2D Turing systems—and reports that SB-FNN is more accurate and more efficient than PINN in all cases. The central claim is therefore that SB-FNN is a reliable and faster physics-informed surrogate for oscillatory and multiscale biological models.","tokens_in":23831,"tokens_out":5632,"duration_ms":53327,"significance":"The target problem is practically important: systems biology models are often oscillatory, multiscale, and expensive to solve, and physics-informed surrogates that improve on PINN in this domain would be useful. The paper has several positive features: it evaluates six models spanning ODE and PDE dynamics, it includes an ablation isolating the variance constraint, and it openly states a limitation concerning stiff dynamics in the conclusion. The variance-constraint idea is a plausible mechanism for helping FNN-type solvers preserve oscillations. However, the headline contribution is currently not established. The efficiency half of the claim is contradicted or unsupported by the paper's own Table 4.3, the accuracy metric excludes components that go to zero in a way that is not justified, and the key variance-penalty hyperparameters are never reported. These are fixable within the scope of the manuscript, but they are load-bearing rather than cosmetic.","major_comments":[{"comment":"The efficiency claim is not supported by the reported data. As printed, Table 4.3 shows that SB-FNN has a larger per-epoch time than PINN on Rep3 (9.07 s vs 7.10 s), SIR (9.05 s vs 6.95 s), and 2D Turing (4.40 s vs 1.54 s), and the other rows do not show a consistent SB-FNN advantage. Since both methods are run to the same maximum number of epochs, a larger per-epoch time implies a slower total run unless SB-FNN converges in substantially fewer epochs, and no epoch-to-accuracy or time-to-accuracy comparison is reported. Moreover, the text's claim that PINN takes more than three times as much time as SB-FNN on 2D Turing is contradicted by the table, which shows the opposite ordering. The authors should replace this table with total training time or a time-to-target-accuracy comparison, or remove the efficiency claim.","section":"§4.3.2, Table 4.3"},{"comment":"The decision to exclude variables whose dynamics reach zero from the N-MSE computation is not justified and is consequential for the SIR and A-SIR results. In those models the infectious compartment decays to zero, so excluding zero-reaching dynamics removes precisely the part of the solution that is hardest to fit and that carries important qualitative information. As written, the reported accuracy for SIR and A-SIR does not measure the full solution. The authors should report N-MSE per variable or use a stabilized denominator, and should show whether the qualitative conclusion changes when the omitted dynamics are included.","section":"§4.1, Eq. (4.2)"},{"comment":"The variance penalty depends on threshold α and slope τ, and Eqs. (3.5) and (3.14) depend on loss weights λo, λf, λb, and λp. The paper states that α and τ are 'tailored to different systems biology models' but never reports their values, the search grid, or the selection criterion, and the λ weights are likewise absent from Table 4.1. Because the only gains on the oscillatory repressilator models come from this penalty (Table 4.6), the accuracy comparison is not reproducible and may reflect selection against the test N-MSE. The authors should report all hyperparameters per model and describe a selection procedure that does not use the test metric.","section":"§3.3, Eq. (3.15) and §4.1, Table 4.1"}],"minor_comments":[{"comment":"The numeric formatting of Table 4.3 is ambiguous: entries such as '1.0262 ± 0.0395(e−1)' for Rep6 are difficult to parse because the exponent appears only in the error term and the main value may be missing a digit. Use a single, explicit decimal format for both the mean and the standard deviation.","section":"Table 4.3"},{"comment":"The caption and text refer to 'training loss (N-MSE)', but Eq. (4.2) defines N-MSE against ground truth, which is not used in training. Clarify whether the plotted quantity is N-MSE evaluated on the training points at each epoch, or a physics residual loss that has been rescaled.","section":"§4.3.1, Figure 4.8"},{"comment":"The residual term in Eq. (3.5) is written as ∥ ŷ_t − G[ŷ]∥ without the square that appears in the loss diagram in Figure 3.1(b); align the equation with the figure and with the other loss terms.","section":"Eq. (3.5)"},{"comment":"The notation Sin∗(x) is introduced but not used afterward, and the scaling factor β in Eq. (3.11) is separate from the variance-penalty threshold α introduced in Eq. (3.15); using distinct symbols is fine, but the unused notation should be removed for clarity.","section":"§3.2, Eq. (3.11)"},{"comment":"The closing sentence of the abstract and the conclusion that SB-FNN 'is expected to replace PINN as the most advanced method in systems biology' is an unsupported extrapolation from six benchmark models and should be replaced with a statement about the scope of the evidence.","section":"Abstract and Conclusion"},{"comment":"No comparison is made with a conventional ODE/PDE solver or with other operator-learning baselines; adding a classical solver reference would help calibrate both the accuracy and the efficiency results against the standard workflow that the paper claims to accelerate.","section":"§4.1"}],"recommendation":"major_revision","confidential_remarks":"The manuscript reads as an unrevised master's thesis posted to arXiv, and the journal-level presentation would need restructuring. The most serious editorial risk is not the accuracy comparison alone but the internal contradiction in the efficiency claim in Table 4.3, which the authors must resolve with a proper time-to-accuracy measurement before the central claim can be taken seriously."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: this is an MS thesis, and it reads like one — a plausible architecture, six test problems, big reported accuracy gains over vanilla PINN, and one clear experimental red flag the authors appear not to have noticed. The new thing is the combination: FNO-style Fourier layers plus a softmax-weighted activation mixture plus a variance penalty for oscillatory systems biology models. Each ingredient is known; the package for this problem class is not. The variance-penalty ablation is the strongest part of the paper: on the two Repressilator models, adding the constraint consistently lowers test N-MSE, and the effect is shown both with GELU and with the adaptive activation. That is real, reproducible-in-principle evidence.\n\nWhere it gets shaky: the efficiency claim. The abstract says SB-FNN is 'more efficient than PINN' and outperforms it 'in both accuracy and efficiency.' Table 4.3, the only efficiency evidence, shows SB-FNN's per-epoch time is larger than PINN's on five of six models (e.g., Rep3 9.07 s vs 7.10 s; 2D Turing 4.40 s vs 1.54 s). The text then states that on 2D Turing PINN takes 'more than three times as much time as SB-FNN,' which is the opposite of what the table shows. Since both methods run to the same maximum epoch counts, slower per-epoch time means slower wall-clock unless SB-FNN reaches target accuracy in far fewer epochs — and that is never shown. No time-to-accuracy or total training time is reported anywhere. The efficiency half of the headline claim is either unsupported or contradicted by the paper's own data.\n\nAccuracy also has a reproducibility gap. The variance-penalty hyperparameters α and τ are said to be 'tailored to different systems biology models' but never reported, and the loss weights λ are also absent. That makes it hard to rule out selection on the test N-MSE, particularly since the penalty is explicitly designed to encourage oscillation. The N-MSE metric excludes dynamics that reach zero for SIR/A-SIR, which is a defensible choice but should have been flagged when comparing methods. No code or data is provided, so independent checks are impossible.\n\nEven so, I think the underlying method deserves a serious look. The accuracy gains, if they survive artifact release and honest hyperparameter reporting, are the kind of practical win systems biologists would use. This is not a theory paper; it doesn't claim more than a working PINN alternative.\n\nRecommendation: send it to peer review, but with a referee who will demand the missing hyperparameters, code/data, and a corrected efficiency analysis — ideally time-to-accuracy at matched error. The thesis needs revision, not desk rejection.","headline":"A plausible engineering combination for oscillatory ODE/PDEs, but the paper's headline efficiency claim is contradicted by its own Table 4.3 and the accuracy comparison is missing key tuning details.","tokens_in":24341,"tokens_out":3485,"would_cite":false,"duration_ms":28202,"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":"Fourier-enhanced network beats PINN on all six systems biology models","keywords":["systems biology","physics-informed neural networks","Fourier neural network","adaptive activation function","variance constraint","oscillatory dynamics","repressilator","Turing patterns"],"falsifier":"Reproduce the two repressilator experiments with the exact penalty parameters used in the paper, or with a documented training-only selection rule, and compare held-out N-MSE to vanilla PINN under identical epoch counts; if the reported advantage disappears or reverses, the claimed gain was test-set fitting. Also run the variance-constraint ablation across several reasonable threshold values to see whether the improvement is robust to that choice.","tokens_in":23353,"feed_emoji":"🧬","tokens_out":9065,"duration_ms":78375,"temperature":0.7,"pith_summary":"SB-FNN is proposed as an alternative to physics-informed neural networks for solving the differential-equation models used in systems biology. It combines a Fourier neural network architecture with a per-layer adaptive activation function and a variance-based oscillation penalty. Across six cellular and population models, the paper reports that SB-FNN is both more accurate, as measured by normalized mean square error on held-out time points, and more efficient than PINN, and that PINN fails outright on two of the six. If the comparison holds, SB-FNN gives systems biologists a meshless surrogate that captures oscillatory dynamics without labeled ground-truth solutions.","feed_headline":"Fourier-enhanced network beats PINN on all six biology test models","feed_subtitle":"Fourier layers plus an oscillation penalty solve biological ODE/PDE models faster and more accurately than PINN.","key_machinery":"The central object is the SB-FNN architecture: an input network maps time and space coordinates to a latent space, a stack of Fourier layers applies a fast Fourier transform, keeps $M=12$ modes, multiplies by a learned weight tensor, transforms back, adds a convolutional path, then applies an activation, and an output network maps the last latent layer to the predicted dynamics. The two added mechanisms are the adaptive activation function, a softmax mixture of Tanh, ReLU, Softplus, ELU, GELU and Sin with a trainable weight vector per Fourier layer, and the variance constraint $\\Phi(x)=\\frac{1}{2}(-\\tanh((x-\\alpha)\\tau)+1)$, which adds a penalty near 1 when a normalized predicted trajectory has near-zero variance and near 0 once variance exceeds threshold $\\alpha$. The loss combines initial-condition, residual, boundary, and penalty terms, $\\mathcal{L}=\\lambda_o\\|\\hat{y}_0-y_0\\|^2+\\lambda_f\\|\\hat{y}_t-G[\\hat{y}]\\|+\\lambda_b\\|\\hat{y}-g\\|^2+\\lambda_p P(\\hat{y})$, and is minimized by Adam with a decaying learning rate.","core_discovery":"The paper claims that a physics-informed surrogate built from Fourier layers, SB-FNN, solves the initial-value ordinary and partial differential equation systems that arise in systems biology more accurately and more cheaply than the standard PINN. On all six benchmark models, two repressilator gene-circuit variants, SIR and age-structured SIR, and 1D and 2D Turing reaction-diffusion systems, SB-FNN reports lower test N-MSE than PINN, including two cases where PINN effectively fails, and it needs less wall-clock time per epoch as model complexity grows. The two bespoke components, a per-Fourier-layer adaptive activation function that mixes six standard nonlinearities with softmax weights, and a variance penalty that pushes trajectories away from flat, non-oscillatory solutions, are each shown by ablation to improve accuracy on oscillatory systems.","pith_inferences":["Because the variance penalty is a continuous, differentiable addition to the loss, it could be grafted onto any PINN-style surrogate, not only Fourier architectures; the paper only demonstrates it inside SB-FNN.","The paper lists inverse parameter estimation as future work, so a direct extension is to use SB-FNN to fit rate constants and unknown dynamics from observed trajectories, with oscillatory systems as the natural test bed.","A comparison against enhanced PINN variants, such as gradient-enhanced or domain-decomposed PINNs, would isolate how much of the reported advantage comes from the Fourier architecture itself rather than from the choice of a vanilla PINN baseline."],"forward_implications":["On all six benchmark models, SB-FNN reports lower test N-MSE than PINN; on Rep6 and 1D Turing, PINN fails to produce usable predictions while SB-FNN does.","Because SB-FNN is trained from the governing equations plus initial and boundary conditions rather than from simulated ground truth, it can act as a surrogate solver for biological models without labeled solution data.","Per-epoch training time for SB-FNN stays roughly flat as spatial complexity grows, while PINN time rises sharply; in the 2D Turing case PINN takes more than three times as long per epoch.","The adaptive activation function alone achieves the best mean accuracy ranking across the six models, and adding the variance constraint further improves accuracy on the two oscillatory repressilator models."],"supporting_citations":[{"why":"Defines the vanilla PINN baseline whose accuracy and per-epoch time are compared.","marker":"[25]"},{"why":"Introduces the Fourier neural operator that SB-FNN adapts into an embedded Fourier architecture.","marker":"[61]"},{"why":"Introduces Fourier neural networks, the base idea behind the embedded Fourier layers.","marker":"[60]"},{"why":"Shows that periodic activation functions improve fitting of periodic functions, motivating the adaptive activation mixture.","marker":"[72]"},{"why":"Establishes adaptive activation functions for physics-informed networks, the mechanism SB-FNN extends per Fourier layer.","marker":"[51]"},{"why":"Defines the repressilator oscillatory gene-circuit model used for the Rep3 and Rep6 benchmarks.","marker":"[74]"},{"why":"Defines the SIR compartmental model used as one of the population benchmarks.","marker":"[75]"},{"why":"Supplies the age-contact matrix used in the age-structured SIR benchmark.","marker":"[76]"},{"why":"Defines the Schnakenberg reaction-diffusion kinetics used in the 1D and 2D Turing benchmarks.","marker":"[78]"},{"why":"Describes Latin Hypercube sampling, used to construct the training and test points.","marker":"[73]"}],"fun_headline_variants":["Fourier net beats PINN on all six biology models","SB-FNN sweeps biology benchmarks, bests PINN everywhere","Oscillation-aware Fourier net outruns PINN on six tests","Fourier + adaptive activation dethrones PINN on six models","Faster and better: Fourier net tops PINN on all six"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that the two tunable parameters of the oscillation penalty were selected without using the test set; the paper reports neither their values nor the selection procedure.","fun_headline_variants_meta":{"raw":{"variants":["Fourier net beats PINN on all six biology models","SB-FNN sweeps biology benchmarks, bests PINN everywhere","Oscillation-aware Fourier net outruns PINN on six tests","Fourier + adaptive activation dethrones PINN on six models","Faster and better: Fourier net tops PINN on all six"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000212,"raw_usage":{"total_tokens":1403,"prompt_tokens":914,"completion_tokens":489,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":530,"completion_tokens_details":{"reasoning_tokens":397}},"tokens_in":530,"tokens_out":489,"duration_ms":5058,"temperature":1.0,"reasoning_tokens":397,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-08T13:43:32.320705+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Reproduce the two repressilator experiments with the exact penalty parameters used in the paper, or with a documented training-only selection rule, and compare held-out N-MSE to vanilla PINN under identical epoch counts; if the reported advantage disappears or reverses, the claimed gain was test-set fitting. Also run the variance-constraint ablation across several reasonable threshold values to see whether the improvement is robust to that choice.","supporting_citations":[{"cited_title":"Physics-informed neural networks: A deep learning framework for solving forward and inverse problems involving nonlinear partial differential equations","cited_arxiv_id":null,"evidence_quote":"Defines the vanilla PINN baseline whose accuracy and per-epoch time are compared."},{"cited_title":"Fourier neural networks","cited_arxiv_id":null,"evidence_quote":"Introduces Fourier neural networks, the base idea behind the embedded Fourier layers."},{"cited_title":"Implicit neural representations with periodic activation func- tions","cited_arxiv_id":null,"evidence_quote":"Shows that periodic activation functions improve fitting of periodic functions, motivating the adaptive activation mixture."},{"cited_title":"Locally adap- tive activation functions with slope recovery for deep and physics-informed neural networks","cited_arxiv_id":null,"evidence_quote":"Establishes adaptive activation functions for physics-informed networks, the mechanism SB-FNN extends per Fourier layer."},{"cited_title":"A synthetic oscillatory network of transcriptional regulators","cited_arxiv_id":null,"evidence_quote":"Defines the repressilator oscillatory gene-circuit model used for the Rep3 and Rep6 benchmarks."},{"cited_title":"Discussion: the kermack-mckendrick epidemic threshold the- orem","cited_arxiv_id":null,"evidence_quote":"Defines the SIR compartmental model used as one of the population benchmarks."},{"cited_title":"A modified age-structured sir model for covid-19 type viruses","cited_arxiv_id":null,"evidence_quote":"Supplies the age-contact matrix used in the age-structured SIR benchmark."},{"cited_title":"Turing’s model for biological pattern formation and the robustness problem","cited_arxiv_id":null,"evidence_quote":"Defines the Schnakenberg reaction-diffusion kinetics used in the 1D and 2D Turing benchmarks."}],"review_version":1}