{"id":"dd760074-9c9c-4837-a82f-d321be0e6089","arxiv_id":"2509.07068","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":2,"one_line_summary":"An ML surrogate for the leading-to-full-color reweighting factor accelerates QCD event generation by up to a factor of two while preserving full-color accuracy.","lead":"Scientists trained neural networks to predict the ratio between full-color and leading-color QCD matrix elements, letting them skip expensive calculations during event generation. The method speeds up high-multiplicity LHC simulations by up to about a factor of two without changing the accuracy of the final events.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Baseline comparison may be unfair: the two-step LC→FC baseline is not given the same percentile-maximum optimization as the surrogate chain, so the factor-two f_eff in Eq. (18) may be inflated; a p_r scan on the baseline would settle it.","rationale":"Central claim: inserting an ML surrogate into LC→FC unweighting yields up to 2× speed-up while retaining FC accuracy. For this to hold, T_surr must be smaller than a properly configured T_LC. The paper optimizes the surrogate chain's thresholds on the test set but does not state that the baseline's r-unweighting threshold is optimized in the same way. Eq. 15's lack of an α term and the absence of a p_r scan in Sec. 2.2 indicate the baseline uses a strict maximum. Since ε_r enters T_LC linearly, a modest increase in ε_r from percentile trimming (e.g., from 0.5 to 0.7) reduces f_eff by ~30%. The quoted gain factors therefore may not measure the true benefit of the surrogate over a fairly tuned baseline. I do not regard this as evidence of any error in the physics or the unbiasedness of the final reweighting; the final t-step with exact FC amplitudes preserves FC accuracy by construction. The concern is quantitative and methodological. A p_r scan on the baseline, using the same test set and α constraint, settles whether the factor-two claim is robust. The reader's weakest assumption focused on statistical uncertainties in the p_surr/p_t scan; this is related but distinct, so my agreement is partial. If the baseline scan shows gains remaining near 2, the paper's central claim stands and the verdict should remain CONDITIONAL only for reporting details; if gains shrink, the abstract needs moderation.","tokens_in":23517,"tokens_out":24013,"duration_ms":247564,"concrete_test":"For each process/network, re-run the baseline Alg. 1 with r_max set to a p_r-percentile maximum, scanning p_r over the same grid p∈{0.4,0.425,...,1.0} used for the surrogate; compute ε_r(p_r) and α(p_r) on the same 300k test events, choose the p_r that minimizes T_LC subject to α≥0.995, and recompute f_eff=T_LC(p_r^opt)/T_surr(p_surr^*,p_t^*). If the factor-two entries in Figs. 6/7 fall by more than ~20% (or below ~1.5), the reported gain is partly an artifact of comparing against an unoptimized baseline.","verdict_should_be":"UNCHANGED","load_bearing_attack":"f_eff (Eq. 18) is the ratio of T_LC (Eq. 15) to T_surr (Eq. 17). T_LC is proportional to 1/ε_r, the efficiency of the second-step r-unweighting in the baseline Alg. 1. In Sec. 2.2 the authors optimize the surrogate chain by scanning p_surr and p_t over p∈{0.4,...,1.0} and picking the pair that maximizes f_eff subject to α≥0.995, but no analogous scan is reported for the baseline r_max. Eq. 15 contains no α factor for the baseline, consistent with using a strict sample maximum in Alg. 1 rather than the percentile maximum allowed in the three-step chain. The r distributions shown for gg→ng (e.g. Fig. 5, bottom, with r up to ~1.75 for n=7) have tails that a percentile maximum would trim, raising ε_r and hence lowering f_eff. If the quoted factor-two gain is computed against an untuned two-step baseline, the abstract's headline overstates the advantage of the surrogate method. The paper also states that the quoted f_eff uncertainty covers timing variations only (Sec. 4.1), so the p-scan selection itself is not statistically protected; but the more directly correctable issue is the asymmetric optimization of the baseline.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes FASTColor, a three-step unweighting pipeline for QCD event generation that inserts a trained ML surrogate for the LC→FC reweighting ratio between the leading-color generation step and the final full-color reweighting. After the first LC unweighting, a surrogate r_surr is used in a second acceptance step; events passing it are then reweighted against t = r/r_surr in a final exact step, with percentile-based maxima and overweight corrections to preserve statistical power. The authors compare MLP, GNN, transformer, and L-GATr architectures for gg→ng, single-quark-line, and double-quark-line processes, and report effective speed-ups of up to a factor of two over the two-step LC-to-FC baseline while retaining full-color accuracy. A separate section studies the transformer's loss-collapse dynamics and argues that the network learns Lorentz symmetries.","tokens_in":23845,"tokens_out":6027,"duration_ms":63003,"significance":"If the reported gains are robust, the method is a practical and conceptually clean acceleration of full-color event generation: the final reweighting step makes the physical result exact by construction, and the timing model in Eqs. (14)–(18) is a reasonable and useful framework. The architecture comparison, including Lorentz-equivariant networks, is a useful contribution. The main value lies in the speed-up claim, and that claim depends on a fair comparison with the baseline and on the statistical treatment of the efficiency measurements. The symmetry-learning study is interesting but not load-bearing for the central result.","major_comments":[{"comment":"The baseline comparison is asymmetric. The surrogate chain in Sec. 2.2 scans p_surr and p_t over p∈{0.4,...,1.00} and selects the pair maximizing f_eff subject to α≥0.995, using Eq. (19). The baseline in Alg. 1 and Eq. (15) uses strict r_max, with no analogous percentile scan and no α correction. Applying the same percentile-based r_max to the baseline with α≥0.995 would increase ε_r and lower T_LC, thereby reducing the quoted f_eff in Eq. (18). Since the abstract's 'around a factor two' speed-up is relative to this untuned baseline, the headline claim may be inflated. Please either re-optimize the baseline with the same percentile procedure and report the resulting f_eff, or explain clearly why the percentile optimization cannot be applied to the baseline.","section":"Sec. 2.2, Eq. (15), Eq. (18), Alg. 1"},{"comment":"The reported f_eff values are maxima over the p-scan performed on the test set, and the quoted uncertainties cover timing variations only. The efficiencies ε_LC, ε_r, ε_surr, ε_t are estimated from finite test samples, and selecting the best p values on the same data is a form of tuning. Without statistical uncertainties on the efficiencies, or a validation/test split in which p is fixed on a validation set and f_eff is evaluated on a held-out set, the quoted speed-ups may not generalize to production runs. Please provide bootstrap intervals or an explicit validation/test procedure for the p-selection, and state the resulting uncertainty on f_eff.","section":"Sec. 4.1, Sec. 2.2"}],"minor_comments":[{"comment":"The formula for f_eff is typeset without parentheses and is hard to read. Please display numerator and denominator clearly, e.g., as a single fraction with explicit brackets.","section":"Eq. (18)"},{"comment":"The definition of w_p^max is undefined for p=1.00, since the set over which the minimum is taken is empty. Please restate the percentile-maximum definition using a standard weighted-percentile formulation that includes p=1 as the strict maximum.","section":"Eq. (19)"},{"comment":"The return statement is ambiguous: 'return x and ew=max(...) ... |M_i_LC(x)|^2' mixes the event weight with the LC matrix element. Define ew separately and state the final event weight explicitly.","section":"Alg. 2"},{"comment":"L-GATr is evaluated only once, so its timing uncertainty is not estimated, while the other surrogates report a standard deviation over five runs. Please state this asymmetry in the caption or provide repeated timing measurements.","section":"Sec. 4.1"},{"comment":"There are minor language issues, e.g., 'the that' in Sec. 4.2 and 'an average speed-up' in the same section. A light editing pass would improve readability.","section":"Throughout"}],"recommendation":"major_revision","confidential_remarks":"The central algorithmic idea is sound and the exactness argument is correct. The main issue is the fairness of the baseline comparison and the statistical robustness of the gain factors; both are fixable within the scope of the paper."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: this is a solid, useful application of ML surrogates to speed up LC-to-FC unweighting in QCD event generation. The method is exact by construction – the final reweighting step corrects any surrogate error – and the architecture comparison plus the symmetry-learning study are genuinely informative. The main caveat is that the reported speed-up factor is likely optimistic because the baseline isn't given the same percentile-maximum optimization as the surrogate chain.\n\nWhat's new: the three-step unweighting pipeline (LC, surrogate r_surr, then t = r/r_surr) applied to full-color event generation. It builds directly on ref [28] and on prior surrogate rejection sampling [84-86], but the specific combination and the systematic comparison of MLP, GNN, transformer, and L-GATr is new. The observation that transformers show a grokking-like loss collapse and progressively learn Lorentz invariance is a nice standalone result, even if it's not deeply analyzed.\n\nWhat's good: The exactness argument is clean and correct. If the surrogate is imperfect, the final t-unweighting with appropriate overweights gives an unbiased FC sample. The efficiency formulas (Eqs. 14-18) are plausible, and the paper is transparent about timing uncertainties. The pure surrogate extrapolation is clearly labeled as speculative.\n\nSoft spots: The factor-two headline is a selected maximum. The p-scan over p_surr and p_t on the test set, picking the pair that maximizes f_eff subject to α≥0.995, is a form of test-set optimization. No statistical error bars on the efficiencies are provided; the quoted uncertainty only covers timing variations. More importantly, the baseline Alg. 1 is not given the same percentile-maximum optimization. If the baseline's r_max were replaced by a percentile maximum with the same α constraint, ε_r would rise and f_eff would drop. The stress-test note has this right: Eq. 15 has no α factor for the baseline, and the r distributions shown have tails that a percentile max would trim. This asymmetry inflates the reported gains somewhat. The average gain of about 50% across processes is more defensible than the \"factor two\" in the abstract.\n\nWho is this for: people working on ML-accelerated event generation, especially for HL-LHC. The paper is worth a serious referee: the method is correct, the comparison is broad, and the issues are addressable with additional validation (e.g., a p-scan on the baseline, bootstrap uncertainties on efficiencies, and reporting the median rather than max f_eff). I'd suggest a moderate revision rather than a rejection.","headline":"Solid, exact-by-construction surrogate acceleration of LC-to-FC event generation, but the factor-two speed-up is likely inflated by an asymmetric baseline comparison.","tokens_in":24355,"tokens_out":2426,"would_cite":false,"duration_ms":23257,"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":"Inserting a neural-network surrogate into the leading-color-to-full-color reweighting chain speeds up QCD event generation by up to a factor of two while keeping full-color accuracy.","keywords":["leading-color approximation","full-color reweighting","matrix-element surrogates","unweighting","LHC event generation","Lorentz-equivariant transformer","grokking","QCD multi-jet"],"falsifier":"Fix the percentile maxima for the surrogate and the ratio thresholds on a training sample, then run the three-step pipeline on an independent production-size sample and compare wall-clock time and the effective sample size fraction alpha to the LC baseline; an effective gain at or below one, or alpha below 0.995, would falsify the claimed speed-up at retained accuracy.","tokens_in":23419,"feed_emoji":"⚡","tokens_out":6018,"duration_ms":60301,"temperature":0.7,"pith_summary":"The paper tries to establish that a neural network can stand in for the expensive full-color matrix element during the leading-color-to-full-color reweighting stage of LHC event generation, without changing the final accuracy. It inserts a surrogate acceptance step before the exact full-color reweighting, so the exact computation still decides which events survive; the surrogate only rejects events early. For representative gluon and quark-line processes up to seven final-state particles, the paper reports effective speed-ups of about 15 percent to more than a factor of two over the standard LC-to-FC workflow. It also shows that a plain transformer displays a sudden, grokking-like loss collapse and that the collapse coincides with the network learning Lorentz symmetries. A final section argues that once surrogate uncertainties are calibrated, the exact reweighting step could be dropped entirely, with potential gains close to an order of magnitude.","feed_headline":"Neural surrogates double full-color event generation speed","feed_subtitle":"A surrogate reweighting step keeps exact full-color accuracy while cutting cost for high-multiplicity QCD processes.","key_machinery":"The reweighting ratio r_LC->FC(x,h) = |M(x,h)|^2/|M_LC(x,h)|^2 is the object being learned. The carrying mechanism is the three-step unweighting algorithm: after LC unweighting, a network evaluation of this ratio performs a cheap rejection step; only survivors reach the exact FC evaluation, followed by an unweighting against t = r/r_surr. Percentile-based maxima for r_surr and t boost efficiencies while keeping alpha >= 0.995, and the effective gain factor f_eff ties the speed-up to these efficiencies and to the average evaluation times of LC amplitudes, FC amplitudes, and the surrogate.","core_discovery":"The central claim is that a three-step unweighting chain -- leading-color event generation, a learned surrogate acceptance step, and an exact full-color reweighting step -- accelerates multi-jet LHC event generation while fully retaining FC accuracy. The surrogate regresses the LC-to-FC ratio r = |M|^2/|M_LC|^2; events passing the surrogate threshold face the exact ratio, with acceptance controlled by t = r/r_surr. Because the final step still evaluates the exact full-color matrix element, the accepted sample matches the baseline LC-to-FC sample up to a controlled overweight fraction, quantified by the effective sample size alpha >= 0.995. Across networks and processes the average effective","pith_inferences":["The reported gains are timing- and efficiency-based; in a full production generator the speed-up depends on the fraction of events that survive the first LC step, so processes with low LC unweighting efficiency would see a smaller absolute benefit.","The same surrogate-with-final-exact-step pattern should transfer to other expensive reweighting ratios, such as NLO corrections or matching/merging weights, whenever the ratio is smooth enough to regress.","A direct way to extend the result is to test the percentile-maximum scan on a held-out production sample with the maxima fixed in advance; a drop in alpha below 0.995 would indicate overfitting of the scan to the test set.","The loss-collapse observation suggests that transformer-based surrogates may need longer training than the other architectures to reach their accurate regime, which matters for practical deployment and fair comparison."],"forward_implications":["The LC-to-FC baseline gains up to a factor of two for high-multiplicity channels, so precision multi-jet samples for the HL-LHC become cheaper to produce at the same nominal accuracy.","The MLP, despite lower regression accuracy, reaches comparable gains because it is fast, showing that surrogate evaluation time matters as much as regression quality.","Lorentz-equivariant architectures scale better with multiplicity, so the speed-up should grow as FC amplitudes become more expensive.","If surrogate uncertainties become calibrated, the final exact reweighting step can be dropped, with effective gains close to an order of magnitude for high multiplicities.","The transformer's loss collapse resembles grokking and aligns its representation with Lorentz invariance, suggesting training dynamics can be tuned to reach the accurate regime faster."],"supporting_citations":[{"why":"Supplies the two-step LC-based unweighting baseline that the surrogate method extends.","marker":"[28]"},{"why":"Introduces surrogate-based rejection sampling and the effective gain factor used to measure speed-up.","marker":"[84]"},{"why":"Applies factorisation-aware neural networks to unweight multijet events, the immediate predecessor of this surrogate approach.","marker":"[85]"},{"why":"Extends neural-network matrix-element surrogates to multijet-merged event generation, a related strategy the paper builds on.","marker":"[86]"},{"why":"Provides the Lorentz-equivariant transformer architecture used as one of the surrogate models.","marker":"[50]"},{"why":"Cited as a faster Lorentz-equivariant architecture expected to improve future gain factors.","marker":"[53]"},{"why":"Supplies the effective sample size measure used to quantify statistical power loss from overweights (alpha).","marker":"[87]"},{"why":"Grokking reference used to interpret the transformer's delayed loss collapse.","marker":"[90]"},{"why":"Definition of unweighting efficiency used in Eq. (5).","marker":"[34]"}],"fun_headline_variants":["ML surrogate doubles full-color QCD event generation speed","Full-color accuracy at twice the speed via neural surrogates","Transformers learn QCD symmetries to speed event generation","Learned acceptance step accelerates high-multiplicity LHC events","Surrogate keeps exact full-color accuracy while cutting cost"],"cache_read_input_tokens":2688,"weakest_assumption_plain":"The quoted speed-ups are measured from finite test samples and from a percentile scan that is tuned to maximise the gain; if the test sample misses the rare large-weight tails or the scan overfits, the gains may not hold for a fresh production run.","fun_headline_variants_meta":{"raw":{"variants":["ML surrogate doubles full-color QCD event generation speed","Full-color accuracy at twice the speed via neural surrogates","Transformers learn QCD symmetries to speed event generation","Learned acceptance step accelerates high-multiplicity LHC events","Surrogate keeps exact full-color accuracy while cutting cost"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000774,"raw_usage":{"total_tokens":3209,"prompt_tokens":642,"completion_tokens":2567,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":386,"completion_tokens_details":{"reasoning_tokens":2500}},"tokens_in":386,"tokens_out":2567,"duration_ms":19139,"temperature":1.0,"reasoning_tokens":2500,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-04T22:50:00.334758+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Fix the percentile maxima for the surrogate and the ratio thresholds on a training sample, then run the three-step pipeline on an independent production-size sample and compare wall-clock time and the effective sample size fraction alpha to the LC baseline; an effective gain at or below one, or alpha below 0.995, would falsify the claimed speed-up at retained accuracy.","supporting_citations":[],"review_version":1}