Pith. sign in

REVIEW 1 cited by

Moments of Clarity: Streamlining Latent Spaces in Machine Learning using Moment Pooling

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 2403.08854 v2 pith:BJT6UXTZ submitted 2024-03-13 hep-ph cs.LGstat.ML

classification hep-phcs.LGstat.ML
keywords latentmomentefnspoolingdimensionlearningnetworksrepresentation
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Many machine learning applications involve learning a latent representation of data, which is often high-dimensional and difficult to directly interpret. In this work, we propose "Moment Pooling", a natural extension of Deep Sets networks which drastically decrease latent space dimensionality of these networks while maintaining or even improving performance. Moment Pooling generalizes the summation in Deep Sets to arbitrary multivariate moments, which enables the model to achieve a much higher effective latent dimensionality for a fixed latent dimension. We demonstrate Moment Pooling on the collider physics task of quark/gluon jet classification by extending Energy Flow Networks (EFNs) to Moment EFNs. We find that Moment EFNs with latent dimensions as small as 1 perform similarly to ordinary EFNs with higher latent dimension. This small latent dimension allows for the internal representation to be directly visualized and interpreted, which in turn enables the learned internal jet representation to be extracted in closed form.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Explainable AI-assisted Optimization for Feynman Integral Reduction

    hep-ph 2025-02 conditional novelty 6.0 of 10

    FunSearch discovered a simple priority function for ordering IBP seeding integrals, reducing the number needed for multi-loop Feynman integral reductions by factors up to 3058.

Pith tools