Pith.

High Energy Physics - Phenomenology · arXiv:hep-ph/0501067 v2 · submitted 9 Jan 2005 · 27 references

Unbiased determination of the proton structure function F_2^p with faithful uncertainty estimation

The NNPDF Collaboration: Luigi Del Debbio, Stefano Forte, Jose I. Latorre, Andrea Piccione, Joan Rojo

The paper says

“We construct a parametrization of the deep-inelastic structure function of the proton F_2 based on all available experimental information from charged lepton deep-inelastic scattering experiments.”

more of the abstract

The parametrization effectively provides a bias-free determination of the probability measure in the space of structure functions, which retains information on experimental errors and correlations. The result is obtained in the form of a Monte Carlo sample of neural networks trained on an ensemble of replicas of the experimental data. We discuss in detail the techniques required for the construction of bias-free parameterizations of large amounts of structure function data, in view of future applications to the determination of parton distributions based on the same method.

from the abstract

Pith says

Machine review · deepseek-v4.1-flash · 13 Nov 2026 · what was read was not recorded · not checked by a person

Reviewed in 2026 with later literature in view.

It can be wrong. Challenge this review or reply to it.

Holds up, with conditions. A careful, honest methods paper whose abstract's 'bias-free' label outruns what the internal diagnostics actually establish. This line is wrong

3 major objections · 6 minor

How often objections from reviews like this one are right: not yet measured

Are you an author? What you can do.

Not checked: figures, code, what the 27 references say.

The paper says, at §5, Eq. (34) and footnote 2

The review did not quote this passage.

Pith says: Objection 1 of 3 · major

The bias-freedom claim of the abstract rests on the R-estimator, but its calibration under the E3 objective is asserted rather than shown. Footnote 2 states that 'it is easy to see' the results of ref. [4] for R remain true when the full E3 (Eq. 12) is minimized, 'provided R is redefined accordingly', with no derivation and no numerical check.

more of objection 1

This matters because the paper's own point relative to ref. [4] is that E2 minimization is inadequate once HERA correlations are included (Table 3 and the surrounding discussion), so the calibration cannot simply be inherited. The authors should either derive the redefined R and show that the clean/bias thresholds (R approximately 0.5 versus R greater than or similar to 1) are unchanged, or present a numerical study on replicas with a known underlying function demonstrating the calibration under E3. As written, the load-bearing diagnostic for the central claim is supported by a one-line assertion.

The paper says, at §4, Fig. 3 and Fig. 4; §5, Table 5

The review did not quote this passage.

Pith says: Objection 2 of 3 · major

The width of the quoted uncertainty band is controlled by the GA training length, which is fixed at 4x10^4 cycles by requiring the fit to the central data to flatten at chi-squared approximately 1.2 (Fig. 3), and Fig. 4 shows the mean network error falling monotonically with training length in step with the chi-squared improvement.

more of objection 2

The stopping point is therefore chosen against the same central values that the ensemble is later said to describe, and the only stated safeguard against overlearning is the R-estimator discussed above. The training-length argument in §5 (error reduction tracking fit quality rather than being flat in training length) is a reasonable qualitative indicator, but it is not an independent validation. A closure test would settle this: generate pseudo-data from a known underlying F2 with the same error and correlation structure, train the ensemble, and verify that the ensemble spread covers the truth with approximately correct coverage across the (x,Q2) plane. Absent such a test, the abstract's 'bias-free' and 'faithful' language is stronger than the internal diagnostics establish, and I would ask either for the closure test or for the abstract and §5 to be reworded to claim consistency with the data rather than demonstrated bias-freedom.

The paper says, at §4, Tables 3-4

The review did not quote this passage.

Pith says: Objection 3 of 3 · major

The exclusion of ZEUS94 is argued carefully (its kinematic region is covered by ZEUS97, H197, H199 and H100; excluding it improves E3 for the overlapping experiments and for the global fit, while ZEUS94's own E3 deteriorates only comparably despite not being fitted), and the proposed iterative selection procedure is a sensible attempt to make the choice rule-based.

more of objection 3

Two things should nonetheless be tightened. First, the criterion as applied is post-hoc and case-by-case: ZEUSSVX95 is retained despite E3 = 2.08 on the grounds that it has few data points, which is a pragmatic but not a principled distinction from the ZEUS94 decision. Second, the paper does not quantify how the exclusion of ZEUS94 changes the final F2 band in the region that experiment covers; since the ensemble is presented as a determination from all available data, a direct comparison of the band with and without ZEUS94 in that region would substantiate the 'no information loss' claim. I would ask for that comparison and for the selection rule to be stated as a general criterion rather than justified per experiment.

6 minor objections

The paper says, at §3, after Eq. (15)

Pith says: minor objection 1 of 6

The text writes 'The value of Er, i is updated from the full data set every 1.25x10^6 training cycles'; this should presumably read E3,i, matching the notation of Eq. (12) and Eq. (15).

The paper says, at §5, Table 6

Pith says: minor objection 2 of 6

For NMC the scatter correlation of the network covariance with the experimental covariance is reported as r[cov(net)] = -0.03, and for E665 as 0.16. The text explains the low values through the small number of points that determine the fit, but a negative value for NMC is worth an explicit sentence so that readers do not read it as a sign error.

show 4 more

The paper says, at §5, final paragraph

Pith says: minor objection 3 of 6

There are typographical errors in this section: 'lenghty' and 'surprizing' should be corrected, and the sentence beginning 'Error reduction only obtains after this lenghty minimization process' should be reread for grammar.

The paper says, at §2, Eq. (9)

Pith says: minor objection 4 of 6

The symbol r(k) is used both for the normalization offset r(k)_N and for the uncorrelated shift r(k)_i in Eq. (9), and again in Eqs. (13)-(14). A short sentence stating that all r's are independent univariate gaussian variates, and distinguishing the normalization draw from the per-point draw, would remove ambiguity.

The paper says, at Fig. 1 and Figs. 5-6

Pith says: minor objection 5 of 6

The kinematic-coverage plot and the F2 comparison plots would benefit from clearer axis labels and, in Figs. 5-6, from stating explicitly which curve is the data and which is the network band in the caption rather than only in the surrounding text.

The paper says, at §6, data release

Pith says: minor objection 6 of 6

The FORTRAN routine and 1000 parameter sets are a genuine strength and should be described a little more fully in the text: the calling convention, the parameter-set format, and the (x,Q2) range over which the routine is intended to be used would help users avoid extrapolating beyond the validated region.

What would settle it

Run a closure test with the published pipeline. Choose a smooth known input F2(x,Q2) (e.g. the released central fit itself), generate replica pseudo-data with the full 1698-point covariance of table 1, and train the identical 1000-net ensemble with the same BP+GA schedule and the same 4×10^4-cycle stopping rule. Then check two numbers: (a) the pull of the ensemble mean against the known input, (b) the ratio of the ensemble spread to the spread the input replicas actually carry. If the recovered band is systematically narrower than the true replica spread by the same factor 3–4 seen in table 5, the 'faithful uncertainty' claim fails and the error reduction is over-shrinking; if the band brackets the truth, the concern does not land. Repeat at half and double the GA length to see whether the band moves by more than the quoted few-percent accuracy.

from the skeptic's reading

How the review went

4 readings by deepseek-v4.1-flash · 13 Nov 2026

  1. Reader holds up, with conditions confidence high
  2. Skeptic partly agrees 1 min 17 s · 17,846 tokens read, 4,204 written
  3. Editor wrote the verdict above 26 s · 18,982 tokens read, 1,373 written
  4. Referee major revision: 3 major objections, 6 minor 1 min 19 s · 18,238 tokens read, 4,256 written

Not run on this paper: the simulated authors' defence.

Pith did not check this review's objections against the paper.

The review in full

The review in brief, machine-written

Worth your time if you care about how uncertainty bands on functions get constructed; less so if you just want the F2 number. This is the NNPDF F2 paper, and it is the template for everything that came after, so it is worth knowing what it does and does not nail down. What is genuinely new relative to their 2002 paper: the genetic-algorithm epoch that minimizes the full correlated chi-squared (eq. 12), the dynamical weighted training of eq. 15, HERA data folded in, and a shipped artifact — a FORTRAN routine plus 1000 parameter sets at the URL in the conclusion. That last part matters; you can actually check their band against your own fit. The statistical bookkeeping is careful: replica generation (eq. 9), normalization handled as an overall rescaling (eqs. 13-14), D'Agostini symmetrization of asymmetric errors (eqs. 7-8). They are also upfront about the things that went wrong — NMC's internal inconsistencies, the post-hoc ZEUS94 exclusion argued through kinematic overlap and E3 deterioration, and the caveat that extrapolated errors become unreliable far from the data. That honesty is worth something. Where I would push: the abstract's 'bias-free' (abstract:s1) is stronger than the body supports. The width of the band is set by the GA training length, fixed at 4x104 cycles by requiring the central fit to flatten at chi2 ~ 1.2 (fig. 3) — the same central values the ensemble is later said to describe. Figure 4 shows the net error falling monotonically with training length, so the band is a bias-variance knob tuned for self-consistency, not an independently validated quantity. The only safeguard is the R-estimator, computed on the same replicas and data, and footnote 2's claim that the R ~ 0.5 calibration survives the switch from E2 to E3 is asserted ('easy to see') rather than derived or checked numerically. Since the whole point of this paper over the 2002 one is that E3 minimization matters, that is exactly the step that needed support. The stress-test note lands here; the reader's circularity score of 4.0 is a touch harsh, because fig. 4 is a real argument, just not an independent one. None of this sinks the method — the 3-4x error reduction is plausibly information-combining — but the abstract should have said 'controlled' rather than 'bias-free'. Send it to referees; cite it.

The strongest objection

The abstract's claim [abstract:s1] is that the ensemble gives a bias-free probability measure with faithful errors. The width of that measure is set almost entirely by one hyperparameter: the GA training length. Section 4 fixes it at 4×10^4 cycles by requiring the fit to the central data to flatten at χ²≈1.2 (fig. 3), i.e. the stopping point is chosen using the same experimental central values that the ensemble is later said to describe. Figure 4 then shows ⟨σ(net)⟩ falling monotonically with training length and tracking the χ² improvement. So the reported error band is the value of a bias–variance knob that was tuned until the fit looked good against the data — a self-consistency condition, not an independent validation of 'faithful' errors. The only stated safeguard against overlearning is the R-estimator (eq. 34), and it has two weaknesses the paper does not close. First, R is computed from the same replicas and the same data used in training, so it cannot detect a bias that is common to all replicas (e.g. a systematically over-shrunk spread). Second, its calibration — R≈0.5 clean, R≳1 biased — is imported from ref. [4], where the nets minimized the diagonal E2; footnote 2 states that 'it is easy to see' the calibration survives under E3 'provided R is redefined accordingly', but no derivation or numerical check of the redefined R is given. Since the whole point of this paper relative to ref. [4] is that E3 minimization (via GA) is now essential — the paper itself shows E2 minimization gives no BCDMS error reduction — the calibration transfer is exactly the step that needs support and does not get it. The 3–4× reduction of ⟨σ(net)⟩ below ⟨σ(exp)⟩ (table 5) is therefore asserted to be information-combining rather than over-shrinking on the strength of an unverified diagnostic. This is a narrower and more checkable concern than the reader's, which correctly flags the internality of R but does not locate the training-length tuning as the mechanism that sets the band

The paper is a careful methodological work with a shipped artifact (FORTRAN routine plus 1000 parameter sets) and unusually candid disclosure of its choices, including the admission in section 5 that extrapolated errors become unreliable far from the data. Much of what could be criticized is already acknowledged: the NMC and ZEUSSVX95 residuals are discussed, the ZEUS94 exclusion is argued through kinematic overlap and E3 deterioration, and the asymmetric-error treatment is delegated to refs. [21,22]. I do not treat any of those as load-bearing, and I do not treat the reliance on published results as a defect. The concern I do raise is narrower than the reader's and, I think, sharper. The reader correctly identifies that the R-estimator is an internal diagnostic computed on the training data, and that the bias-freedom claim inherits whatever R fails to detect. I agree with that framing but would locate the mechanism more precisely: the ensemble width is governed by the GA training length, which section 4 selects by requiring χ²≈1.2 on the central data, and figure 4 shows the width falling in lockstep with that χ². That makes 'faithful uncertainty' a self-consistency statement about a tuned hyperparameter. The second, independent gap is footnote 2: the R calibration is carried over from ref. [4]'s E2-trained nets to the present E3-trained nets by assertion. Because the paper's own argument is that E3 minimization changes the outcome materially (it is what produces the BCDMS error reduction absent in ref. [4]), the calibration transfer is precisely the step that cannot be assumed. Neither gap is fatal, and neither is concealed; both are the kind of thing a closure test settles in an afternoon with the released code. That is why I would leave the verdict at CONDITIONAL rather than move it: the method is sound, the artifact is available, and the claim is plausible, but the word 'faithful' currently outruns the internal evidence by exactly one unvalidated calibration step. If the closure test in the concrete_test field shows the recovered band matches the true replica spread, the paper's central claim is fully supported and I would move to ACCEPT; if the band is over-shrunk, the abstract's 'faithful uncertainty estimation' needs qualification to 'uncertainty estimated under a training-length prescription validated on the fitted data'.

The referee's report

If the central claim holds, this is a valuable methods paper: it delivers a usable, publicly downloadable determination of F2(x,Q2) with an uncertainty band, and it develops the machinery (GA training on the full correlated chi-squared, dynamical weighting, probabilistic selection) that the collaboration subsequently needs for parton distributions. The paper deserves credit for releasing the full ensemble rather than only a central fit, which makes the result reproducible and independently checkable, and for the explicit pull comparison to the pre-HERA fit of ref. [4] (Fig. 8), which is a falsifiable, quantitative statement rather than a qualitative assertion. The authors are also commendably explicit that extrapolated errors grow rapidly and become unreliable far from the data (region (c) discussion in §5), which is exactly the kind of limitation such a paper should state. The technical core is carefully documented and, in my reading, sound.

Pith's reading of the paper (a machine's summary, not the authors')

The paper tries to establish that one can put a trustworthy uncertainty band on a function — here the proton structure function $F_2(x,Q^2)$ — rather than only on a handful of fitted parameters. Its strategy is to generate many fake copies of the experimental data that reproduce the measured central values, errors and correlations, then train one neural network on each copy; the spread of the resulting network ensemble is presented as the probability distribution of the function itself. If that is right, the band is not an artifact of choosing a particular fitting form, and the same machinery can be carried over to parton distributions, where reliable errors are needed for collider predictions. The paper also supplies a concrete public product: a set of 1000 trained networks that return $F_2(x,Q^2)$ and its uncertainty at any point in the covered kinematic region.

What carries the argument. The machinery is a three-stage training scheme for an ensemble of neural networks. First, many replicas of the data are drawn as a multigaussian distribution, with one random number per independent error source, so that each replica carries the experimental central values, statistical errors, correlated systematics and normalization uncertainty. Each network is then trained on one replica: two back-propagation epochs first minimize an unweighted deviation and then the diagonal chi-squared, and a final genetic-algorithm epoch minimizes the full correlated chi-squared $E_3$, which is nonlocal and expensive but captures the correlations. The ensemble average gives the central structure function, and the ensemble variance gives the uncertainty; the $R$ estimator compares the average full chi-squared of individual networks to the chi-squared of the ensemble mean and is used as a check that the error reduction is not caused by a restrictive fitting form.

Core claim. The central claim is that a Monte Carlo ensemble of neural networks, trained on replicas of all available charged-lepton deep-inelastic scattering data, provides a bias-free determination of the probability measure in the space of structure functions. The authors argue that the ensemble retains the experimental errors and correlations, including correlated systematics and normalization uncertainties, while interpolating between measured points and extrapolating under a smoothness requirement. They support the bias-freedom claim with an internal diagnostic, the ratio $R$ of two chi-squared measures, which comes out near $0.5$ for essentially all experiments, and with the observation that the network error shrinks as training improves rather than staying fixed as a parametrization bias would. The final data set contains 1698 points from NMC, BCDMS, E665, ZEUS and H1, with ZEUS94 excluded because its inclusion degraded the fit without adding kinematic coverage.

The premise it rests on. The load-bearing premise is that the network ensemble converges to the underlying physical curve rather than to noise in the replicated data, and that the paper's internal $R$ diagnostic — near $0.5$ when no fitting-form bias is present — reliably distinguishes those two outcomes.

If the paper is right (Pith's inferences, not the authors')

The method gives a usable uncertainty band for $F_2^p(x,Q^2)$ across the measured region and a public set of 1000 networks that can be evaluated at arbitrary kinematic points.

Because the training handles many disparate data sets with correlated systematics, the same replica-plus-network approach can be extended to a full set of parton distributions, which is the stated next target.

The paper's data-selection procedure — training on subsets and keeping experiments that lower the total chi-squared — offers a way to automate decisions about which data sets to include in a global fit.

The comparison with the earlier BCDMS/NMC-only fit shows that adding HERA data sharpens the band at small $x$ and large $Q^2$, while also showing that extrapolated errors grow rapidly and become unreliable far outside the data.

A convincing public test would be to release closure-test coverage plots alongside the 1000 networks; if the band is a true probability measure, repeated synthetic experiments should cover the known truth at the nominal rate, not merely produce a smooth spread.

The paper's own old-versus-new comparison hints at a practical limit: the ensemble can be precise where data constrain it and still be confidently wrong where it extrapolates, so users should treat the band as conditional on the training region rather than as a global error.

The $R$ diagnostic could be stress-tested by deliberately training on a restrictive parametrization; if $R$ remains near $0.5$ there, it is not sensitive to the bias it is meant to detect.

Check this review

Pith stored no record of this review's passes and took no fingerprint of it. Reviews made by code from 13 Nov 2026 on carry both.

How often reviews like this one are right

Reviews like this one: written by deepseek-v4.1-flash, where what was read was not recorded.

How often objections from reviews like this one are right: not yet measured

Every value above, in the review's public record (JSON)

Reviews by people

This review was written by a machine. No person has reviewed this paper on Pith yet. A scientist listed on Pith can review it for a fee, and their review is published here whatever it concludes.

Request a human review

How Pith checks papers · The full audit of this paper

The paper

Abstract

We construct a parametrization of the deep-inelastic structure function of the proton F_2 based on all available experimental information from charged lepton deep-inelastic scattering experiments. The parametrization effectively provides a bias-free determination of the probability measure in the space of structure functions, which retains information on experimental errors and correlations. The result is obtained in the form of a Monte Carlo sample of neural networks trained on an ensemble of replicas of the experimental data. We discuss in detail the techniques required for the construction of bias-free parameterizations of large amounts of structure function data, in view of future applications to the determination of parton distributions based on the same method.

The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. No sentence in this record was written by a model.

abstract compiled · 2026-09-23

The authors' main claim, as the classifier picked it out 0.99

“The parametrization effectively provides a bias-free determination of the probability measure in the space of structure functions, which retains information on experimental errors and correlations.”

How the main claim is stated: asserted 0.96

What the abstract itself states, as probabilities: claims first 0.05 · states limitation 0.14 · human participants 0.02 · controlled comparison 0.02 · randomized assignment 0.01 · states quantitative result 0.06 · compares with prior results 0.06 · mentions code or data availability 0.04

The abstract, sentence by sentence

This table labels the abstract only (arXiv listing abstract v2). The number is the probability the classifier gave the label.

SentenceRoleThe authors' own workStates the main conclusionStrength
We construct a parametrization of the deep-inelastic structure function of the proton F_2 based on all available experimental information from charged lepton deep-inelastic scattering experiments. contribution 0.79 0.94 0.11 asserted 1.00
The parametrization effectively provides a bias-free determination of the probability measure in the space of structure functions, which retains information on experimental errors and correlations. result 0.52 0.88 0.58 asserted 0.96
The result is obtained in the form of a Monte Carlo sample of neural networks trained on an ensemble of replicas of the experimental data. method 0.96 0.94 0.15 asserted 1.00
We discuss in detail the techniques required for the construction of bias-free parameterizations of large amounts of structure function data, in view of future applications to the determination of parton distributions based on the same method. future work 0.89 0.66 0.07 asserted 0.84

What kind of paper the classifier reports this is: method or tool 0.99 · evidence from analysis of existing data 0.99

What was examined, and what was not

Sources read

  • arXiv listing abstract v2

Not examined

  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers

Levels run

  • P abstract

Not run

  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

How the labels were made

Compiled by classifier-1.13-20260917 via OpenRouter, question bank abstract-p1-20260923, 2026-09-23: 1 request, 3,648 input tokens, $0.0002 reported.

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. This record as JSON

Figures (8)
Figure 1 of the paper
Figure 1. Kinematic range of the experimental data data is shown in fig. 1. Structure functions are defined by parametrizing the deep-inelastic neutral current scatter￾ing cross section as d 2σ(x, Q2 ) dxdQ2 = 2πα2 xQ4  Y+F2(x, Q2 ) ± Y−xF3(x, Q2 ) − y 2FL(x, Q2 )  . (1) For the definition of kinematic variables see ref. [19]. We will construct a parametrization of the structure function F2(x, Q2 ), which provides the bulk of the contribution to eq. (1). For all experiments the FL contribution to the cross section has already been subtracted by the experimental collaborations, e
Figure 2 of the paper
Figure 2. Scatter plot of experimental vs. Monte Carlo central values and errors. by means of genetic algorithms (GA), previously used and discussed by some of us for related purposes in ref. [25]. In comparison to previous work [4, 25], we have implemented several improvements, both in the BP and GA training epochs. In the BP epoch, we use on line training as in ref. [4], i.e. the parameters of the neural network are updated after each data point has been shown to it. This defines a training cycle. In ref. [4] it was shown that the length of training needed to achieve a given value of E3 can…
Figure 3 of the paper
Figure 3. Dependence of the χ 2 eq. (18) on the length of training: (left) total training (right) detail of the GA training. BCDMS. A training length of 4 × 104 GA cycles is necessary in order for the χ 2 of BCDMS to flatten out at χ 2 ∼ 1.2. As discussed in ref. [4], the BCDMS data can only be learnt with a longer training because they have high precision while being located in the intermediate x (valence) region, where the parton distribution displays significant variation. The E3 values for the fit of a neural net to the central data with this training is given in table 3. It shows that a
Figure 4 of the paper
Figure 4. Dependence of D σ (net)E dat on the length of training for the BCDMS experiment. It is apparent from tables 5-6 that indeed R ≈ 0.5 for all experiments. Note that, contrary to what was found in ref. [4], there is now some error reduction also for the BCDMS experiment, though by a somewhat smaller amount than for other experiments. We will come back to this issue when comparing results to those of ref. [4]. Further evidence that the error reduction is not due to parametrization bias can be obtained by studying the dependence of D σ (net)E dat on the length of training. This depen
Figure 5 of the paper
Figure 5. Final results for F2(x, Q2 ) compared to data. For the neural net result, the one-σ error band is shown. are compared, whereas in fig. 8 we display the relative pull of the two parametrizations, defined as P(x, Q2 ) ≡ F new 2 (x, Q2 ) − F old 2 (x, Q2 ) q σ 2 old(x, Q2 ) + σ 2 new(x, Q2 ) , (19) where σ(x, Q2 ) is the error on the structure function determined as the variance of the neural network sample. In view of the fact that the old fit only included BCDMS and NMC data, it is interesting to consider four regions: (a) the BCDMS region (large x, intermediate Q2
Figure 6 of the paper
Figure 6. One-σ error band for the structure function F2(x, Q2 ) computed from neural nets. Note the different scale on the y axis in the two plots. that reference neural networks were trained by minimizing E2. In fact, as discussed in sect. 4, the BCDMS experiment turns out to require the longest time to learn, especially after inclusion of the HERA data. Error reduction only obtains after this lenghty minimization process. 6 Conclusion We have presented a determination of the probability density in the space of structure functions for the structure function F2(x, Q2 ) for the proton, based o
Figure 7 of the paper
Figure 7. Comparison of the parametrization of F2(x, Q2 ) of ref. [4] (old) with that of the present paper (new). The pairs of curves correspond to a one-σ error band. Acknowledgments We thank M. Arneodo, E. Rizvi, E. Tassi and F. Zomer for informations on the HERA data, and G. d’Agostini, L. Garrido and G. Ridolfi for discussions. This work has been supported by the project GC2001SGR-00065 and by the Spanish grant AP2002-2415. 16
Figure 8 of the paper
Figure 8. The relative pull eq. (19) of the new and old F2 parametrizations. The one-σ band is also shown. A Statistical estimators We define various statistical estimators which have been used in the paper. The superscripts (dat), (art) and (net) refer respectively to the original data, to the Nrep Monte Carlo replicas of the data, and to the Nrep neural networks. The subscripts rep and dat refer respectively to whether averages are taken by summing over all replicas or over all data. • Replica averages – Average over the number of replicas for each experimental point i D F (art) i E rep = 1…

Figures are the authors', reproduced from the paper.

References (27)
  1. [4] S. Forte, L. Garrido, J.I. Latorre, A. Piccione, JHEP 0205 (2002) 062, hep-ph/0204232 on PithPith's reviewarXiv
  2. [1] See e.g. W. K. Tung, hep-ph/0409145 and refs. therein on PithPith's reviewarXiv
  3. [2] S. Forte, J. I. Latorre, L. Magnea and A. Piccione, Nucl. Phys. B 643 (2002) 477 on Pith
  4. [3] B. Adeva et al. [Spin Muon Collaboration], Phys. Rev. D 58 (1998) 112002 on Pith
  5. [5] See e.g. the HEPDATA database, http://durpdg.dur.ac.uk/HEPDATA/ on Pith
  6. [6] M. Arneodo et al. [New Muon Collaboration], Nucl. Phys. B 483 (1997) 3 on Pith
  7. [7] A. C. Benvenuti et al. [BCDMS Collaboration], Phys. Lett. B 223 (1989) 485 on Pith
  8. [8] M. R. Adams et al. [E665 Collaboration], Phys. Rev. D 54 (1996) 3006 on Pith
  9. [9] M. Derrick et al. [ZEUS Collaboration], Z. Phys. C 72 (1996) 399 on Pith
  10. [10] J. Breitweg et al. [ZEUS Collaboration], Phys. Lett. B 407 (1997) 432 on Pith
  11. [11] J. Breitweg et al. [ZEUS Collaboration], Eur. Phys. J. C 7 (1999) 609 on Pith
  12. [12] S. Chekanov et al. [ZEUS Collaboration], Eur. Phys. J. C 21 (2001) 443 on Pith
  13. [13] J. Breitweg et al. [ZEUS Collaboration], Phys. Lett. B 487 (2000) 53 on Pith
  14. [14] C. Adloff et al. [H1 Collaboration], Nucl. Phys. B 497 (1997) 3 on Pith
  15. [15] C. Adloff et al. [H1 Collaboration], Eur. Phys. J. C 13 (2000) 609. 19 on Pith
  16. [16] C. Adloff et al. [H1 Collaboration], Eur. Phys. J. C 21 (2001) 33 on Pith
  17. [17] C. Adloff et al. [H1 Collaboration], Eur. Phys. J. C 19 (2001) 269 on Pith
  18. [18] C. Adloff et al. [H1 Collaboration], Eur. Phys. J. C 30 (2003) 1 on Pith
  19. [19] S. Eidelman et al. [Particle Data Group Collaboration], Phys. Lett. B 592 (2004) 1 on Pith
  20. [20] R. Barlow, eConf C030908 (2003) WEMT002, physics/0401042; physics/0306138 on PithPith's reviewarXiv
show 7 more
  1. [21] G. D’Agostini, physics/0403086 on PithPith's reviewarXiv
  2. [22] “Bayesian reasoning in data analysis: A critical introduction” (W orld Scientific, Singapore, 2003) on Pith
  3. [23] C. Peterson and T. Rognvaldsson, Lectures at the 1991 CERN School of Computing, preprint LU-TP-91-23; B. M¨ uller, J. Reinhardt and M. T. Strickland,Neural Networks: an introduction (Springer, Berlin, 1995); G. Stimpfl-Abele and L. Garrido, Comput. Phys. Commun. 64 (1991) 46 on Pith
  4. [24] G. D’Agostini, Nucl. Instrum. Meth. A 346 (1994) 306 on Pith
  5. [25] J. Rojo and J. I. Latorre, JHEP 0401, 055 (2004) on Pith
  6. [26] W. T. Giele, S. A. Keller and D. A. Kosower, hep-ph/0104052 on PithPith's reviewarXiv
  7. [27] S. I. Alekhin, Phys. Rev. D 63 (2001) 094022. 20 on Pith
Cited by 32 Pith papers

Reviewed papers on Pith that cite this one. The full citation record

  1. Neural network determination of parton distributions: the nonsinglet case hep-ph · Jan 2007
  2. Neutrino Structure Functions from GeV to EeV Energies hep-ph · Feb 2023
  3. Two Invertible Networks for the Matrix Element Method hep-ph · Sep 2022
  4. GANplifying Event Samples hep-ph · Aug 2020
  5. Neural Network-based Top Tagger with Two-Point Energy Correlations and Geometry of Soft Emissions hep-ph · Mar 2020
  6. Nuclear Parton Distributions from Lepton-Nucleus Scattering and the Impact of an Electron-Ion Collider hep-ph · Mar 2019
  7. A Monte Carlo global analysis of the Standard Model Effective Field Theory: the top quark sector hep-ph · Jan 2019
  8. Neutrino Telescopes as QCD Microscopes hep-ph · Aug 2018
  9. A determination of the fragmentation functions of pions, kaons, and protons with faithful uncertainties hep-ph · Jun 2017
  10. Pinning down the large-x gluon with NNLO top-quark pair differential distributions hep-ph · Nov 2016
  11. Parton distributions with threshold resummation hep-ph · Jul 2015
  12. A compression algorithm for the combination of PDF sets hep-ph · Apr 2015
  13. Parton distributions for the LHC Run II hep-ph · Oct 2014
  14. A first unbiased global determination of polarized PDFs and their uncertainties hep-ph · Jun 2014
  15. Unbiased determination of polarized parton distributions and their uncertainties hep-ph · Mar 2013
  16. Reweighting NNPDFs: the W lepton asymmetry hep-ph · Dec 2010
  17. Fitting Parton Distribution Data with Multiplicative Normalization Uncertainties hep-ph · Dec 2009
  18. nNNPDF2.0: Quark Flavor Separation in Nuclei from LHC Data hep-ph · Jun 2020
  19. How to GAN Event Unweighting hep-ph · Dec 2020
  20. Parton distributions and lattice QCD calculations: a community white paper hep-ph · Nov 2017
  21. The asymptotic behaviour of parton distributions at small and large $x$ hep-ph · Mar 2016
  22. Specialized minimal PDFs for optimized LHC calculations hep-ph · Jan 2016
  23. Boosting Higgs pair production in the $b\bar{b}b\bar{b}$ final state with multivariate techniques hep-ph · Dec 2015
  24. PDF4LHC recommendations for LHC Run II hep-ph · Oct 2015
  25. Saturation in Deep Inelastic Scattering from AdS/CFT hep-ph · Apr 2008
  26. SMEFiT: a flexible toolbox for global interpretations of particle physics data with effective field theories hep-ph · Feb 2023
  27. Physics of the Electron-Ion Collider in China hep-ph · Aug 2026
  28. Lepton interactions from GeV to EeV hep-ph · Jun 2026
  29. Handbook of LHC Higgs Cross Sections: 4. Deciphering the Nature of the Higgs Sector hep-ph · Oct 2016
  30. Les Houches Physics at TeV Colliders 2005, Standard Model and Higgs working group: Summary report hep-ph · Apr 2006
  31. Fingerprinting New Physics with Effective Field Theories hep-ph · Jan 2025
  32. VBSCan Thessaloniki 2018 Workshop Summary hep-ph · Jun 2019
How the literature uses it

42 arXiv papers cite this in 57 sentences

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

Papers citing it · 28 sentences without a confident label

Uses its method or tool 14 papers
  • In [ref] we have adopted the technique presented in [ref] to the available data for polarized DIS.

    Monte Carlo analysis of CLAS data · Introduction · 0.80

  • Following the NNPDF methodology [ref] , already applied to neutral-current structure functions in [ref] , neural networks are adopted as universal unbiased interpolants and trained on available accelerator data on neutrino structure functions and differential cross sections, with the Monte Carlo replica method to estimate and propagate uncertainties.

    Neutrino Structure Functions from GeV to EeV Energies · Introduction · 0.98

  • In this study we present a model-independent determination of nuclear PDFs using machine learning methods and Monte Carlo techniques based on the NNPDF framework [ref] .

    nNNPDF2.0: Quark Flavor Separation in Nuclei from LHC Data · Introduction · 0.94

Uses its data or values 3 papers
Compares with it 1 paper
Cites it as background 11 papers
  • Complemented with the Monte Carlo ensemble method [ref] for uncertainty estimate and propagation, the NNPDF methodology is now well-established and has enabled a number of insights on proton structure, from identifying a gluonic contribution to the proton spin [ref] and the onset of BFKL dynamics in HERA data [ref] to obtaining evidence for intrinsic heavy quarks in the proton [ref] and for gluon shadowing in heavy nuclei [ref] .

    Hyperparameter Optimisation in Deep Learning from Ensemble Methods: Applications to Proton Structure · Introduction · 0.85

  • One important development in PDFs in the recent years has been the NNPDF approach [ref] .

    Parton Distributions and LHC data · Progress and open problems in parton distributions · 0.96

  • The data resampling method for PDFs was originally pioneered by the NNPDF collaboration some twenty years ago [ref] and has been adopted more recently by the JAM collaboration [ref] .

    On the determination of uncertainties in parton densities · Data resampling · 0.97

Challenges and discussion

Disagree with the review, or know something it missed? Leave a comment, or challenge this review formally: a challenge becomes a permanent entry in this paper's record, and its decision is published here.

No comments yet.

Sign in to comment