Pith. sign in

REVIEW 2 cited by

(Machine) Learning to Do More with Less

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1706.09451 v3 pith:MOQ7PB3Q submitted 2017-06-28 hep-ph physics.data-anstat.ML

classification hep-phphysics.data-anstat.ML
keywords supervisedfullynetworkstrainingweaklyabilitydemonstratediscriminating
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Determining the best method for training a machine learning algorithm is critical to maximizing its ability to classify data. In this paper, we compare the standard "fully supervised" approach (that relies on knowledge of event-by-event truth-level labels) with a recent proposal that instead utilizes class ratios as the only discriminating information provided during training. This so-called "weakly supervised" technique has access to less information than the fully supervised method and yet is still able to yield impressive discriminating power. In addition, weak supervision seems particularly well suited to particle physics since quantum mechanics is incompatible with the notion of mapping an individual event onto any single Feynman diagram. We examine the technique in detail -- both analytically and numerically -- with a focus on the robustness to issues of mischaracterizing the training samples. Weakly supervised networks turn out to be remarkably insensitive to systematic mismodeling. Furthermore, we demonstrate that the event level outputs for weakly versus fully supervised networks are probing different kinematics, even though the numerical quality metrics are essentially identical. This implies that it should be possible to improve the overall classification ability by combining the output from the two types of networks. For concreteness, we apply this technology to a signature of beyond the Standard Model physics to demonstrate that all these impressive features continue to hold in a scenario of relevance to the LHC.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Mass Agnostic Jet Taggers

    hep-ph 2019-08 conditional novelty 6.0 of 10

    A systematic comparison shows that data-augmentation jet taggers (planing and PCA scaling) achieve background-preserving performance similar to adversarial networks and uBoost, with much lower training cost.

  2. How much joint resummation do we need?

    hep-ph 2019-08 conditional novelty 6.0 of 10

    Joint resummation of two angularities, rather than one or many, yields the largest gain in predicting other angularities in e+ e- dijet events.

Pith tools